Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500476.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 CO4-PT-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 191K 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 CO4-PT-13-LTLFireability-00
FORMULA_NAME CO4-PT-13-LTLFireability-01
FORMULA_NAME CO4-PT-13-LTLFireability-02
FORMULA_NAME CO4-PT-13-LTLFireability-03
FORMULA_NAME CO4-PT-13-LTLFireability-04
FORMULA_NAME CO4-PT-13-LTLFireability-05
FORMULA_NAME CO4-PT-13-LTLFireability-06
FORMULA_NAME CO4-PT-13-LTLFireability-07
FORMULA_NAME CO4-PT-13-LTLFireability-08
FORMULA_NAME CO4-PT-13-LTLFireability-09
FORMULA_NAME CO4-PT-13-LTLFireability-10
FORMULA_NAME CO4-PT-13-LTLFireability-11
FORMULA_NAME CO4-PT-13-LTLFireability-12
FORMULA_NAME CO4-PT-13-LTLFireability-13
FORMULA_NAME CO4-PT-13-LTLFireability-14
FORMULA_NAME CO4-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748607178112

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 12:12:59] [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-05-30 12:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:12:59] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2025-05-30 12:12:59] [INFO ] Transformed 649 places.
[2025-05-30 12:12:59] [INFO ] Transformed 816 transitions.
[2025-05-30 12:12:59] [INFO ] Found NUPN structural information;
[2025-05-30 12:12:59] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 11 ms
Reduce places removed 172 places and 227 transitions.
FORMULA CO4-PT-13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-13-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 589/589 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 585
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 99 place count 382 transition count 505
Iterating global reduction 1 with 79 rules applied. Total rules applied 178 place count 382 transition count 505
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 244 place count 316 transition count 420
Iterating global reduction 1 with 66 rules applied. Total rules applied 310 place count 316 transition count 420
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 315 place count 316 transition count 415
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 348 place count 283 transition count 380
Iterating global reduction 2 with 33 rules applied. Total rules applied 381 place count 283 transition count 380
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 401 place count 263 transition count 360
Iterating global reduction 2 with 20 rules applied. Total rules applied 421 place count 263 transition count 360
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 426 place count 263 transition count 355
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 431 place count 258 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 436 place count 258 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 437 place count 257 transition count 349
Iterating global reduction 3 with 1 rules applied. Total rules applied 438 place count 257 transition count 349
Applied a total of 438 rules in 114 ms. Remains 257 /477 variables (removed 220) and now considering 349/589 (removed 240) transitions.
// Phase 1: matrix 349 rows 257 cols
[2025-05-30 12:12:59] [INFO ] Computed 6 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:13:00] [INFO ] Implicit Places using invariants in 275 ms returned [6, 187]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 311 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/477 places, 349/589 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 448 ms. Remains : 255/477 places, 349/589 transitions.
Support contains 24 out of 255 places after structural reductions.
[2025-05-30 12:13:00] [INFO ] Flatten gal took : 44 ms
[2025-05-30 12:13:00] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:13:00] [INFO ] Input system was already deterministic with 349 transitions.
RANDOM walk for 40000 steps (209 resets) in 2021 ms. (19 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (28 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (29 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4002 steps (27 resets) in 42 ms. (93 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (24 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (29 resets) in 22 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (27 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 13/13 properties
// Phase 1: matrix 349 rows 255 cols
[2025-05-30 12:13:01] [INFO ] Computed 4 invariants in 5 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 13/46 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 126/172 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 188/360 variables, 79/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 162/522 variables, 81/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 11 (OVERLAPS) 57/579 variables, 35/245 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 17/596 variables, 9/254 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/596 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 7/603 variables, 4/258 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 1/604 variables, 1/259 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/604 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 0/604 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 259 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 16/32 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 13/45 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:02] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 124/169 variables, 45/50 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 3/53 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 187/356 variables, 78/131 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 9/140 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 164/520 variables, 82/222 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 59/579 variables, 36/258 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 17/596 variables, 9/267 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/596 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 7/603 variables, 4/271 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/603 variables, 0/271 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 1/604 variables, 1/272 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/604 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 0/604 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 272 constraints, problems are : Problem set: 1 solved, 12 unsolved in 3232 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4437ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 11 properties in 1304 ms.
Support contains 2 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 349/349 transitions.
Graph (trivial) has 266 edges and 255 vertex of which 3 / 255 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 525 edges and 253 vertex of which 239 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 120 rules applied. Total rules applied 122 place count 239 transition count 214
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 225 place count 136 transition count 214
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 225 place count 136 transition count 194
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 265 place count 116 transition count 194
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 268 place count 113 transition count 191
Iterating global reduction 2 with 3 rules applied. Total rules applied 271 place count 113 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 273 place count 113 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 273 place count 113 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 112 transition count 188
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 279 place count 108 transition count 182
Iterating global reduction 3 with 4 rules applied. Total rules applied 283 place count 108 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 285 place count 108 transition count 180
Performed 43 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 371 place count 65 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 376 place count 65 transition count 120
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 380 place count 61 transition count 114
Iterating global reduction 5 with 4 rules applied. Total rules applied 384 place count 61 transition count 114
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 5 with 2 rules applied. Total rules applied 386 place count 60 transition count 113
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 387 place count 60 transition count 112
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 419 place count 44 transition count 129
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 442 place count 44 transition count 106
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 453 place count 33 transition count 73
Iterating global reduction 7 with 11 rules applied. Total rules applied 464 place count 33 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 471 place count 33 transition count 66
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 474 place count 30 transition count 51
Iterating global reduction 8 with 3 rules applied. Total rules applied 477 place count 30 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 479 place count 30 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 481 place count 29 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 484 place count 29 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 491 place count 29 transition count 46
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 498 place count 29 transition count 39
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 505 place count 22 transition count 39
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 507 place count 22 transition count 39
Graph (complete) has 72 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 508 place count 21 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 510 place count 21 transition count 37
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 512 place count 21 transition count 37
Graph (complete) has 66 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 513 place count 20 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 515 place count 20 transition count 35
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 517 place count 20 transition count 35
Graph (complete) has 60 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 518 place count 19 transition count 35
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 520 place count 19 transition count 33
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 523 place count 19 transition count 33
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 524 place count 19 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 525 place count 18 transition count 31
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t95.t99.t294.t92.t326 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 18 with 3 rules applied. Total rules applied 528 place count 15 transition count 28
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 12 edges and 12 vertex of which 6 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 19 with 5 rules applied. Total rules applied 533 place count 7 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 20 with 19 rules applied. Total rules applied 552 place count 7 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 553 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 554 place count 6 transition count 7
Applied a total of 554 rules in 63 ms. Remains 6 /255 variables (removed 249) and now considering 7/349 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 6/255 places, 7/349 transitions.
RANDOM walk for 40000 steps (10 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (6664 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17 steps, run visited all 1 properties in 8 ms. (steps per millisecond=2 )
Probabilistic random walk after 17 steps, saw 10 distinct states, run finished after 11 ms. (steps per millisecond=1 ) properties seen :1
FORMULA CO4-PT-13-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CO4-PT-13-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 528 edges and 255 vertex of which 249 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 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 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Graph (trivial) has 261 edges and 255 vertex of which 3 / 255 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 526 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 246 transition count 243
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 150 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 148 transition count 241
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 198 place count 148 transition count 221
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 238 place count 128 transition count 221
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 241 place count 125 transition count 217
Iterating global reduction 3 with 3 rules applied. Total rules applied 244 place count 125 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 246 place count 125 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 246 place count 125 transition count 214
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 124 transition count 214
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 250 place count 122 transition count 210
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 122 transition count 210
Performed 45 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 342 place count 77 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 347 place count 77 transition count 144
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 351 place count 73 transition count 138
Iterating global reduction 5 with 4 rules applied. Total rules applied 355 place count 73 transition count 138
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 391 place count 55 transition count 158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 400 place count 55 transition count 149
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 411 place count 44 transition count 105
Iterating global reduction 6 with 11 rules applied. Total rules applied 422 place count 44 transition count 105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 430 place count 44 transition count 97
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 433 place count 41 transition count 79
Iterating global reduction 7 with 3 rules applied. Total rules applied 436 place count 41 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 438 place count 41 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 442 place count 39 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 458 place count 39 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 460 place count 37 transition count 75
Applied a total of 460 rules in 48 ms. Remains 37 /255 variables (removed 218) and now considering 75/349 (removed 274) transitions.
[2025-05-30 12:13:07] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
// Phase 1: matrix 72 rows 37 cols
[2025-05-30 12:13:07] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:13:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 12:13:07] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2025-05-30 12:13:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:13:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-05-30 12:13:07] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:13:07] [INFO ] Redundant transitions in 14 ms returned []
Running 69 sub problems to find dead transitions.
[2025-05-30 12:13:07] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2025-05-30 12:13:07] [INFO ] Invariant cache hit.
[2025-05-30 12:13:07] [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/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 71/108 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 53 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 71/108 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 69/121 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/109 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 122 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2391 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4065ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 4067ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/255 places, 75/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4228 ms. Remains : 37/255 places, 75/349 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-00
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA CO4-PT-13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-00 finished in 4440 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&&X(!p1)) U (G((!p1&&X(!p1)))||(X(!p1)&&p2))))) U (p3||X(p1))))'
Support contains 6 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 248 transition count 341
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 248 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 248 transition count 339
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 245 transition count 335
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 245 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 245 transition count 334
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 244 transition count 333
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 244 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 243 transition count 332
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 243 transition count 332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 243 transition count 331
Applied a total of 28 rules in 19 ms. Remains 243 /255 variables (removed 12) and now considering 331/349 (removed 18) transitions.
// Phase 1: matrix 331 rows 243 cols
[2025-05-30 12:13:11] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:13:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-30 12:13:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:13:12] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2025-05-30 12:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:15] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:16] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:16] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 331/574 variables, 243/251 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/574 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 251 constraints, problems are : Problem set: 0 solved, 330 unsolved in 22101 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 331/574 variables, 243/251 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 330/581 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:44] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 582 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52229ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 52231ms
Starting structural reductions in LTL mode, iteration 1 : 243/255 places, 331/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52460 ms. Remains : 243/255 places, 331/349 transitions.
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), false, (AND (NOT p1) (NOT p3)), true, p1, (AND p1 p2), p1, p1, p1]
Running random walk in product with property : CO4-PT-13-LTLFireability-01
Product exploration explored 100000 steps with 22159 reset in 307 ms.
Product exploration explored 100000 steps with 22242 reset in 177 ms.
Computed a total of 15 stabilizing places and 21 stable transitions
Graph (complete) has 504 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p3))), (X (X (OR p2 (NOT p1) p0))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 209 ms. Reduced automaton from 10 states, 31 edges and 4 AP (stutter sensitive) to 8 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, p1, (AND p1 p2), p1, p1, p1]
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (174 resets) in 448 ms. (89 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (26 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (27 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (28 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (21 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (19 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (29 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (19 resets) in 40 ms. (97 steps per ms) remains 10/17 properties
BEST_FIRST walk for 4000 steps (29 resets) in 20 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 10/10 properties
[2025-05-30 12:14:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf8 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/35 variables, 3/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 99/134 variables, 35/39 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 181/315 variables, 72/111 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 169/484 variables, 82/193 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 63/547 variables, 39/232 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/232 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 17/564 variables, 9/241 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/241 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 9/573 variables, 5/246 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/573 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem apf4 is UNSAT
Problem apf14 is UNSAT
At refinement iteration 17 (OVERLAPS) 1/574 variables, 1/247 constraints. Problems are: Problem set: 4 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/574 variables, 0/247 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/574 variables, 0/247 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 247 constraints, problems are : Problem set: 4 solved, 6 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/35 variables, 3/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 99/134 variables, 35/39 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 181/315 variables, 72/111 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 6/117 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:14:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 1/118 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 169/484 variables, 82/200 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/200 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 63/547 variables, 39/239 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/239 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 17/564 variables, 9/248 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/564 variables, 0/248 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 9/573 variables, 5/253 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/573 variables, 0/253 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/574 variables, 1/254 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/574 variables, 0/254 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/574 variables, 0/254 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 254 constraints, problems are : Problem set: 4 solved, 6 unsolved in 1697 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2486ms problems are : Problem set: 4 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 92 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 6 properties in 210 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p3))), (X (X (OR p2 (NOT p1) p0))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0)))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) (NOT p2))))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F p1), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) (NOT p3)))), (F p3), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1) p2)))
Knowledge based reduction with 31 factoid took 155 ms. Reduced automaton from 8 states, 26 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-13-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-13-LTLFireability-01 finished in 57099 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(p0)))||G(p1)))'
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 246 transition count 339
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 246 transition count 339
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 246 transition count 337
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 241 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 241 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 241 transition count 329
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 239 transition count 327
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 239 transition count 327
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 237 transition count 325
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 237 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 237 transition count 324
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 236 transition count 323
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 236 transition count 323
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 235 transition count 322
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 235 transition count 322
Applied a total of 44 rules in 29 ms. Remains 235 /255 variables (removed 20) and now considering 322/349 (removed 27) transitions.
// Phase 1: matrix 322 rows 235 cols
[2025-05-30 12:14:08] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:14:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-30 12:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:14:09] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-05-30 12:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:14:13] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:14:13] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:14:13] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:14:13] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 243 constraints, problems are : Problem set: 0 solved, 321 unsolved in 21900 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/564 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:14:42] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 565 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51997ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 51998ms
Starting structural reductions in LTL mode, iteration 1 : 235/255 places, 322/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52368 ms. Remains : 235/255 places, 322/349 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-13-LTLFireability-02
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-02 finished in 52616 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((p0&&X((p0||X(p1))))))&&(!p1 U (p2||G(!p1))))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 247 transition count 341
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 247 transition count 341
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 242 transition count 334
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 242 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 242 transition count 333
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 240 transition count 331
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 240 transition count 331
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 238 transition count 329
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 238 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 238 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 237 transition count 327
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 237 transition count 327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 236 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 236 transition count 326
Applied a total of 40 rules in 20 ms. Remains 236 /255 variables (removed 19) and now considering 326/349 (removed 23) transitions.
// Phase 1: matrix 326 rows 236 cols
[2025-05-30 12:15:01] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:15:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-30 12:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:15:01] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-05-30 12:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:15:05] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:15:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:15:05] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:15:05] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/562 variables, 236/244 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/562 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 244 constraints, problems are : Problem set: 0 solved, 325 unsolved in 21724 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/562 variables, 236/244 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 325/569 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:15:33] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 570 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51808ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 51809ms
Starting structural reductions in LTL mode, iteration 1 : 236/255 places, 326/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52038 ms. Remains : 236/255 places, 326/349 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-13-LTLFireability-04
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA CO4-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-04 finished in 52377 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 2 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Graph (trivial) has 266 edges and 255 vertex of which 3 / 255 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 526 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 247 transition count 243
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 196 place count 150 transition count 243
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 196 place count 150 transition count 222
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 238 place count 129 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 241 place count 126 transition count 218
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 126 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 126 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 246 place count 126 transition count 215
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 125 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 250 place count 123 transition count 211
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 123 transition count 211
Performed 46 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 344 place count 77 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 349 place count 77 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 353 place count 73 transition count 140
Iterating global reduction 4 with 4 rules applied. Total rules applied 357 place count 73 transition count 140
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 393 place count 55 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 400 place count 55 transition count 153
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 411 place count 44 transition count 109
Iterating global reduction 5 with 11 rules applied. Total rules applied 422 place count 44 transition count 109
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 429 place count 44 transition count 102
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 432 place count 41 transition count 84
Iterating global reduction 6 with 3 rules applied. Total rules applied 435 place count 41 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 437 place count 41 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 441 place count 39 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 473 place count 39 transition count 75
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 477 place count 39 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 479 place count 37 transition count 73
Applied a total of 479 rules in 39 ms. Remains 37 /255 variables (removed 218) and now considering 73/349 (removed 276) transitions.
[2025-05-30 12:15:53] [INFO ] Flow matrix only has 59 transitions (discarded 14 similar events)
// Phase 1: matrix 59 rows 37 cols
[2025-05-30 12:15:53] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:15:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 12:15:54] [INFO ] Flow matrix only has 59 transitions (discarded 14 similar events)
[2025-05-30 12:15:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:15:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:15:54] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:15:54] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-05-30 12:15:54] [INFO ] Flow matrix only has 59 transitions (discarded 14 similar events)
[2025-05-30 12:15:54] [INFO ] Invariant cache hit.
[2025-05-30 12:15:54] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 58/95 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 1/96 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 43 constraints, problems are : Problem set: 0 solved, 58 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 58/95 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 58/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 1/96 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1622 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2596ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2596ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/255 places, 73/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2725 ms. Remains : 37/255 places, 73/349 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-05
Product exploration explored 100000 steps with 21 reset in 74 ms.
Product exploration explored 100000 steps with 121 reset in 69 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Graph (complete) has 147 edges and 37 vertex of which 35 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33583 steps (4024 resets) in 352 ms. (95 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 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 73/73 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2025-05-30 12:15:57] [INFO ] Flow matrix only has 59 transitions (discarded 14 similar events)
[2025-05-30 12:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:15:57] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 12:15:57] [INFO ] Flow matrix only has 59 transitions (discarded 14 similar events)
[2025-05-30 12:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:15:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:15:57] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:15:57] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2025-05-30 12:15:57] [INFO ] Flow matrix only has 59 transitions (discarded 14 similar events)
[2025-05-30 12:15:57] [INFO ] Invariant cache hit.
[2025-05-30 12:15:57] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 58/95 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 1/96 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 43 constraints, problems are : Problem set: 0 solved, 58 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 58/95 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 58/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 1/96 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2543ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2543ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2638 ms. Remains : 37/37 places, 73/73 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Graph (complete) has 147 edges and 37 vertex of which 35 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4774 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (602 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10758 steps, run visited all 1 properties in 20 ms. (steps per millisecond=537 )
Probabilistic random walk after 10758 steps, saw 2601 distinct states, run finished after 20 ms. (steps per millisecond=537 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 42 ms.
Product exploration explored 100000 steps with 0 reset in 146 ms.
Built C files in :
/tmp/ltsmin3982858058148928161
[2025-05-30 12:16:00] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2025-05-30 12:16:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:16:00] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2025-05-30 12:16:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:16:00] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2025-05-30 12:16:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:16:00] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3982858058148928161
Running compilation step : cd /tmp/ltsmin3982858058148928161;'/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 280 ms.
Running link step : cd /tmp/ltsmin3982858058148928161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3982858058148928161;'/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/stateBased9492620375663746915.hoa' '--buchi-type=spotba'
LTSmin run took 411 ms.
FORMULA CO4-PT-13-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLFireability-05 finished in 7764 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 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Graph (trivial) has 268 edges and 255 vertex of which 3 / 255 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 526 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 246 transition count 240
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 200 place count 147 transition count 240
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 200 place count 147 transition count 219
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 242 place count 126 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 244 place count 124 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 124 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 248 place count 124 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 248 place count 124 transition count 213
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 250 place count 123 transition count 213
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 251 place count 122 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 252 place count 122 transition count 211
Performed 47 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 346 place count 75 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 351 place count 75 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 355 place count 71 transition count 138
Iterating global reduction 4 with 4 rules applied. Total rules applied 359 place count 71 transition count 138
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 395 place count 53 transition count 158
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 404 place count 53 transition count 149
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 415 place count 42 transition count 105
Iterating global reduction 5 with 11 rules applied. Total rules applied 426 place count 42 transition count 105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 434 place count 42 transition count 97
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 437 place count 39 transition count 79
Iterating global reduction 6 with 3 rules applied. Total rules applied 440 place count 39 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 442 place count 39 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 446 place count 37 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 474 place count 37 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 476 place count 35 transition count 65
Applied a total of 476 rules in 28 ms. Remains 35 /255 variables (removed 220) and now considering 65/349 (removed 284) transitions.
[2025-05-30 12:16:01] [INFO ] Flow matrix only has 52 transitions (discarded 13 similar events)
// Phase 1: matrix 52 rows 35 cols
[2025-05-30 12:16:01] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:01] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 12:16:01] [INFO ] Flow matrix only has 52 transitions (discarded 13 similar events)
[2025-05-30 12:16:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:16:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:16:01] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2025-05-30 12:16:01] [INFO ] Flow matrix only has 52 transitions (discarded 13 similar events)
[2025-05-30 12:16:01] [INFO ] Invariant cache hit.
[2025-05-30 12:16:01] [INFO ] State equation strengthened by 1 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, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 51/86 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/87 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 40 constraints, problems are : Problem set: 0 solved, 50 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 51/86 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 50/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 90 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2005ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2005ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/255 places, 65/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2122 ms. Remains : 35/255 places, 65/349 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-07
Product exploration explored 100000 steps with 92 reset in 42 ms.
Product exploration explored 100000 steps with 18 reset in 41 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 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 36 ms :[(NOT p0)]
RANDOM walk for 8979 steps (1076 resets) in 28 ms. (309 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 104 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 44 ms :[(NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2025-05-30 12:16:04] [INFO ] Flow matrix only has 52 transitions (discarded 13 similar events)
[2025-05-30 12:16:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-30 12:16:04] [INFO ] Flow matrix only has 52 transitions (discarded 13 similar events)
[2025-05-30 12:16:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:16:04] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:16:04] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2025-05-30 12:16:04] [INFO ] Flow matrix only has 52 transitions (discarded 13 similar events)
[2025-05-30 12:16:04] [INFO ] Invariant cache hit.
[2025-05-30 12:16:04] [INFO ] State equation strengthened by 1 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, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 51/86 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/87 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 40 constraints, problems are : Problem set: 0 solved, 50 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 51/86 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 50/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 90 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1988ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1989ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2086 ms. Remains : 35/35 places, 65/65 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 19966 steps (2412 resets) in 58 ms. (338 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 99 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 86 reset in 45 ms.
Product exploration explored 100000 steps with 30 reset in 73 ms.
Built C files in :
/tmp/ltsmin7685791112380808167
[2025-05-30 12:16:06] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2025-05-30 12:16:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:16:06] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2025-05-30 12:16:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:16:06] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2025-05-30 12:16:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:16:06] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7685791112380808167
Running compilation step : cd /tmp/ltsmin7685791112380808167;'/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 153 ms.
Running link step : cd /tmp/ltsmin7685791112380808167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7685791112380808167;'/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/stateBased9688254450410472040.hoa' '--buchi-type=spotba'
LTSmin run took 79 ms.
FORMULA CO4-PT-13-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLFireability-07 finished in 5493 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||X(X(p1))))))'
Support contains 2 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 247 transition count 340
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 247 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 247 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 242 transition count 331
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 242 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 242 transition count 330
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 240 transition count 328
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 240 transition count 328
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 238 transition count 326
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 238 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 238 transition count 325
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 237 transition count 324
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 237 transition count 324
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 236 transition count 323
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 236 transition count 323
Applied a total of 42 rules in 17 ms. Remains 236 /255 variables (removed 19) and now considering 323/349 (removed 26) transitions.
// Phase 1: matrix 323 rows 236 cols
[2025-05-30 12:16:07] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-30 12:16:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:07] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2025-05-30 12:16:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:16:11] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:16:11] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:16:11] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:16:11] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/244 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 244 constraints, problems are : Problem set: 0 solved, 322 unsolved in 21380 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/244 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 322/566 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:16:38] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 567 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51459ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 51460ms
Starting structural reductions in LTL mode, iteration 1 : 236/255 places, 323/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51666 ms. Remains : 236/255 places, 323/349 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : CO4-PT-13-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-09 finished in 51859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Graph (trivial) has 266 edges and 255 vertex of which 3 / 255 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 526 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 246 transition count 241
Reduce places removed 98 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 99 rules applied. Total rules applied 199 place count 148 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 147 transition count 240
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 200 place count 147 transition count 219
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 242 place count 126 transition count 219
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 123 transition count 215
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 123 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 250 place count 123 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 250 place count 123 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 122 transition count 212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 254 place count 120 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 120 transition count 208
Performed 45 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 346 place count 75 transition count 148
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 351 place count 75 transition count 143
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 355 place count 71 transition count 137
Iterating global reduction 5 with 4 rules applied. Total rules applied 359 place count 71 transition count 137
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 395 place count 53 transition count 157
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 403 place count 53 transition count 149
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 414 place count 42 transition count 105
Iterating global reduction 6 with 11 rules applied. Total rules applied 425 place count 42 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 431 place count 42 transition count 99
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 434 place count 39 transition count 81
Iterating global reduction 7 with 3 rules applied. Total rules applied 437 place count 39 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 439 place count 39 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 443 place count 37 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 8 with 27 rules applied. Total rules applied 470 place count 37 transition count 68
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 471 place count 37 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 473 place count 35 transition count 66
Applied a total of 473 rules in 21 ms. Remains 35 /255 variables (removed 220) and now considering 66/349 (removed 283) transitions.
[2025-05-30 12:16:59] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
// Phase 1: matrix 54 rows 35 cols
[2025-05-30 12:16:59] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-30 12:16:59] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
[2025-05-30 12:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:16:59] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:16:59] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-05-30 12:16:59] [INFO ] Flow matrix only has 54 transitions (discarded 12 similar events)
[2025-05-30 12:16:59] [INFO ] Invariant cache hit.
[2025-05-30 12:16:59] [INFO ] State equation strengthened by 1 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, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 53/88 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/89 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 40 constraints, problems are : Problem set: 0 solved, 51 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 53/88 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 51/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/89 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 91 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2059ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2059ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/255 places, 66/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2397 ms. Remains : 35/255 places, 66/349 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-10
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-13-LTLFireability-10 finished in 2468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 349/349 transitions.
Graph (trivial) has 267 edges and 255 vertex of which 3 / 255 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 526 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 246 transition count 242
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 196 place count 149 transition count 242
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 196 place count 149 transition count 221
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 238 place count 128 transition count 221
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 241 place count 125 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 125 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 246 place count 125 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 246 place count 125 transition count 214
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 124 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 250 place count 122 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 122 transition count 210
Performed 47 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 346 place count 75 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 351 place count 75 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 355 place count 71 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 359 place count 71 transition count 136
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
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 395 place count 53 transition count 156
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 403 place count 53 transition count 148
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 414 place count 42 transition count 104
Iterating global reduction 5 with 11 rules applied. Total rules applied 425 place count 42 transition count 104
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 432 place count 42 transition count 97
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 435 place count 39 transition count 79
Iterating global reduction 6 with 3 rules applied. Total rules applied 438 place count 39 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 440 place count 39 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 444 place count 37 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 470 place count 37 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 472 place count 35 transition count 65
Applied a total of 472 rules in 21 ms. Remains 35 /255 variables (removed 220) and now considering 65/349 (removed 284) transitions.
[2025-05-30 12:17:01] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
// Phase 1: matrix 53 rows 35 cols
[2025-05-30 12:17:01] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:17:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-30 12:17:01] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2025-05-30 12:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:17:01] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:17:01] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2025-05-30 12:17:01] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2025-05-30 12:17:01] [INFO ] Invariant cache hit.
[2025-05-30 12:17:01] [INFO ] State equation strengthened by 1 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, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 52/87 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 40 constraints, problems are : Problem set: 0 solved, 50 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 52/87 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 50/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 90 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2172ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/255 places, 65/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2368 ms. Remains : 35/255 places, 65/349 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-13-LTLFireability-12
Product exploration explored 100000 steps with 36 reset in 61 ms.
Product exploration explored 100000 steps with 17 reset in 36 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 310 steps (33 resets) in 4 ms. (62 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 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2025-05-30 12:17:04] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2025-05-30 12:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:17:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-30 12:17:04] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2025-05-30 12:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:17:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:17:04] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:17:04] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2025-05-30 12:17:04] [INFO ] Flow matrix only has 53 transitions (discarded 12 similar events)
[2025-05-30 12:17:04] [INFO ] Invariant cache hit.
[2025-05-30 12:17:04] [INFO ] State equation strengthened by 1 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, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 52/87 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 40 constraints, problems are : Problem set: 0 solved, 50 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 52/87 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 50/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 90 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2090ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2201 ms. Remains : 35/35 places, 65/65 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 795 steps (93 resets) in 6 ms. (113 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 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 32 ms.
Product exploration explored 100000 steps with 34 reset in 36 ms.
Built C files in :
/tmp/ltsmin7406349126955221304
[2025-05-30 12:17:07] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2025-05-30 12:17:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:17:07] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2025-05-30 12:17:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:17:07] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2025-05-30 12:17:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:17:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7406349126955221304
Running compilation step : cd /tmp/ltsmin7406349126955221304;'/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 143 ms.
Running link step : cd /tmp/ltsmin7406349126955221304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7406349126955221304;'/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/stateBased9502243622506757754.hoa' '--buchi-type=spotba'
LTSmin run took 246 ms.
FORMULA CO4-PT-13-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-13-LTLFireability-12 finished in 6141 ms.
All properties solved by simple procedures.
Total runtime 248316 ms.

BK_STOP 1748607427716

--------------------
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="CO4-PT-13"
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 CO4-PT-13, 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 r044-tall-174854028500476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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