Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 141K 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 FlexibleBarrier-PT-06b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748922627180

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 03:50:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 03:50:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 03:50:30] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2025-06-03 03:50:30] [INFO ] Transformed 542 places.
[2025-06-03 03:50:30] [INFO ] Transformed 621 transitions.
[2025-06-03 03:50:30] [INFO ] Found NUPN structural information;
[2025-06-03 03:50:30] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 469 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 173 places :
Symmetric choice reduction at 0 with 173 rule applications. Total rules 173 place count 369 transition count 448
Iterating global reduction 0 with 173 rules applied. Total rules applied 346 place count 369 transition count 448
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 411 place count 304 transition count 383
Iterating global reduction 0 with 65 rules applied. Total rules applied 476 place count 304 transition count 383
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 510 place count 270 transition count 349
Iterating global reduction 0 with 34 rules applied. Total rules applied 544 place count 270 transition count 349
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 557 place count 270 transition count 336
Applied a total of 557 rules in 234 ms. Remains 270 /542 variables (removed 272) and now considering 336/621 (removed 285) transitions.
// Phase 1: matrix 336 rows 270 cols
[2025-06-03 03:50:31] [INFO ] Computed 8 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:31] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-03 03:50:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:32] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2025-06-03 03:50:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:43] [INFO ] Deduced a trap composed of 151 places in 329 ms of which 64 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/606 variables, 270/279 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:59] [INFO ] Deduced a trap composed of 172 places in 263 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:59] [INFO ] Deduced a trap composed of 173 places in 260 ms of which 40 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/606 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/606 variables, and 281 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:07] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:09] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:09] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:10] [INFO ] Deduced a trap composed of 151 places in 224 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:10] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:10] [INFO ] Deduced a trap composed of 70 places in 251 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 336/606 variables, 270/287 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/606 variables, 335/622 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:19] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:19] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:20] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:20] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:20] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:20] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:21] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:21] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:21] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:22] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:22] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:22] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:22] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:24] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:25] [INFO ] Deduced a trap composed of 154 places in 238 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:25] [INFO ] Deduced a trap composed of 69 places in 231 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:26] [INFO ] Deduced a trap composed of 88 places in 251 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 17/639 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 639 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Starting structural reductions in LTL mode, iteration 1 : 270/542 places, 336/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62229 ms. Remains : 270/542 places, 336/621 transitions.
Support contains 47 out of 270 places after structural reductions.
[2025-06-03 03:51:33] [INFO ] Flatten gal took : 82 ms
[2025-06-03 03:51:33] [INFO ] Flatten gal took : 39 ms
[2025-06-03 03:51:33] [INFO ] Input system was already deterministic with 336 transitions.
Support contains 44 out of 270 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (762 resets) in 2413 ms. (16 steps per ms) remains 10/39 properties
BEST_FIRST walk for 40004 steps (109 resets) in 213 ms. (186 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (114 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (112 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (113 resets) in 131 ms. (303 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (106 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (115 resets) in 96 ms. (412 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (114 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (33 resets) in 72 ms. (548 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (112 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
[2025-06-03 03:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 190/199 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:35] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:35] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:35] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:35] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:35] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:35] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 6/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 71/270 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 336/606 variables, 270/284 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/606 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 284 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 154/161 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 5/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 109/270 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 336/606 variables, 270/284 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 5/289 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/606 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 289 constraints, problems are : Problem set: 1 solved, 5 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2703ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 87 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=87 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 176 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 245 transition count 311
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 245 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 245 transition count 310
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 232 transition count 297
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 232 transition count 297
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 232 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 228 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 228 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 228 transition count 283
Applied a total of 95 rules in 51 ms. Remains 228 /270 variables (removed 42) and now considering 283/336 (removed 53) transitions.
// Phase 1: matrix 283 rows 228 cols
[2025-06-03 03:51:38] [INFO ] Computed 8 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:51:38] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-06-03 03:51:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:51:39] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2025-06-03 03:51:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 283/511 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 236 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 283/511 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 282/518 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:19] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:19] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:20] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:20] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:20] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:20] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:21] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:21] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:22] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:23] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:23] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:24] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 12/530 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:29] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:32] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:32] [INFO ] Deduced a trap composed of 159 places in 197 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:33] [INFO ] Deduced a trap composed of 159 places in 196 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:33] [INFO ] Deduced a trap composed of 159 places in 194 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:33] [INFO ] Deduced a trap composed of 159 places in 194 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:33] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 7/537 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:38] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 15 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 538 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 228/270 places, 283/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60851 ms. Remains : 228/270 places, 283/336 transitions.
Stuttering acceptance computed with spot in 411 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 405 ms.
Product exploration explored 100000 steps with 33333 reset in 246 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-00 finished in 62120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&X(p1)&&(p2||X(F((p2&&F(p3))))))))'
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 247 transition count 313
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 247 transition count 313
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 235 transition count 301
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 235 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 235 transition count 295
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 231 transition count 291
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 231 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 231 transition count 288
Applied a total of 87 rules in 54 ms. Remains 231 /270 variables (removed 39) and now considering 288/336 (removed 48) transitions.
// Phase 1: matrix 288 rows 231 cols
[2025-06-03 03:52:40] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:52:40] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-03 03:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:52:41] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-03 03:52:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 239 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 287/526 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:21] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:22] [INFO ] Deduced a trap composed of 61 places in 233 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:23] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:23] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:24] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:25] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:25] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 7/533 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:29] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:53:29] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 535 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 231/270 places, 288/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 231/270 places, 288/336 transitions.
Stuttering acceptance computed with spot in 562 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND p1 (NOT p0) p2 (NOT p3)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-01
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-01 finished in 61365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||X((G(F(p1))||G(p2)))) U p3))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 247 transition count 313
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 247 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 247 transition count 312
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 235 transition count 300
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 235 transition count 300
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 235 transition count 295
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 231 transition count 291
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 231 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 87 place count 231 transition count 288
Applied a total of 87 rules in 52 ms. Remains 231 /270 variables (removed 39) and now considering 288/336 (removed 48) transitions.
// Phase 1: matrix 288 rows 231 cols
[2025-06-03 03:53:41] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:53:42] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-03 03:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:53:42] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-03 03:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/519 variables, and 239 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/519 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 287/526 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:23] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:23] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:24] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:25] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:26] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:26] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 6/532 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:35] [INFO ] Deduced a trap composed of 161 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:36] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:42] [INFO ] Deduced a trap composed of 111 places in 218 ms of which 17 ms to minimize.
SMT process timed out in 60120ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 231/270 places, 288/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60807 ms. Remains : 231/270 places, 288/336 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p3), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-02
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-02 finished in 61106 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(G((X(p1)||p0))))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 246 transition count 312
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 246 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 246 transition count 311
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 232 transition count 297
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 232 transition count 297
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 232 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 227 transition count 285
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 227 transition count 285
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 227 transition count 281
Applied a total of 98 rules in 30 ms. Remains 227 /270 variables (removed 43) and now considering 281/336 (removed 55) transitions.
// Phase 1: matrix 281 rows 227 cols
[2025-06-03 03:54:42] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:54:43] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-03 03:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:54:43] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2025-06-03 03:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 281/508 variables, 227/235 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 235 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 281/508 variables, 227/235 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 280/515 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:23] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:23] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:24] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:24] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:25] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:26] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:26] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 7/522 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:29] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:29] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:29] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:34] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:34] [INFO ] Deduced a trap composed of 159 places in 198 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:41] [INFO ] Deduced a trap composed of 107 places in 217 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:42] [INFO ] Deduced a trap composed of 121 places in 205 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 529 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 227/270 places, 281/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60740 ms. Remains : 227/270 places, 281/336 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-03 finished in 60952 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((G(p1)||p0))))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Graph (trivial) has 238 edges and 270 vertex of which 32 / 270 are part of one of the 5 SCC in 6 ms
Free SCC test removed 27 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 242 transition count 273
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 208 transition count 273
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 69 place count 208 transition count 255
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 105 place count 190 transition count 255
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 134 place count 161 transition count 226
Iterating global reduction 2 with 29 rules applied. Total rules applied 163 place count 161 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 161 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 164 place count 161 transition count 224
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 160 transition count 224
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 172 place count 154 transition count 218
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 154 transition count 218
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 183 place count 154 transition count 213
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 263 place count 114 transition count 173
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 267 place count 110 transition count 169
Iterating global reduction 4 with 4 rules applied. Total rules applied 271 place count 110 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 275 place count 110 transition count 165
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 279 place count 108 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 287 place count 108 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 288 place count 107 transition count 164
Applied a total of 288 rules in 228 ms. Remains 107 /270 variables (removed 163) and now considering 164/336 (removed 172) transitions.
[2025-06-03 03:55:44] [INFO ] Flow matrix only has 154 transitions (discarded 10 similar events)
// Phase 1: matrix 154 rows 107 cols
[2025-06-03 03:55:44] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:55:44] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-03 03:55:44] [INFO ] Flow matrix only has 154 transitions (discarded 10 similar events)
[2025-06-03 03:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:55:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 03:55:44] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:55:44] [INFO ] Redundant transitions in 10 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-03 03:55:44] [INFO ] Flow matrix only has 154 transitions (discarded 10 similar events)
[2025-06-03 03:55:44] [INFO ] Invariant cache hit.
[2025-06-03 03:55:44] [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/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 153/260 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 1/261 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 116 constraints, problems are : Problem set: 0 solved, 136 unsolved in 10671 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 153/260 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 136/251 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 1/261 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/261 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 252 constraints, problems are : Problem set: 0 solved, 136 unsolved in 14065 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24805ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 24806ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/270 places, 164/336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25524 ms. Remains : 107/270 places, 164/336 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-04 finished in 25644 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((G(p0)||(p0&&F(p1)))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 245 transition count 311
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 245 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 245 transition count 310
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 231 transition count 296
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 231 transition count 296
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 231 transition count 289
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 227 transition count 285
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 227 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 97 place count 227 transition count 282
Applied a total of 97 rules in 23 ms. Remains 227 /270 variables (removed 43) and now considering 282/336 (removed 54) transitions.
// Phase 1: matrix 282 rows 227 cols
[2025-06-03 03:56:09] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:56:09] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-03 03:56:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:56:10] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-03 03:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 282/509 variables, 227/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 0/509 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 235 constraints, problems are : Problem set: 0 solved, 281 unsolved in 29077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 282/509 variables, 227/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 281/516 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:49] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:50] [INFO ] Deduced a trap composed of 61 places in 205 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:50] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:51] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:51] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:52] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:52] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:53] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 8/524 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:56:57] [INFO ] Deduced a trap composed of 63 places in 204 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:01] [INFO ] Deduced a trap composed of 159 places in 211 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:01] [INFO ] Deduced a trap composed of 159 places in 215 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/509 variables, and 527 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59179ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 59180ms
Starting structural reductions in LTL mode, iteration 1 : 227/270 places, 282/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59817 ms. Remains : 227/270 places, 282/336 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 26 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-05 finished in 60633 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((G(p0) U (p1||G((F(p2)&&F(G(p3))))))) U X(p4)))'
Support contains 7 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 246 transition count 312
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 246 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 246 transition count 311
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 233 transition count 298
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 233 transition count 298
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 233 transition count 291
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 228 transition count 286
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 228 transition count 286
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 228 transition count 282
Applied a total of 96 rules in 35 ms. Remains 228 /270 variables (removed 42) and now considering 282/336 (removed 54) transitions.
// Phase 1: matrix 282 rows 228 cols
[2025-06-03 03:57:10] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:57:10] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-03 03:57:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:57:10] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-03 03:57:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 282/510 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 236 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 282/510 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 281/517 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:48] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:48] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:48] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:48] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:49] [INFO ] Deduced a trap composed of 117 places in 243 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:49] [INFO ] Deduced a trap composed of 157 places in 204 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:49] [INFO ] Deduced a trap composed of 118 places in 213 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:49] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:49] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:50] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:50] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:51] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:51] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:52] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:52] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 15/532 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:59] [INFO ] Deduced a trap composed of 161 places in 119 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:07] [INFO ] Deduced a trap along path composed of 4 places in 55 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 534 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 228/270 places, 282/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60633 ms. Remains : 228/270 places, 282/336 transitions.
Stuttering acceptance computed with spot in 869 ms :[(NOT p4), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p4), (OR (AND (NOT p0) p1 (NOT p2) (NOT p4)) (AND (NOT p0) p1 (NOT p3) (NOT p4))), (NOT p2), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3)))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-06
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-06 finished in 61573 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(G((p0||G(p1)))))'
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 245 transition count 311
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 245 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 245 transition count 310
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 232 transition count 297
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 232 transition count 297
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 83 place count 232 transition count 291
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 88 place count 227 transition count 286
Iterating global reduction 2 with 5 rules applied. Total rules applied 93 place count 227 transition count 286
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 97 place count 227 transition count 282
Applied a total of 97 rules in 29 ms. Remains 227 /270 variables (removed 43) and now considering 282/336 (removed 54) transitions.
// Phase 1: matrix 282 rows 227 cols
[2025-06-03 03:58:11] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:58:11] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-03 03:58:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:58:12] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-03 03:58: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/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 282/509 variables, 227/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 0/509 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 235 constraints, problems are : Problem set: 0 solved, 281 unsolved in 24917 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 282/509 variables, 227/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 281/516 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:45] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:45] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:46] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:46] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:47] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:47] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:48] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 7/523 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:50] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:51] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:54] [INFO ] Deduced a trap composed of 160 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:54] [INFO ] Deduced a trap composed of 159 places in 113 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:00] [INFO ] Deduced a trap composed of 159 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:00] [INFO ] Deduced a trap composed of 159 places in 191 ms of which 32 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 509/509 variables, and 529 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54971ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 54972ms
Starting structural reductions in LTL mode, iteration 1 : 227/270 places, 282/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55555 ms. Remains : 227/270 places, 282/336 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 23916 steps with 442 reset in 50 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-07 finished in 55764 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 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Graph (trivial) has 248 edges and 270 vertex of which 38 / 270 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 237 transition count 268
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 203 transition count 268
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 69 place count 203 transition count 249
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 107 place count 184 transition count 249
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 140 place count 151 transition count 216
Iterating global reduction 2 with 33 rules applied. Total rules applied 173 place count 151 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 151 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 174 place count 151 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 176 place count 150 transition count 214
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 183 place count 143 transition count 207
Iterating global reduction 3 with 7 rules applied. Total rules applied 190 place count 143 transition count 207
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 197 place count 143 transition count 200
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 267 place count 108 transition count 165
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 271 place count 104 transition count 161
Iterating global reduction 4 with 4 rules applied. Total rules applied 275 place count 104 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 279 place count 104 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 285 place count 104 transition count 151
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 104 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 102 transition count 149
Applied a total of 288 rules in 116 ms. Remains 102 /270 variables (removed 168) and now considering 149/336 (removed 187) transitions.
[2025-06-03 03:59:07] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
// Phase 1: matrix 138 rows 102 cols
[2025-06-03 03:59:07] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:59:07] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-03 03:59:07] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 03:59:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:59:07] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:59:07] [INFO ] Redundant transitions in 8 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-03 03:59:07] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 03:59: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/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 137/239 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/240 variables, and 110 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4599 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 137/239 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 81/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/240 variables, and 191 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3211 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7824ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 7826ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/270 places, 149/336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8325 ms. Remains : 102/270 places, 149/336 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-08
Product exploration explored 100000 steps with 7642 reset in 254 ms.
Product exploration explored 100000 steps with 7755 reset in 543 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3284 resets) in 1032 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (160 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1860699 steps, run timeout after 3001 ms. (steps per millisecond=620 ) properties seen :0 out of 1
Probabilistic random walk after 1860699 steps, saw 393569 distinct states, run finished after 3013 ms. (steps per millisecond=617 ) properties seen :0
[2025-06-03 03:59:20] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 03:59:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/39 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/157 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/219 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/239 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/239 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/240 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/39 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/157 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/219 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/239 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/239 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/240 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 554 steps, including 42 resets, run visited all 1 properties in 3 ms. (steps per millisecond=184 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 149/149 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2025-06-03 03:59:20] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 03:59:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:59:20] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-03 03:59:20] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 03:59:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:59:21] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:59:21] [INFO ] Redundant transitions in 10 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-03 03:59:21] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 03:59:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 137/239 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/240 variables, and 110 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5154 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 137/239 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 81/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/240 variables, and 191 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5299 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10492ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 10493ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10956 ms. Remains : 102/102 places, 149/149 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
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 45 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3302 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (157 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1797965 steps, run timeout after 3001 ms. (steps per millisecond=599 ) properties seen :0 out of 1
Probabilistic random walk after 1797965 steps, saw 382641 distinct states, run finished after 3001 ms. (steps per millisecond=599 ) properties seen :0
[2025-06-03 03:59:34] [INFO ] Flow matrix only has 138 transitions (discarded 11 similar events)
[2025-06-03 03:59:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/39 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/157 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/219 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/239 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/239 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/240 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/39 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/157 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 62/219 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/239 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/239 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/240 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 280ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 149/149 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 102 transition count 137
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 18 place count 96 transition count 131
Iterating global reduction 1 with 6 rules applied. Total rules applied 24 place count 96 transition count 131
Free-agglomeration rule applied 62 times.
Iterating global reduction 1 with 62 rules applied. Total rules applied 86 place count 96 transition count 69
Discarding 25 places :
Also discarding 51 output transitions
Drop transitions (Output transitions of discarded places.) removed 51 transitions
Remove reverse transitions (loop back) rule discarded transition t43.t282.t192 and 25 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 97 place count 3 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 103 place count 3 transition count 2
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 105 place count 2 transition count 2
Applied a total of 105 rules in 15 ms. Remains 2 /102 variables (removed 100) and now considering 2/149 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 2/102 places, 2/149 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 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 114 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7688 reset in 395 ms.
Product exploration explored 100000 steps with 7743 reset in 407 ms.
Built C files in :
/tmp/ltsmin9556285311895799610
[2025-06-03 03:59:36] [INFO ] Computing symmetric may disable matrix : 149 transitions.
[2025-06-03 03:59:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:59:36] [INFO ] Computing symmetric may enable matrix : 149 transitions.
[2025-06-03 03:59:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:59:36] [INFO ] Computing Do-Not-Accords matrix : 149 transitions.
[2025-06-03 03:59:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 03:59:36] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9556285311895799610
Running compilation step : cd /tmp/ltsmin9556285311895799610;'/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 643 ms.
Running link step : cd /tmp/ltsmin9556285311895799610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin9556285311895799610;'/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/stateBased13296244591693606191.hoa' '--buchi-type=spotba'
LTSmin run took 362 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-08 finished in 30021 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(G(p0)) U (X(p1)&&F(p2))))))'
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 247 transition count 313
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 247 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 247 transition count 312
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 58 place count 236 transition count 301
Iterating global reduction 1 with 11 rules applied. Total rules applied 69 place count 236 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 236 transition count 295
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 233 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 233 transition count 292
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 233 transition count 289
Applied a total of 84 rules in 21 ms. Remains 233 /270 variables (removed 37) and now considering 289/336 (removed 47) transitions.
// Phase 1: matrix 289 rows 233 cols
[2025-06-03 03:59:37] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:59:37] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-03 03:59:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:59:38] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2025-06-03 03:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/522 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 0/522 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 241 constraints, problems are : Problem set: 0 solved, 288 unsolved in 28670 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/522 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 288/529 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:15] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:16] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:17] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:17] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:17] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:18] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 6/535 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:21] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:22] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:33] [INFO ] Deduced a trap along path composed of 4 places in 60 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 538 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58741ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 58743ms
Starting structural reductions in LTL mode, iteration 1 : 233/270 places, 289/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59274 ms. Remains : 233/270 places, 289/336 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
RANDOM walk for 40000 steps (737 resets) in 164 ms. (242 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (112 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
[2025-06-03 04:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/233 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 289/522 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/233 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 289/522 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/522 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 515ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 289/289 transitions.
Applied a total of 0 rules in 3 ms. Remains 233 /233 variables (removed 0) and now considering 289/289 (removed 0) transitions.
[2025-06-03 04:00:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:00:39] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-03 04:00:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:00:39] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2025-06-03 04:00:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/522 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 0/522 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 241 constraints, problems are : Problem set: 0 solved, 288 unsolved in 26648 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 289/522 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 288/529 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:14] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:14] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:15] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:15] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:16] [INFO ] Deduced a trap composed of 67 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:16] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 6/535 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:19] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:20] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:29] [INFO ] Deduced a trap along path composed of 4 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 538 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56714ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 56717ms
Finished structural reductions in LTL mode , in 1 iterations and 57307 ms. Remains : 233/233 places, 289/289 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
RANDOM walk for 40000 steps (735 resets) in 122 ms. (325 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (117 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2025-06-03 04:01:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/233 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 289/522 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/233 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 289/522 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/522 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (NOT p0)]
Support contains 3 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 289/289 transitions.
Graph (trivial) has 208 edges and 233 vertex of which 37 / 233 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 202 transition count 257
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 24 place count 202 transition count 257
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 40 place count 202 transition count 257
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 64 place count 178 transition count 233
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 88 place count 178 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 176 transition count 231
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 176 transition count 231
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 128 place count 176 transition count 243
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 145 place count 159 transition count 226
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 162 place count 159 transition count 226
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 168 place count 159 transition count 238
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 159 transition count 226
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 180 rules in 51 ms. Remains 159 /233 variables (removed 74) and now considering 226/289 (removed 63) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:01:39] [INFO ] Redundant transitions in 3 ms returned []
Running 225 sub problems to find dead transitions.
[2025-06-03 04:01:39] [INFO ] Flow matrix only has 215 transitions (discarded 11 similar events)
// Phase 1: matrix 215 rows 159 cols
[2025-06-03 04:01:39] [INFO ] Computed 8 invariants in 3 ms
[2025-06-03 04:01:39] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:42] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:43] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 4 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:44] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 9 ms to minimize.
Problem TDEAD187 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 8/16 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 214/373 variables, 159/175 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 48/223 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/223 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/374 variables, 1/224 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/224 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/224 constraints. Problems are: Problem set: 69 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 224 constraints, problems are : Problem set: 69 solved, 156 unsolved in 19212 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 69 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 52/159 variables, 8/8 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 8/16 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/16 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 214/373 variables, 159/175 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 48/223 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 156/379 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/379 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 1/374 variables, 1/380 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/380 constraints. Problems are: Problem set: 69 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/374 variables, 0/380 constraints. Problems are: Problem set: 69 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 380 constraints, problems are : Problem set: 69 solved, 156 unsolved in 25179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 156/225 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44444ms problems are : Problem set: 69 solved, 156 unsolved
Search for dead transitions found 69 dead transitions in 44446ms
Found 69 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 69 transitions
Dead transitions reduction (with SMT) removed 69 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 159/233 places, 157/289 transitions.
Graph (complete) has 420 edges and 159 vertex of which 108 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 108 /159 variables (removed 51) and now considering 157/157 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/233 places, 157/289 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44524 ms. Remains : 108/233 places, 157/289 transitions.
Built C files in :
/tmp/ltsmin14591319328541435409
[2025-06-03 04:02:24] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14591319328541435409
Running compilation step : cd /tmp/ltsmin14591319328541435409;'/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 649 ms.
Running link step : cd /tmp/ltsmin14591319328541435409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14591319328541435409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4715142921874108329.hoa' '--buchi-type=spotba'
LTSmin run took 83 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-09 finished in 167297 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' '!(((p0 U (F(p1)&&X(p2)))&&(X(p2)||G(p3))))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 246 transition count 312
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 246 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 246 transition count 311
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 233 transition count 298
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 233 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 233 transition count 292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 228 transition count 287
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 228 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 228 transition count 283
Applied a total of 95 rules in 26 ms. Remains 228 /270 variables (removed 42) and now considering 283/336 (removed 53) transitions.
// Phase 1: matrix 283 rows 228 cols
[2025-06-03 04:02:24] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:02:25] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-03 04:02:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:02:25] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2025-06-03 04:02:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 283/511 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 0/511 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 236 constraints, problems are : Problem set: 0 solved, 282 unsolved in 24690 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 283/511 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 282/518 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:58] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:58] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:59] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:59] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:00] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:00] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:01] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:01] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:02] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:02] [INFO ] Deduced a trap composed of 159 places in 110 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:03] [INFO ] Deduced a trap composed of 159 places in 112 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 11/529 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:08] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:09] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:09] [INFO ] Deduced a trap composed of 159 places in 206 ms of which 33 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:16] [INFO ] Deduced a trap along path composed of 4 places in 78 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 533 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54770ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 54771ms
Starting structural reductions in LTL mode, iteration 1 : 228/270 places, 283/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55290 ms. Remains : 228/270 places, 283/336 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2)), true, (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-11 finished in 55628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((F(p1) U p2))))))'
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 245 transition count 311
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 245 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 245 transition count 310
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 231 transition count 296
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 231 transition count 296
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 231 transition count 289
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 226 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 226 transition count 284
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 226 transition count 280
Applied a total of 100 rules in 12 ms. Remains 226 /270 variables (removed 44) and now considering 280/336 (removed 56) transitions.
// Phase 1: matrix 280 rows 226 cols
[2025-06-03 04:03:20] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:03:20] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-03 04:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:03:20] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2025-06-03 04:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 234 constraints, problems are : Problem set: 0 solved, 279 unsolved in 25399 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 279/513 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:54] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:54] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:55] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:56] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:56] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:56] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:57] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 7/520 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:00] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:03] [INFO ] Deduced a trap composed of 159 places in 160 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:03] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:03] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 4/524 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:11] [INFO ] Deduced a trap composed of 162 places in 109 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/506 variables, and 525 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55443ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 55444ms
Starting structural reductions in LTL mode, iteration 1 : 226/270 places, 280/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55932 ms. Remains : 226/270 places, 280/336 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-12
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-12 finished in 56286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((X(G(p1))&&((p3 U p4)||p2))))))'
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 336/336 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 247 transition count 313
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 247 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 247 transition count 312
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 234 transition count 299
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 234 transition count 299
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 234 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 230 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 230 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 230 transition count 285
Applied a total of 91 rules in 13 ms. Remains 230 /270 variables (removed 40) and now considering 285/336 (removed 51) transitions.
// Phase 1: matrix 285 rows 230 cols
[2025-06-03 04:04:16] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:04:16] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-03 04:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:04:17] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2025-06-03 04:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:23] [INFO ] Deduced a trap composed of 158 places in 242 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:23] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:25] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:25] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:25] [INFO ] Deduced a trap composed of 159 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:25] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:25] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:28] [INFO ] Deduced a trap composed of 159 places in 138 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 285/515 variables, 230/246 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:36] [INFO ] Deduced a trap composed of 159 places in 212 ms of which 41 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:41] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 32 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/515 variables, and 248 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/515 variables, 230/248 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 284/532 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:54] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:54] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:54] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:54] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:55] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:55] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:55] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:56] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:57] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:57] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:58] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 11/543 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:01] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:08] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/515 variables, and 545 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 230/270 places, 285/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60590 ms. Remains : 230/270 places, 285/336 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p4), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p1) p4) (AND (NOT p1) p2) (AND (NOT p1) p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-13 finished in 60982 ms.
All properties solved by simple procedures.
Total runtime 887736 ms.

BK_STOP 1748923517728

--------------------
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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r086-smll-174860102500428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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