Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994300395.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d0m96, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994300395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 57K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749155243107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m96
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 20:27:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 20:27:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:27:24] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2025-06-05 20:27:24] [INFO ] Transformed 262 places.
[2025-06-05 20:27:24] [INFO ] Transformed 73 transitions.
[2025-06-05 20:27:24] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 62 transition count 65
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 61 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 60 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 60 transition count 62
Applied a total of 23 rules in 27 ms. Remains 60 /72 variables (removed 12) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2025-06-05 20:27:24] [INFO ] Computed 5 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:27:24] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-05 20:27:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:27:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 20:27:24] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-05 20:27:24] [INFO ] Invariant cache hit.
[2025-06-05 20:27:24] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:25] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:26] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:26] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:26] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:26] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:26] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:26] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:27] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:27] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:30] [INFO ] Deduced a trap along path composed of 14 places in 37 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 165 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4893 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8479ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 8490ms
Starting structural reductions in LTL mode, iteration 1 : 60/72 places, 62/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8928 ms. Remains : 60/72 places, 62/73 transitions.
Support contains 6 out of 60 places after structural reductions.
[2025-06-05 20:27:33] [INFO ] Flatten gal took : 20 ms
[2025-06-05 20:27:33] [INFO ] Flatten gal took : 9 ms
[2025-06-05 20:27:33] [INFO ] Input system was already deterministic with 62 transitions.
RANDOM walk for 40000 steps (8896 resets) in 1016 ms. (39 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (4133 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4136 resets) in 277 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4078 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4114 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
[2025-06-05 20:27:34] [INFO ] Invariant cache hit.
[2025-06-05 20:27:34] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 5 (OVERLAPS) 12/49 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 55/104 variables, 49/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 18/72 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 18/122 variables, 11/83 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 7/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 90 constraints, problems are : Problem set: 1 solved, 3 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/49 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 55/104 variables, 49/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 18/72 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 18/122 variables, 11/84 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 7/91 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 2/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/122 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 93 constraints, problems are : Problem set: 1 solved, 3 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 62/62 transitions.
Graph (complete) has 165 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 59 transition count 60
Applied a total of 3 rules in 10 ms. Remains 59 /60 variables (removed 1) and now considering 60/62 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 59/60 places, 60/62 transitions.
RANDOM walk for 40000 steps (8878 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4058 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4171 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (4131 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 379 steps, run visited all 3 properties in 9 ms. (steps per millisecond=42 )
Probabilistic random walk after 379 steps, saw 220 distinct states, run finished after 12 ms. (steps per millisecond=31 ) properties seen :3
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(p1)))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-05 20:27:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:27:35] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 20:27:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:27:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 20:27:35] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:27:35] [INFO ] Redundant transitions in 0 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 20:27:35] [INFO ] Invariant cache hit.
[2025-06-05 20:27:35] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:35] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:36] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:36] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:36] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:36] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:37] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:37] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:39] [INFO ] Deduced a trap along path composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 165 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8072ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 8073ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8229 ms. Remains : 60/60 places, 62/62 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02
Product exploration explored 100000 steps with 22421 reset in 230 ms.
Product exploration explored 100000 steps with 22505 reset in 153 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (9000 resets) in 366 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4221 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4140 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 377 steps, run visited all 2 properties in 8 ms. (steps per millisecond=47 )
Probabilistic random walk after 377 steps, saw 219 distinct states, run finished after 8 ms. (steps per millisecond=47 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 11 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2025-06-05 20:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:27:44] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-05 20:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:27:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 20:27:44] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:27:44] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-05 20:27:44] [INFO ] Invariant cache hit.
[2025-06-05 20:27:44] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:45] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/164 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:49] [INFO ] Deduced a trap along path composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 165 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4757 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7955ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7955ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8121 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (8912 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4138 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4022 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 377 steps, run visited all 2 properties in 6 ms. (steps per millisecond=62 )
Probabilistic random walk after 377 steps, saw 219 distinct states, run finished after 6 ms. (steps per millisecond=62 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 22357 reset in 105 ms.
Product exploration explored 100000 steps with 22462 reset in 105 ms.
Built C files in :
/tmp/ltsmin16510741534013116619
[2025-06-05 20:27:53] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2025-06-05 20:27:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:27:53] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2025-06-05 20:27:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:27:53] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2025-06-05 20:27:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:27:53] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16510741534013116619
Running compilation step : cd /tmp/ltsmin16510741534013116619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 263 ms.
Running link step : cd /tmp/ltsmin16510741534013116619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16510741534013116619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8105920227893138041.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02 finished in 18974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 6 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 59 cols
[2025-06-05 20:27:54] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:27:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 20:27:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:27:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 20:27:54] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 20:27:54] [INFO ] Invariant cache hit.
[2025-06-05 20:27:54] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:55] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:55] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:55] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2403 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:57] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:27:57] [INFO ] Deduced a trap along path composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6698ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6698ms
Starting structural reductions in LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6838 ms. Remains : 59/60 places, 61/62 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03 finished in 6981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 6 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2025-06-05 20:28:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:28:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 20:28:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:28:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 20:28:01] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:28:01] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 20:28:01] [INFO ] Invariant cache hit.
[2025-06-05 20:28:01] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:01] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2432 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:04] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:04] [INFO ] Deduced a trap along path composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6712ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6852 ms. Remains : 59/60 places, 61/62 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06
Stuttering criterion allowed to conclude after 14680 steps with 3303 reset in 17 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06 finished in 6924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 9 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
[2025-06-05 20:28:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:28:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 20:28:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:28:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 20:28:08] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:28:08] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 20:28:08] [INFO ] Invariant cache hit.
[2025-06-05 20:28:08] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:08] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:09] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:09] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2405 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:11] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:11] [INFO ] Deduced a trap along path composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6660ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6661ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6803 ms. Remains : 59/60 places, 61/62 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14
Product exploration explored 100000 steps with 22488 reset in 121 ms.
Product exploration explored 100000 steps with 22459 reset in 149 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8903 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4080 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 379 steps, run visited all 1 properties in 5 ms. (steps per millisecond=75 )
Probabilistic random walk after 379 steps, saw 220 distinct states, run finished after 5 ms. (steps per millisecond=75 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2025-06-05 20:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:28:15] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 20:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:28:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 20:28:15] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:28:15] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-05 20:28:15] [INFO ] Invariant cache hit.
[2025-06-05 20:28:15] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:16] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:16] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:16] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:17] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:17] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:17] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2518 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:19] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:28:19] [INFO ] Deduced a trap along path composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4217 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6751ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6751ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6900 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8996 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4090 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 379 steps, run visited all 1 properties in 2 ms. (steps per millisecond=189 )
Probabilistic random walk after 379 steps, saw 220 distinct states, run finished after 2 ms. (steps per millisecond=189 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22375 reset in 100 ms.
Product exploration explored 100000 steps with 22438 reset in 97 ms.
Built C files in :
/tmp/ltsmin1038399573526867638
[2025-06-05 20:28:23] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2025-06-05 20:28:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:28:23] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2025-06-05 20:28:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:28:23] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2025-06-05 20:28:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 20:28:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1038399573526867638
Running compilation step : cd /tmp/ltsmin1038399573526867638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 161 ms.
Running link step : cd /tmp/ltsmin1038399573526867638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1038399573526867638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1502535116189960318.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 finished in 15597 ms.
All properties solved by simple procedures.
Total runtime 59348 ms.

BK_STOP 1749155303645

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SieveSingleMsgMbox-PT-d0m96"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m96, 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 r212-tall-174901994300395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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