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.r528-tall-171683761300555.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 ltsminxred
Input is ShieldPPPt-PT-002B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761300555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 11 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 37K 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 ShieldPPPt-PT-002B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-002B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717255220189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:20:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:20:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:20:21] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-01 15:20:21] [INFO ] Transformed 159 places.
[2024-06-01 15:20:21] [INFO ] Transformed 145 transitions.
[2024-06-01 15:20:21] [INFO ] Found NUPN structural information;
[2024-06-01 15:20:21] [INFO ] Parsed PT model containing 159 places and 145 transitions and 362 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-002B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 142 transition count 128
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 142 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 141 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 141 transition count 127
Applied a total of 36 rules in 55 ms. Remains 141 /159 variables (removed 18) and now considering 127/145 (removed 18) transitions.
// Phase 1: matrix 127 rows 141 cols
[2024-06-01 15:20:21] [INFO ] Computed 23 invariants in 14 ms
[2024-06-01 15:20:22] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 15:20:22] [INFO ] Invariant cache hit.
[2024-06-01 15:20:22] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-01 15:20:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 10 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 15:20:23] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:20:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/268 variables, 141/188 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 188 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5593 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/268 variables, 141/188 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 126/314 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 15:20:29] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:20:29] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:20:29] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:20:29] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:20:29] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:20:29] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 15:20:32] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/268 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 321 constraints, problems are : Problem set: 0 solved, 126 unsolved in 8451 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 31/31 constraints]
After SMT, in 14095ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 14114ms
Starting structural reductions in LTL mode, iteration 1 : 141/159 places, 127/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14612 ms. Remains : 141/159 places, 127/145 transitions.
Support contains 20 out of 141 places after structural reductions.
[2024-06-01 15:20:36] [INFO ] Flatten gal took : 31 ms
[2024-06-01 15:20:36] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:20:36] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 1899 steps (0 resets) in 126 ms. (14 steps per ms) remains 0/11 properties
Computed a total of 33 stabilizing places and 33 stable transitions
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(p0) U X(p1)) U (G((G(p0) U X(p1)))||((G(p0) U X(p1))&&X(p2)))))'
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 127/127 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 124
Applied a total of 6 rules in 17 ms. Remains 138 /141 variables (removed 3) and now considering 124/127 (removed 3) transitions.
// Phase 1: matrix 124 rows 138 cols
[2024-06-01 15:20:36] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 15:20:36] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 15:20:36] [INFO ] Invariant cache hit.
[2024-06-01 15:20:37] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 15:20:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:37] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:39] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:39] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:20:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:20:39] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 124/262 variables, 138/182 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:40] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 183 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5666 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 22/45 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:43] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:43] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 124/262 variables, 138/185 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 123/308 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:44] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:20:44] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 4 ms to minimize.
[2024-06-01 15:20:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:20:45] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:20:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:20:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 6/314 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:46] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:20:46] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:20:46] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 15:20:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/262 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (OVERLAPS) 0/262 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 318 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9915 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 34/34 constraints]
After SMT, in 15604ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 15606ms
Starting structural reductions in LTL mode, iteration 1 : 138/141 places, 124/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15766 ms. Remains : 138/141 places, 124/127 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 220 steps with 0 reset in 6 ms.
FORMULA ShieldPPPt-PT-002B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLCardinality-00 finished in 16163 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)))'
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 140 transition count 100
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 114 transition count 100
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 114 transition count 86
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 100 transition count 86
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 95 transition count 81
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 95 transition count 81
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 90 place count 95 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 90 transition count 76
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 162 place count 59 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 59 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 58 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 173 place count 54 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 52 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 51 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 176 place count 51 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 49 transition count 39
Applied a total of 180 rules in 34 ms. Remains 49 /141 variables (removed 92) and now considering 39/127 (removed 88) transitions.
// Phase 1: matrix 39 rows 49 cols
[2024-06-01 15:20:53] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 15:20:53] [INFO ] Implicit Places using invariants in 87 ms returned [32, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/141 places, 39/127 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 45 transition count 37
Applied a total of 4 rules in 4 ms. Remains 45 /47 variables (removed 2) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 45 cols
[2024-06-01 15:20:53] [INFO ] Computed 20 invariants in 0 ms
[2024-06-01 15:20:53] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 15:20:53] [INFO ] Invariant cache hit.
[2024-06-01 15:20:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/141 places, 37/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 45/141 places, 37/127 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLCardinality-01
Product exploration explored 100000 steps with 3755 reset in 285 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLCardinality-01 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 135 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 135 transition count 121
Applied a total of 12 rules in 4 ms. Remains 135 /141 variables (removed 6) and now considering 121/127 (removed 6) transitions.
// Phase 1: matrix 121 rows 135 cols
[2024-06-01 15:20:53] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 15:20:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 15:20:53] [INFO ] Invariant cache hit.
[2024-06-01 15:20:53] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 15:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-06-01 15:20:55] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:20:55] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:20:55] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:20:55] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:20:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4919 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4624 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 9559ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9562ms
Starting structural reductions in LTL mode, iteration 1 : 135/141 places, 121/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9742 ms. Remains : 135/141 places, 121/127 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLCardinality-04
Stuttering criterion allowed to conclude after 40599 steps with 100 reset in 123 ms.
FORMULA ShieldPPPt-PT-002B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLCardinality-04 finished in 10071 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)&&F((G(F(p1))||(!p1&&F(p1)))))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 135 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 135 transition count 121
Applied a total of 12 rules in 3 ms. Remains 135 /141 variables (removed 6) and now considering 121/127 (removed 6) transitions.
[2024-06-01 15:21:03] [INFO ] Invariant cache hit.
[2024-06-01 15:21:03] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 15:21:03] [INFO ] Invariant cache hit.
[2024-06-01 15:21:03] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 15:21:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-06-01 15:21:05] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:05] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 15:21:05] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4696 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:09] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:21:09] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:21:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:21:10] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4751 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 9459ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9461ms
Starting structural reductions in LTL mode, iteration 1 : 135/141 places, 121/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9620 ms. Remains : 135/141 places, 121/127 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLCardinality-07
Product exploration explored 100000 steps with 215 reset in 134 ms.
Product exploration explored 100000 steps with 213 reset in 165 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 3587 steps (0 resets) in 15 ms. (224 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 15:21:14] [INFO ] Invariant cache hit.
[2024-06-01 15:21:14] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 15:21:14] [INFO ] Invariant cache hit.
[2024-06-01 15:21:14] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 15:21:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:17] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4891 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:21:20] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:21:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 15:21:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4611 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 9511ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9513ms
Finished structural reductions in LTL mode , in 1 iterations and 9638 ms. Remains : 135/135 places, 121/121 transitions.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 2143 steps (0 resets) in 16 ms. (126 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 194 reset in 125 ms.
Product exploration explored 100000 steps with 196 reset in 141 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 121/121 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 135 transition count 121
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 26 place count 135 transition count 129
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 37 place count 135 transition count 129
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 74 place count 135 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 135 transition count 128
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 91 place count 119 transition count 112
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 107 place count 119 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 119 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 117 transition count 110
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 117 transition count 110
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 119 place count 117 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 126 place count 110 transition count 125
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 133 place count 110 transition count 125
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 133 rules in 46 ms. Remains 110 /135 variables (removed 25) and now considering 125/121 (removed -4) transitions.
[2024-06-01 15:21:25] [INFO ] Redundant transitions in 2 ms returned []
Running 124 sub problems to find dead transitions.
// Phase 1: matrix 125 rows 110 cols
[2024-06-01 15:21:25] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 15:21:25] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 17/40 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/40 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 125/235 variables, 110/150 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 14/164 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/164 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/164 constraints. Problems are: Problem set: 82 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 164 constraints, problems are : Problem set: 82 solved, 42 unsolved in 1650 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 110/110 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 82 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 58/110 variables, 23/23 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 17/40 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/40 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 125/235 variables, 110/150 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 14/164 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 42/206 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/206 constraints. Problems are: Problem set: 82 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/235 variables, 0/206 constraints. Problems are: Problem set: 82 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 206 constraints, problems are : Problem set: 82 solved, 42 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 110/110 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 42/124 constraints, Known Traps: 17/17 constraints]
After SMT, in 2753ms problems are : Problem set: 82 solved, 42 unsolved
Search for dead transitions found 82 dead transitions in 2754ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 110/135 places, 43/121 transitions.
Graph (complete) has 145 edges and 110 vertex of which 53 are kept as prefixes of interest. Removing 57 places using SCC suffix rule.1 ms
Discarding 57 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 53 /110 variables (removed 57) and now considering 43/43 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/135 places, 43/121 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2812 ms. Remains : 53/135 places, 43/121 transitions.
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 135 cols
[2024-06-01 15:21:28] [INFO ] Computed 23 invariants in 0 ms
[2024-06-01 15:21:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 15:21:28] [INFO ] Invariant cache hit.
[2024-06-01 15:21:28] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 15:21:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:21:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:30] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:21:30] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4982 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:34] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:21:34] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:21:34] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:21:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4619 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 9611ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9613ms
Finished structural reductions in LTL mode , in 1 iterations and 9758 ms. Remains : 135/135 places, 121/121 transitions.
Treatment of property ShieldPPPt-PT-002B-LTLCardinality-07 finished in 34476 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)))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 101
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 115 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 114 transition count 100
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 52 place count 114 transition count 87
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 78 place count 101 transition count 87
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 83 place count 96 transition count 82
Iterating global reduction 3 with 5 rules applied. Total rules applied 88 place count 96 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 88 place count 96 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 98 place count 91 transition count 77
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 162 place count 59 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 59 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 58 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 173 place count 54 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 52 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 51 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 176 place count 51 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 50 transition count 40
Applied a total of 178 rules in 22 ms. Remains 50 /141 variables (removed 91) and now considering 40/127 (removed 87) transitions.
// Phase 1: matrix 40 rows 50 cols
[2024-06-01 15:21:38] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 15:21:38] [INFO ] Implicit Places using invariants in 45 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/141 places, 40/127 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 39
Applied a total of 2 rules in 3 ms. Remains 48 /49 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 48 cols
[2024-06-01 15:21:38] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 15:21:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 15:21:38] [INFO ] Invariant cache hit.
[2024-06-01 15:21:38] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/141 places, 39/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 48/141 places, 39/127 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLCardinality-12
Product exploration explored 100000 steps with 1216 reset in 122 ms.
Stack based approach found an accepted trace after 361 steps with 2 reset with depth 85 and stack size 82 in 1 ms.
FORMULA ShieldPPPt-PT-002B-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLCardinality-12 finished in 364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 135 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 135 transition count 121
Applied a total of 12 rules in 3 ms. Remains 135 /141 variables (removed 6) and now considering 121/127 (removed 6) transitions.
// Phase 1: matrix 121 rows 135 cols
[2024-06-01 15:21:38] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 15:21:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 15:21:38] [INFO ] Invariant cache hit.
[2024-06-01 15:21:38] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 15:21:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:40] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-06-01 15:21:40] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:40] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/256 variables, 135/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:41] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 177 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4849 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/256 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 120/297 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 15:21:44] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 15:21:44] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:21:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:21:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 301 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4667 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 9529ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9531ms
Starting structural reductions in LTL mode, iteration 1 : 135/141 places, 121/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9659 ms. Remains : 135/141 places, 121/127 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 114 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLCardinality-13 finished in 9770 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((G(p1)||p0))))'
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 101
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 101
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 50 place count 115 transition count 86
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 80 place count 100 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 98 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 98 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 84 place count 98 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 96 transition count 82
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 154 place count 63 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 63 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 62 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 167 place count 57 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 55 transition count 45
Applied a total of 169 rules in 22 ms. Remains 55 /141 variables (removed 86) and now considering 45/127 (removed 82) transitions.
// Phase 1: matrix 45 rows 55 cols
[2024-06-01 15:21:48] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 15:21:48] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 15:21:48] [INFO ] Invariant cache hit.
[2024-06-01 15:21:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 15:21:48] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 15:21:48] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-06-01 15:21:48] [INFO ] Invariant cache hit.
[2024-06-01 15:21:48] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 3/55 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 15:21:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 15:21:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 45/100 variables, 55/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 82 constraints, problems are : Problem set: 0 solved, 40 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 3/55 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 45/100 variables, 55/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 122 constraints, problems are : Problem set: 0 solved, 40 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
After SMT, in 1030ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1030ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/141 places, 45/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1144 ms. Remains : 55/141 places, 45/127 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLCardinality-14
Product exploration explored 100000 steps with 143 reset in 190 ms.
Stack based approach found an accepted trace after 22 steps with 2 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLCardinality-14 finished in 1420 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)&&F((G(F(p1))||(!p1&&F(p1)))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-002B-LTLCardinality-07
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 141/141 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 101
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 101
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 50 place count 115 transition count 86
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 80 place count 100 transition count 86
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 95 transition count 81
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 95 transition count 81
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 90 place count 95 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 90 transition count 76
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 154 place count 63 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 63 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 62 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 167 place count 57 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 56 transition count 46
Applied a total of 168 rules in 13 ms. Remains 56 /141 variables (removed 85) and now considering 46/127 (removed 81) transitions.
// Phase 1: matrix 46 rows 56 cols
[2024-06-01 15:21:49] [INFO ] Computed 23 invariants in 0 ms
[2024-06-01 15:21:50] [INFO ] Implicit Places using invariants in 40 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 55/141 places, 46/127 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 55 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 44
Applied a total of 4 rules in 2 ms. Remains 53 /55 variables (removed 2) and now considering 44/46 (removed 2) transitions.
// Phase 1: matrix 44 rows 53 cols
[2024-06-01 15:21:50] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 15:21:50] [INFO ] Implicit Places using invariants in 35 ms returned [36, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 51/141 places, 44/127 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 43
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-06-01 15:21:50] [INFO ] Computed 20 invariants in 0 ms
[2024-06-01 15:21:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 15:21:50] [INFO ] Invariant cache hit.
[2024-06-01 15:21:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 15:21:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 50/141 places, 43/127 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 240 ms. Remains : 50/141 places, 43/127 transitions.
Running random walk in product with property : ShieldPPPt-PT-002B-LTLCardinality-07
Product exploration explored 100000 steps with 1186 reset in 159 ms.
Stack based approach found an accepted trace after 14490 steps with 166 reset with depth 159 and stack size 153 in 28 ms.
Treatment of property ShieldPPPt-PT-002B-LTLCardinality-07 finished in 704 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 15:21:50] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:21:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 15:21:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 141 places, 127 transitions and 326 arcs took 4 ms.
Total runtime 89030 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPt-PT-002B-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717255310745

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPt-PT-002B-LTLCardinality-07
ltl formula formula --ltl=/tmp/1578/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 141 places, 127 transitions and 326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1578/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1578/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1578/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1578/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 143 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 142, there are 174 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~199!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 256
pnml2lts-mc( 0/ 4): unique states count: 1083
pnml2lts-mc( 0/ 4): unique transitions count: 4700
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 88
pnml2lts-mc( 0/ 4): - claim found count: 182
pnml2lts-mc( 0/ 4): - claim success count: 1095
pnml2lts-mc( 0/ 4): - cum. max stack depth: 844
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1095 states 4729 transitions, fanout: 4.319
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.017 sec on average)
pnml2lts-mc( 0/ 4): States per second: 54750, Transitions per second: 236450
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.5 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 127 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="ShieldPPPt-PT-002B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPt-PT-002B, 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 r528-tall-171683761300555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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