Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000140.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 MedleyA-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 33K May 29 14:32 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 MedleyA-PT-06-LTLFireability-00
FORMULA_NAME MedleyA-PT-06-LTLFireability-01
FORMULA_NAME MedleyA-PT-06-LTLFireability-02
FORMULA_NAME MedleyA-PT-06-LTLFireability-03
FORMULA_NAME MedleyA-PT-06-LTLFireability-04
FORMULA_NAME MedleyA-PT-06-LTLFireability-05
FORMULA_NAME MedleyA-PT-06-LTLFireability-06
FORMULA_NAME MedleyA-PT-06-LTLFireability-07
FORMULA_NAME MedleyA-PT-06-LTLFireability-08
FORMULA_NAME MedleyA-PT-06-LTLFireability-09
FORMULA_NAME MedleyA-PT-06-LTLFireability-10
FORMULA_NAME MedleyA-PT-06-LTLFireability-11
FORMULA_NAME MedleyA-PT-06-LTLFireability-12
FORMULA_NAME MedleyA-PT-06-LTLFireability-13
FORMULA_NAME MedleyA-PT-06-LTLFireability-14
FORMULA_NAME MedleyA-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748847864833

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 07:04:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 07:04:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:04:27] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2025-06-02 07:04:27] [INFO ] Transformed 124 places.
[2025-06-02 07:04:27] [INFO ] Transformed 118 transitions.
[2025-06-02 07:04:27] [INFO ] Found NUPN structural information;
[2025-06-02 07:04:27] [INFO ] Parsed PT model containing 124 places and 118 transitions and 372 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 118/118 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 118
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 114 transition count 112
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 114 transition count 112
Applied a total of 16 rules in 46 ms. Remains 114 /124 variables (removed 10) and now considering 112/118 (removed 6) transitions.
// Phase 1: matrix 112 rows 114 cols
[2025-06-02 07:04:27] [INFO ] Computed 20 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:28] [INFO ] Implicit Places using invariants in 442 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 498 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/124 places, 112/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 577 ms. Remains : 113/124 places, 112/118 transitions.
Support contains 54 out of 113 places after structural reductions.
[2025-06-02 07:04:28] [INFO ] Flatten gal took : 64 ms
[2025-06-02 07:04:28] [INFO ] Flatten gal took : 28 ms
[2025-06-02 07:04:28] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 51 out of 113 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (1117 resets) in 2422 ms. (16 steps per ms) remains 8/34 properties
BEST_FIRST walk for 40004 steps (236 resets) in 265 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (274 resets) in 294 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (245 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (312 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (283 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (326 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (328 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (357 resets) in 154 ms. (258 steps per ms) remains 5/8 properties
// Phase 1: matrix 112 rows 113 cols
[2025-06-02 07:04:30] [INFO ] Computed 19 invariants in 4 ms
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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 43/52 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:30] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 33/85 variables, 6/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 28/113 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:30] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:30] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:30] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:30] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/24 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 112/225 variables, 113/137 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:31] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:31] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 2/139 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/225 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 139 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/38 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 47/85 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 28/113 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 6/26 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:31] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 112/225 variables, 113/140 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 4/144 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/225 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 144 constraints, problems are : Problem set: 1 solved, 4 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1656ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 525 ms.
Support contains 7 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 105
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 104 transition count 105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 104 transition count 100
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 99 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 36 place count 89 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 89 transition count 90
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 46 place count 89 transition count 87
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 86 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 84 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 84 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 83 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 82 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 81 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 81 transition count 82
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 98 place count 63 transition count 64
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
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 106 place count 59 transition count 65
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 112 place count 59 transition count 59
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 118 place count 53 transition count 59
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 121 place count 53 transition count 56
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 124 place count 50 transition count 56
Applied a total of 124 rules in 99 ms. Remains 50 /113 variables (removed 63) and now considering 56/112 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 50/113 places, 56/112 transitions.
RANDOM walk for 35908 steps (2634 resets) in 870 ms. (41 steps per ms) remains 0/4 properties
FORMULA MedleyA-PT-06-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 10 stable transitions
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' '!((X(!p0) U ((X(!p0)&&(G(p1)||(p2 U (p3||G(p2)))))||X(G(!p0)))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 112
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 98 transition count 88
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 98 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 96 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 95 transition count 85
Applied a total of 34 rules in 20 ms. Remains 95 /113 variables (removed 18) and now considering 85/112 (removed 27) transitions.
// Phase 1: matrix 85 rows 95 cols
[2025-06-02 07:04:33] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:33] [INFO ] Implicit Places using invariants in 173 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/113 places, 85/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 219 ms. Remains : 94/113 places, 85/112 transitions.
Stuttering acceptance computed with spot in 904 ms :[p0, p0, (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), true, (AND (NOT p3) (NOT p2) p0), (AND (NOT p1) p0), (AND (NOT p3) (NOT p2) p0 (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 510 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (NOT (AND p1 (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND p1 (NOT p3) p2 p0))), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p2 p0)))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 41 factoid took 29 ms. Reduced automaton from 12 states, 59 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-06-LTLFireability-01 finished in 2019 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((X(G(p0))||(p1&&G(p2)))))'
Support contains 7 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 112
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 103 transition count 103
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 103 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 101 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 101 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 100 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 100 transition count 100
Applied a total of 25 rules in 11 ms. Remains 100 /113 variables (removed 13) and now considering 100/112 (removed 12) transitions.
// Phase 1: matrix 100 rows 100 cols
[2025-06-02 07:04:35] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:35] [INFO ] Implicit Places using invariants in 84 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/113 places, 100/112 transitions.
Applied a total of 0 rules in 9 ms. Remains 99 /99 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 99/113 places, 100/112 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 29346 steps with 814 reset in 83 ms.
FORMULA MedleyA-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-02 finished in 374 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' '!(X(X((F((X(p1)||p0)) U X(p2)))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 112
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 98 transition count 88
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 98 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 97 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 96 transition count 86
Applied a total of 32 rules in 9 ms. Remains 96 /113 variables (removed 17) and now considering 86/112 (removed 26) transitions.
// Phase 1: matrix 86 rows 96 cols
[2025-06-02 07:04:35] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:35] [INFO ] Implicit Places using invariants in 84 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/113 places, 86/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 95/113 places, 86/112 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-03
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-03 finished in 371 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((((p0 U p1) U p2)||F((X(X(p1))&&F(p3))))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 112
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 99 transition count 89
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 98 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 98 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 97 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 97 transition count 87
Applied a total of 30 rules in 9 ms. Remains 97 /113 variables (removed 16) and now considering 87/112 (removed 25) transitions.
// Phase 1: matrix 87 rows 97 cols
[2025-06-02 07:04:36] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:36] [INFO ] Implicit Places using invariants in 78 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/113 places, 87/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 96/113 places, 87/112 transitions.
Stuttering acceptance computed with spot in 542 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-04
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-04 finished in 678 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 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 110 transition count 104
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 103 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 103 transition count 99
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 26 place count 98 transition count 99
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 40 place count 84 transition count 74
Iterating global reduction 2 with 14 rules applied. Total rules applied 54 place count 84 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 54 place count 84 transition count 71
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 81 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 79 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 79 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 78 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 76 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 76 transition count 66
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 112 place count 55 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 124 place count 49 transition count 54
Applied a total of 124 rules in 30 ms. Remains 49 /113 variables (removed 64) and now considering 54/112 (removed 58) transitions.
// Phase 1: matrix 54 rows 49 cols
[2025-06-02 07:04:36] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:36] [INFO ] Implicit Places using invariants in 97 ms returned [10, 15, 22, 26, 29, 42]
[2025-06-02 07:04:36] [INFO ] Actually due to overlaps returned [26, 42, 15, 10, 29]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 102 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/113 places, 54/112 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 44 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 38 transition count 48
Applied a total of 12 rules in 16 ms. Remains 38 /44 variables (removed 6) and now considering 48/54 (removed 6) transitions.
// Phase 1: matrix 48 rows 38 cols
[2025-06-02 07:04:36] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:36] [INFO ] Implicit Places using invariants in 62 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/113 places, 48/112 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 36 transition count 54
Applied a total of 2 rules in 5 ms. Remains 36 /37 variables (removed 1) and now considering 54/48 (removed -6) transitions.
// Phase 1: matrix 54 rows 36 cols
[2025-06-02 07:04:36] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-02 07:04:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:04:37] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 36/113 places, 54/112 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 372 ms. Remains : 36/113 places, 54/112 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 9458 reset in 379 ms.
Product exploration explored 100000 steps with 9550 reset in 565 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 190 steps (17 resets) in 5 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 54/54 transitions.
Applied a total of 0 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2025-06-02 07:04:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 07:04:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:04:38] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:04:38] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2025-06-02 07:04:38] [INFO ] Invariant cache hit.
[2025-06-02 07:04:38] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 54/90 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 58 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 54/90 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 42/100 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:40] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 101 constraints, problems are : Problem set: 0 solved, 42 unsolved in 2212 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3336ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 3339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3512 ms. Remains : 36/36 places, 54/54 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 198 steps (19 resets) in 4 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9504 reset in 146 ms.
Product exploration explored 100000 steps with 9487 reset in 162 ms.
Built C files in :
/tmp/ltsmin5099757668299253086
[2025-06-02 07:04:42] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2025-06-02 07:04:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 07:04:42] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2025-06-02 07:04:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 07:04:42] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2025-06-02 07:04:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 07:04:42] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5099757668299253086
Running compilation step : cd /tmp/ltsmin5099757668299253086;'/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 424 ms.
Running link step : cd /tmp/ltsmin5099757668299253086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin5099757668299253086;'/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/stateBased13908322076436706434.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA MedleyA-PT-06-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-06-LTLFireability-05 finished in 6584 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((X(X((p0 U (p1||X(p0)))))||F(p2)))))'
Support contains 7 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 112
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 102 transition count 103
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 102 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 100 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 100 transition count 101
Applied a total of 24 rules in 6 ms. Remains 100 /113 variables (removed 13) and now considering 101/112 (removed 11) transitions.
// Phase 1: matrix 101 rows 100 cols
[2025-06-02 07:04:43] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:43] [INFO ] Implicit Places using invariants in 84 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/113 places, 101/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 99/113 places, 101/112 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-06
Stuttering criterion allowed to conclude after 57749 steps with 3228 reset in 81 ms.
FORMULA MedleyA-PT-06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-06 finished in 344 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 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 111 transition count 106
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 105 transition count 106
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 105 transition count 101
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 24 place count 100 transition count 101
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 38 place count 86 transition count 76
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 86 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 52 place count 86 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 82 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 80 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 80 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 79 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 77 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 77 transition count 67
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 108 place count 58 transition count 48
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 120 place count 52 transition count 57
Applied a total of 120 rules in 31 ms. Remains 52 /113 variables (removed 61) and now considering 57/112 (removed 55) transitions.
// Phase 1: matrix 57 rows 52 cols
[2025-06-02 07:04:43] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:43] [INFO ] Implicit Places using invariants in 88 ms returned [11, 18, 25, 29, 45]
[2025-06-02 07:04:43] [INFO ] Actually due to overlaps returned [29, 45, 18, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 89 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/113 places, 57/112 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 48 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 45 transition count 54
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 41 transition count 50
Applied a total of 14 rules in 5 ms. Remains 41 /48 variables (removed 7) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 41 cols
[2025-06-02 07:04:43] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:43] [INFO ] Implicit Places using invariants in 69 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/113 places, 50/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 198 ms. Remains : 40/113 places, 50/112 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-07
Product exploration explored 100000 steps with 11250 reset in 134 ms.
Stack based approach found an accepted trace after 15849 steps with 1796 reset with depth 9 and stack size 9 in 23 ms.
FORMULA MedleyA-PT-06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-06-LTLFireability-07 finished in 439 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||G(p1)))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 111 transition count 104
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 104 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 104 transition count 99
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 99 transition count 99
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 39 place count 85 transition count 74
Iterating global reduction 2 with 14 rules applied. Total rules applied 53 place count 85 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 53 place count 85 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 81 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 79 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 79 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 78 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 77 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 76 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 76 transition count 65
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 109 place count 57 transition count 46
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 121 place count 51 transition count 55
Applied a total of 121 rules in 18 ms. Remains 51 /113 variables (removed 62) and now considering 55/112 (removed 57) transitions.
// Phase 1: matrix 55 rows 51 cols
[2025-06-02 07:04:44] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:44] [INFO ] Implicit Places using invariants in 72 ms returned [10, 16, 24, 28, 31]
[2025-06-02 07:04:44] [INFO ] Actually due to overlaps returned [28, 16, 10, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 73 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/113 places, 55/112 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 46 transition count 52
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 6 place count 44 transition count 52
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 2 with 2 rules applied. Total rules applied 8 place count 43 transition count 51
Applied a total of 8 rules in 5 ms. Remains 43 /47 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 43 cols
[2025-06-02 07:04:44] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:44] [INFO ] Implicit Places using invariants in 65 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/113 places, 51/112 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 41 transition count 57
Applied a total of 2 rules in 3 ms. Remains 41 /42 variables (removed 1) and now considering 57/51 (removed -6) transitions.
// Phase 1: matrix 57 rows 41 cols
[2025-06-02 07:04:44] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 07:04:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 07:04:44] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 41/113 places, 57/112 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 338 ms. Remains : 41/113 places, 57/112 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-08 finished in 432 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' '!(X((F((!p0&&X((p1 U X(G(p2)))))) U X(!p0))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 112
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 103 transition count 104
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 103 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 101 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 101 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 100 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 100 transition count 101
Applied a total of 24 rules in 5 ms. Remains 100 /113 variables (removed 13) and now considering 101/112 (removed 11) transitions.
// Phase 1: matrix 101 rows 100 cols
[2025-06-02 07:04:44] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:44] [INFO ] Implicit Places using invariants in 83 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/113 places, 101/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 99/113 places, 101/112 transitions.
Stuttering acceptance computed with spot in 427 ms :[p0, p0, p0, (AND p0 (NOT p2)), p0, (NOT p2), (NOT p2), (OR (NOT p2) p0), (NOT p2)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-09
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-09 finished in 544 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(p0)&&(G(p1) U X(p2))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 112
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 102 transition count 103
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 102 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 100 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 99 transition count 100
Applied a total of 26 rules in 3 ms. Remains 99 /113 variables (removed 14) and now considering 100/112 (removed 12) transitions.
// Phase 1: matrix 100 rows 99 cols
[2025-06-02 07:04:45] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:45] [INFO ] Implicit Places using invariants in 71 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/113 places, 100/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 98/113 places, 100/112 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-11 finished in 293 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 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 110 transition count 104
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 103 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 103 transition count 99
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 26 place count 98 transition count 99
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 39 place count 85 transition count 75
Iterating global reduction 2 with 13 rules applied. Total rules applied 52 place count 85 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 52 place count 85 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 81 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 80 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 79 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 78 transition count 68
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 108 place count 57 transition count 47
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 120 place count 51 transition count 56
Applied a total of 120 rules in 13 ms. Remains 51 /113 variables (removed 62) and now considering 56/112 (removed 56) transitions.
// Phase 1: matrix 56 rows 51 cols
[2025-06-02 07:04:45] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:45] [INFO ] Implicit Places using invariants in 86 ms returned [10, 25, 29, 32, 44]
[2025-06-02 07:04:45] [INFO ] Actually due to overlaps returned [29, 44, 10, 32]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 88 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/113 places, 56/112 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 46 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 43 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 40 transition count 49
Applied a total of 14 rules in 9 ms. Remains 40 /47 variables (removed 7) and now considering 49/56 (removed 7) transitions.
// Phase 1: matrix 49 rows 40 cols
[2025-06-02 07:04:45] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:45] [INFO ] Implicit Places using invariants in 61 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/113 places, 49/112 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 38 transition count 55
Applied a total of 2 rules in 4 ms. Remains 38 /39 variables (removed 1) and now considering 55/49 (removed -6) transitions.
// Phase 1: matrix 55 rows 38 cols
[2025-06-02 07:04:45] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 07:04:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-02 07:04:45] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 38/113 places, 55/112 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 340 ms. Remains : 38/113 places, 55/112 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-13 finished in 387 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' '!(X(X(p0)))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 112
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 101 transition count 102
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 101 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 99 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 98 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 98 transition count 99
Applied a total of 28 rules in 4 ms. Remains 98 /113 variables (removed 15) and now considering 99/112 (removed 13) transitions.
// Phase 1: matrix 99 rows 98 cols
[2025-06-02 07:04:45] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:45] [INFO ] Implicit Places using invariants in 104 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/113 places, 99/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 97/113 places, 99/112 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-06-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-06-LTLFireability-14 finished in 548 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' '!(X((p0&&X((p0 U (X((!p1&&F(!p2)))||G(p0)))))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 112/112 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 112
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 97 transition count 87
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 95 transition count 85
Applied a total of 34 rules in 5 ms. Remains 95 /113 variables (removed 18) and now considering 85/112 (removed 27) transitions.
// Phase 1: matrix 85 rows 95 cols
[2025-06-02 07:04:46] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:46] [INFO ] Implicit Places using invariants in 113 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/113 places, 85/112 transitions.
Applied a total of 0 rules in 0 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 94/113 places, 85/112 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, p2, (OR p1 p2), (NOT p0), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND p2 (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-15
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 179 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 16172 steps (444 resets) in 37 ms. (425 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 3 factoid took 342 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 336 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 94 cols
[2025-06-02 07:04:48] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 07:04:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:48] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-02 07:04:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:50] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/179 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 113 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4751 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/179 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 84/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:55] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:55] [INFO ] Deduced a trap along path composed of 4 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:55] [INFO ] Deduced a trap along path composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:04:56] [INFO ] Deduced a trap along path composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 202 constraints, problems are : Problem set: 0 solved, 84 unsolved in 7313 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 12080ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 12081ms
Finished structural reductions in LTL mode , in 1 iterations and 12330 ms. Remains : 94/94 places, 85/85 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 20257 steps (555 resets) in 47 ms. (422 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 1 factoid took 290 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 267 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 264 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 25000 reset in 81 ms.
Product exploration explored 100000 steps with 25000 reset in 93 ms.
Applying partial POR strategy [true, true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 266 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 94 transition count 85
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 7 place count 94 transition count 89
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 15 place count 94 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 93 transition count 88
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 93 transition count 88
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 39 place count 93 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 92 transition count 87
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 92 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 92 transition count 116
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 45 rules in 26 ms. Remains 92 /94 variables (removed 2) and now considering 116/85 (removed -31) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:05:03] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
// Phase 1: matrix 116 rows 92 cols
[2025-06-02 07:05:03] [INFO ] Computed 16 invariants in 1 ms
[2025-06-02 07:05:03] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:04] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 9 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 5 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 4 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 5 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 4 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 5 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:05:05] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 7 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 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 TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 14/30 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/30 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/122 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 7/129 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/129 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/129 constraints. Problems are: Problem set: 66 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 129 constraints, problems are : Problem set: 66 solved, 46 unsolved in 4145 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 32/84 variables, 11/11 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/12 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 14/26 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/26 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 8/92 variables, 4/30 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/30 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 116/208 variables, 92/122 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 7/129 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 46/175 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/175 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/175 constraints. Problems are: Problem set: 66 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 175 constraints, problems are : Problem set: 66 solved, 46 unsolved in 6322 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 46/112 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10507ms problems are : Problem set: 66 solved, 46 unsolved
Search for dead transitions found 66 dead transitions in 10508ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 92/94 places, 50/85 transitions.
Graph (complete) has 150 edges and 92 vertex of which 53 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 53 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 58
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 53 /92 variables (removed 39) and now considering 58/50 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/94 places, 58/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10552 ms. Remains : 53/94 places, 58/85 transitions.
Built C files in :
/tmp/ltsmin667206872508935399
[2025-06-02 07:05:13] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin667206872508935399
Running compilation step : cd /tmp/ltsmin667206872508935399;'/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 229 ms.
Running link step : cd /tmp/ltsmin667206872508935399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin667206872508935399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7858539678213253179.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA MedleyA-PT-06-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-06-LTLFireability-15 finished in 27810 ms.
All properties solved by simple procedures.
Total runtime 46965 ms.

BK_STOP 1748847914174

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="MedleyA-PT-06"
export BK_EXAMINATION="LTLFireability"
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 MedleyA-PT-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524000140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-06.tgz
mv MedleyA-PT-06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;