Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.0K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 536K 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-12b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748944338029

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-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 09:52:20] [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 09:52:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:52:21] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2025-06-03 09:52:21] [INFO ] Transformed 1988 places.
[2025-06-03 09:52:21] [INFO ] Transformed 2289 transitions.
[2025-06-03 09:52:21] [INFO ] Found NUPN structural information;
[2025-06-03 09:52:21] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 546 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1988 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Discarding 775 places :
Symmetric choice reduction at 0 with 775 rule applications. Total rules 775 place count 1213 transition count 1514
Iterating global reduction 0 with 775 rules applied. Total rules applied 1550 place count 1213 transition count 1514
Discarding 358 places :
Symmetric choice reduction at 0 with 358 rule applications. Total rules 1908 place count 855 transition count 1156
Iterating global reduction 0 with 358 rules applied. Total rules applied 2266 place count 855 transition count 1156
Discarding 221 places :
Symmetric choice reduction at 0 with 221 rule applications. Total rules 2487 place count 634 transition count 935
Iterating global reduction 0 with 221 rules applied. Total rules applied 2708 place count 634 transition count 935
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 2811 place count 634 transition count 832
Applied a total of 2811 rules in 1086 ms. Remains 634 /1988 variables (removed 1354) and now considering 832/2289 (removed 1457) transitions.
// Phase 1: matrix 832 rows 634 cols
[2025-06-03 09:52:22] [INFO ] Computed 14 invariants in 62 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:52:24] [INFO ] Implicit Places using invariants in 1632 ms returned []
[2025-06-03 09:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:52:25] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 3290 ms to find 0 implicit places.
Running 831 sub problems to find dead transitions.
[2025-06-03 09:52:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/1466 variables, and 0 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 831 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 633/1466 variables, and 0 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/634 constraints, PredecessorRefiner: 0/831 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60931ms problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 60969ms
Starting structural reductions in LTL mode, iteration 1 : 634/1988 places, 832/2289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65404 ms. Remains : 634/1988 places, 832/2289 transitions.
Support contains 42 out of 634 places after structural reductions.
[2025-06-03 09:53:27] [INFO ] Flatten gal took : 193 ms
[2025-06-03 09:53:27] [INFO ] Flatten gal took : 101 ms
[2025-06-03 09:53:27] [INFO ] Input system was already deterministic with 832 transitions.
RANDOM walk for 40000 steps (455 resets) in 3108 ms. (12 steps per ms) remains 20/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
[2025-06-03 09:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 560/591 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 43/634 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 832/1466 variables, 634/648 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1466 variables, 0/648 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:32] [INFO ] Deduced a trap composed of 171 places in 614 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:33] [INFO ] Deduced a trap composed of 172 places in 603 ms of which 87 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/1466 variables, 2/650 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1466 variables, 0/650 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1466/1466 variables, and 650 constraints, problems are : Problem set: 1 solved, 19 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 561/591 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 2/14 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:35] [INFO ] Deduced a trap composed of 169 places in 533 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:36] [INFO ] Deduced a trap composed of 172 places in 513 ms of which 95 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/591 variables, 2/16 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/591 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 43/634 variables, 2/18 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:37] [INFO ] Deduced a trap composed of 41 places in 674 ms of which 77 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 832/1466 variables, 634/653 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1466 variables, 18/671 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1466/1466 variables, and 671 constraints, problems are : Problem set: 2 solved, 18 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 634/634 constraints, PredecessorRefiner: 18/20 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10047ms problems are : Problem set: 2 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 832/832 transitions.
Graph (trivial) has 564 edges and 634 vertex of which 73 / 634 are part of one of the 12 SCC in 10 ms
Free SCC test removed 61 places
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 573 transition count 699
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 514 transition count 699
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 119 place count 514 transition count 673
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 171 place count 488 transition count 673
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 200 place count 459 transition count 644
Iterating global reduction 2 with 29 rules applied. Total rules applied 229 place count 459 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 459 transition count 643
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 230 place count 459 transition count 641
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 234 place count 457 transition count 641
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 239 place count 452 transition count 636
Iterating global reduction 3 with 5 rules applied. Total rules applied 244 place count 452 transition count 636
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 246 place count 452 transition count 634
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 396 place count 377 transition count 559
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 420 place count 377 transition count 535
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 432 place count 365 transition count 523
Iterating global reduction 5 with 12 rules applied. Total rules applied 444 place count 365 transition count 523
Free-agglomeration rule applied 270 times.
Iterating global reduction 5 with 270 rules applied. Total rules applied 714 place count 365 transition count 253
Reduce places removed 270 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 5 with 355 rules applied. Total rules applied 1069 place count 95 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1071 place count 95 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1072 place count 94 transition count 165
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 93 vertex of which 24 / 93 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 1074 place count 81 transition count 165
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 1098 place count 81 transition count 141
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 1098 place count 81 transition count 129
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1122 place count 69 transition count 129
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1134 place count 69 transition count 117
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1158 place count 57 transition count 105
Free-agglomeration rule applied 12 times.
Iterating global reduction 9 with 12 rules applied. Total rules applied 1170 place count 57 transition count 93
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 1199 place count 43 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 1220 place count 43 transition count 57
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1221 place count 43 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1222 place count 42 transition count 56
Applied a total of 1222 rules in 901 ms. Remains 42 /634 variables (removed 592) and now considering 56/832 (removed 776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 902 ms. Remains : 42/634 places, 56/832 transitions.
RANDOM walk for 12986 steps (3 resets) in 128 ms. (100 steps per ms) remains 0/18 properties
FORMULA FlexibleBarrier-PT-12b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 15 stabilizing places and 15 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' '!(G(F(p0)))'
Support contains 1 out of 634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Graph (trivial) has 473 edges and 634 vertex of which 73 / 634 are part of one of the 12 SCC in 3 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 572 transition count 705
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 508 transition count 705
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 129 place count 508 transition count 674
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 191 place count 477 transition count 674
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 239 place count 429 transition count 626
Iterating global reduction 2 with 48 rules applied. Total rules applied 287 place count 429 transition count 626
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 292 place count 429 transition count 621
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 301 place count 420 transition count 612
Iterating global reduction 3 with 9 rules applied. Total rules applied 310 place count 420 transition count 612
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 319 place count 420 transition count 603
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 465 place count 347 transition count 530
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 469 place count 343 transition count 526
Iterating global reduction 4 with 4 rules applied. Total rules applied 473 place count 343 transition count 526
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 477 place count 343 transition count 522
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 479 place count 341 transition count 520
Applied a total of 479 rules in 445 ms. Remains 341 /634 variables (removed 293) and now considering 520/832 (removed 312) transitions.
[2025-06-03 09:53:41] [INFO ] Flow matrix only has 486 transitions (discarded 34 similar events)
// Phase 1: matrix 486 rows 341 cols
[2025-06-03 09:53:41] [INFO ] Computed 14 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:53:41] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-06-03 09:53:41] [INFO ] Flow matrix only has 486 transitions (discarded 34 similar events)
[2025-06-03 09:53:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:53:42] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:53:43] [INFO ] Redundant transitions in 57 ms returned []
Running 362 sub problems to find dead transitions.
[2025-06-03 09:53:43] [INFO ] Flow matrix only has 486 transitions (discarded 34 similar events)
[2025-06-03 09:53: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/340 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/341 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 485/826 variables, 341/355 constraints. Problems are: Problem set: 0 solved, 362 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 826/827 variables, and 355 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/341 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 485/826 variables, 341/355 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 362/717 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/827 variables, and 717 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60509ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60513ms
Starting structural reductions in SI_LTL mode, iteration 1 : 341/634 places, 520/832 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62720 ms. Remains : 341/634 places, 520/832 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-00 finished in 63118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 4 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 609 transition count 807
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 609 transition count 807
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 609 transition count 803
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 593 transition count 787
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 593 transition count 787
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 593 transition count 779
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 587 transition count 773
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 587 transition count 773
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 587 transition count 768
Applied a total of 111 rules in 72 ms. Remains 587 /634 variables (removed 47) and now considering 768/832 (removed 64) transitions.
// Phase 1: matrix 768 rows 587 cols
[2025-06-03 09:54:43] [INFO ] Computed 14 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:54:44] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-06-03 09:54:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:54:45] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2025-06-03 09:54:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/1355 variables, and 14 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/1355 variables, and 14 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/587 constraints, PredecessorRefiner: 0/767 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 587/634 places, 768/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61716 ms. Remains : 587/634 places, 768/832 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-02 finished in 61874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((((F(p0) U p1) U p2)&&F(G(p3)))))))'
Support contains 6 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 610 transition count 808
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 610 transition count 808
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 610 transition count 804
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 66 place count 596 transition count 790
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 596 transition count 790
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 87 place count 596 transition count 783
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 93 place count 590 transition count 777
Iterating global reduction 2 with 6 rules applied. Total rules applied 99 place count 590 transition count 777
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 104 place count 590 transition count 772
Applied a total of 104 rules in 75 ms. Remains 590 /634 variables (removed 44) and now considering 772/832 (removed 60) transitions.
// Phase 1: matrix 772 rows 590 cols
[2025-06-03 09:55:45] [INFO ] Computed 14 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:55:46] [INFO ] Implicit Places using invariants in 755 ms returned []
[2025-06-03 09:55:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:55:47] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Running 771 sub problems to find dead transitions.
[2025-06-03 09:55:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 771 unsolved
SMT process timed out in 30271ms, After SMT, problems are : Problem set: 0 solved, 771 unsolved
Search for dead transitions found 0 dead transitions in 30275ms
Starting structural reductions in LTL mode, iteration 1 : 590/634 places, 772/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32142 ms. Remains : 590/634 places, 772/832 transitions.
Stuttering acceptance computed with spot in 463 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-05
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-05 finished in 32669 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&&F(p1))||(p2&&X((p2 U X(X(p2)))))))))'
Support contains 5 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 610 transition count 808
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 610 transition count 808
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 610 transition count 804
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 66 place count 596 transition count 790
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 596 transition count 790
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 86 place count 596 transition count 784
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 590 transition count 778
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 590 transition count 778
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 103 place count 590 transition count 773
Applied a total of 103 rules in 129 ms. Remains 590 /634 variables (removed 44) and now considering 773/832 (removed 59) transitions.
// Phase 1: matrix 773 rows 590 cols
[2025-06-03 09:56:18] [INFO ] Computed 14 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:56:19] [INFO ] Implicit Places using invariants in 848 ms returned []
[2025-06-03 09:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:56:20] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
Running 772 sub problems to find dead transitions.
[2025-06-03 09:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 772 unsolved
SMT process timed out in 30240ms, After SMT, problems are : Problem set: 0 solved, 772 unsolved
Search for dead transitions found 0 dead transitions in 30245ms
Starting structural reductions in LTL mode, iteration 1 : 590/634 places, 773/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32449 ms. Remains : 590/634 places, 773/832 transitions.
Stuttering acceptance computed with spot in 563 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-06
Product exploration explored 100000 steps with 16669 reset in 502 ms.
Product exploration explored 100000 steps with 16715 reset in 317 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p2)), (X (OR p0 p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (OR p0 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 221 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (448 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (45 resets) in 208 ms. (191 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
[2025-06-03 09:56:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 243/248 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 342/590 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 773/1363 variables, 590/604 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1363 variables, 0/604 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1363 variables, 0/604 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1363/1363 variables, and 604 constraints, problems are : Problem set: 1 solved, 4 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 167/169 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 421/590 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:56:54] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:56:54] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:56:55] [INFO ] Deduced a trap composed of 152 places in 607 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:56:56] [INFO ] Deduced a trap composed of 157 places in 432 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:56:56] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 773/1363 variables, 590/609 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1363 variables, 4/613 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:56:56] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:56:57] [INFO ] Deduced a trap composed of 154 places in 415 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1363 variables, 2/615 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1363 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1363 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1363/1363 variables, and 615 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4083 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5009ms problems are : Problem set: 1 solved, 4 unsolved
Finished Parikh walk after 179 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 96 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p2)), (X (OR p0 p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (OR p0 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2)))
Knowledge based reduction with 16 factoid took 304 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-12b-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-06 finished in 40257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(X((X(p1) U ((p1&&X(p1))||X(G(p1))))))) U (!p1&&(p0||X(X((X(p1) U ((p1&&X(p1))||X(G(p1)))))))))))'
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 608 transition count 806
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 608 transition count 806
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 608 transition count 801
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 73 place count 592 transition count 785
Iterating global reduction 1 with 16 rules applied. Total rules applied 89 place count 592 transition count 785
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 97 place count 592 transition count 777
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 586 transition count 771
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 586 transition count 771
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 586 transition count 766
Applied a total of 114 rules in 105 ms. Remains 586 /634 variables (removed 48) and now considering 766/832 (removed 66) transitions.
// Phase 1: matrix 766 rows 586 cols
[2025-06-03 09:56:58] [INFO ] Computed 14 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:56:59] [INFO ] Implicit Places using invariants in 835 ms returned []
[2025-06-03 09:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:57:00] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
Running 765 sub problems to find dead transitions.
[2025-06-03 09:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 765 unsolved
SMT process timed out in 30195ms, After SMT, problems are : Problem set: 0 solved, 765 unsolved
Search for dead transitions found 0 dead transitions in 30198ms
Starting structural reductions in LTL mode, iteration 1 : 586/634 places, 766/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32177 ms. Remains : 586/634 places, 766/832 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 66805 steps with 11133 reset in 111 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-07 finished in 32582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1 U p2)))))'
Support contains 3 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 610 transition count 808
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 610 transition count 808
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 610 transition count 803
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 597 transition count 790
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 597 transition count 790
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 597 transition count 783
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 593 transition count 779
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 593 transition count 779
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 593 transition count 776
Applied a total of 97 rules in 68 ms. Remains 593 /634 variables (removed 41) and now considering 776/832 (removed 56) transitions.
// Phase 1: matrix 776 rows 593 cols
[2025-06-03 09:57:31] [INFO ] Computed 14 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:57:32] [INFO ] Implicit Places using invariants in 765 ms returned []
[2025-06-03 09:57:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:57:33] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
Running 775 sub problems to find dead transitions.
[2025-06-03 09:57:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 775 unsolved
SMT process timed out in 30320ms, After SMT, problems are : Problem set: 0 solved, 775 unsolved
Search for dead transitions found 0 dead transitions in 30324ms
Starting structural reductions in LTL mode, iteration 1 : 593/634 places, 776/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32191 ms. Remains : 593/634 places, 776/832 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-08
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-08 finished in 32427 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(p1)))))'
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Graph (trivial) has 579 edges and 634 vertex of which 66 / 634 are part of one of the 11 SCC in 2 ms
Free SCC test removed 55 places
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 578 transition count 711
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 513 transition count 709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 512 transition count 709
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 134 place count 512 transition count 679
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 194 place count 482 transition count 679
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 240 place count 436 transition count 633
Iterating global reduction 3 with 46 rules applied. Total rules applied 286 place count 436 transition count 633
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 291 place count 436 transition count 628
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 291 place count 436 transition count 627
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 293 place count 435 transition count 627
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 302 place count 426 transition count 618
Iterating global reduction 4 with 9 rules applied. Total rules applied 311 place count 426 transition count 618
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 319 place count 426 transition count 610
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 469 place count 351 transition count 535
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 473 place count 347 transition count 531
Iterating global reduction 5 with 4 rules applied. Total rules applied 477 place count 347 transition count 531
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 481 place count 347 transition count 527
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 483 place count 346 transition count 527
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 496 place count 346 transition count 514
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 498 place count 344 transition count 512
Applied a total of 498 rules in 364 ms. Remains 344 /634 variables (removed 290) and now considering 512/832 (removed 320) transitions.
[2025-06-03 09:58:04] [INFO ] Flow matrix only has 490 transitions (discarded 22 similar events)
// Phase 1: matrix 490 rows 344 cols
[2025-06-03 09:58:04] [INFO ] Computed 14 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:58:04] [INFO ] Implicit Places using invariants in 765 ms returned []
[2025-06-03 09:58:04] [INFO ] Flow matrix only has 490 transitions (discarded 22 similar events)
[2025-06-03 09:58:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:58:05] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1916 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:58:05] [INFO ] Redundant transitions in 18 ms returned []
Running 245 sub problems to find dead transitions.
[2025-06-03 09:58:06] [INFO ] Flow matrix only has 490 transitions (discarded 22 similar events)
[2025-06-03 09:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 12/344 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 489/833 variables, 344/358 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/834 variables, and 358 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 12/344 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 489/833 variables, 344/358 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 245/603 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/834 variables, and 603 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 344/634 places, 512/832 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62463 ms. Remains : 344/634 places, 512/832 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-09 finished in 62584 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(((p1 U p2)||X(G(p3))||p0)))'
Support contains 6 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 611 transition count 809
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 611 transition count 809
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 611 transition count 805
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 598 transition count 792
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 598 transition count 792
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 598 transition count 785
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 87 place count 594 transition count 781
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 594 transition count 781
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 594 transition count 778
Applied a total of 94 rules in 68 ms. Remains 594 /634 variables (removed 40) and now considering 778/832 (removed 54) transitions.
// Phase 1: matrix 778 rows 594 cols
[2025-06-03 09:59:06] [INFO ] Computed 14 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:59:07] [INFO ] Implicit Places using invariants in 765 ms returned []
[2025-06-03 09:59:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:59:08] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 2058 ms to find 0 implicit places.
Running 777 sub problems to find dead transitions.
[2025-06-03 09:59:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
SMT process timed out in 30365ms, After SMT, problems are : Problem set: 0 solved, 777 unsolved
Search for dead transitions found 0 dead transitions in 30369ms
Starting structural reductions in LTL mode, iteration 1 : 594/634 places, 778/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32498 ms. Remains : 594/634 places, 778/832 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-10 finished in 32852 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((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))))'
Support contains 3 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 609 transition count 807
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 609 transition count 807
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 609 transition count 802
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 70 place count 594 transition count 787
Iterating global reduction 1 with 15 rules applied. Total rules applied 85 place count 594 transition count 787
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 92 place count 594 transition count 780
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 589 transition count 775
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 589 transition count 775
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 106 place count 589 transition count 771
Applied a total of 106 rules in 103 ms. Remains 589 /634 variables (removed 45) and now considering 771/832 (removed 61) transitions.
// Phase 1: matrix 771 rows 589 cols
[2025-06-03 09:59:39] [INFO ] Computed 14 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:59:40] [INFO ] Implicit Places using invariants in 907 ms returned []
[2025-06-03 09:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:59:41] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
Running 770 sub problems to find dead transitions.
[2025-06-03 09:59: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/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 30282ms
Starting structural reductions in LTL mode, iteration 1 : 589/634 places, 771/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32681 ms. Remains : 589/634 places, 771/832 transitions.
Stuttering acceptance computed with spot in 203 ms :[p0, p0, p0, p0, p0, true]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-11
Product exploration explored 100000 steps with 16628 reset in 220 ms.
Product exploration explored 100000 steps with 16678 reset in 267 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[p0, p0, p0, p0, p0, true]
RANDOM walk for 40000 steps (452 resets) in 445 ms. (89 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (47 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
[2025-06-03 10:00:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 374/589 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:00:13] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:00:13] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 771/1360 variables, 589/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 374/589 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 771/1360 variables, 589/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1360 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1360 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 607 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2381ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 180 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=60 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 278 ms :[p0, p0, p0, p0, p0, true]
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 771/771 transitions.
Applied a total of 0 rules in 20 ms. Remains 589 /589 variables (removed 0) and now considering 771/771 (removed 0) transitions.
[2025-06-03 10:00:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:00:17] [INFO ] Implicit Places using invariants in 787 ms returned []
[2025-06-03 10:00:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:00:18] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Running 770 sub problems to find dead transitions.
[2025-06-03 10:00:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/1360 variables, and 14 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/589 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 770 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 770 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 589/1360 variables, and 14 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/589 constraints, PredecessorRefiner: 0/770 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Finished structural reductions in LTL mode , in 1 iterations and 62227 ms. Remains : 589/589 places, 771/771 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, p0, p0, true]
RANDOM walk for 40000 steps (447 resets) in 152 ms. (261 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (46 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2025-06-03 10:01:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 374/589 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:19] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:19] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 771/1360 variables, 589/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 374/589 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 771/1360 variables, 589/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1360 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1360 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 607 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2398ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 60 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=60 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 221 ms :[p0, p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 237 ms :[p0, p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 16643 reset in 152 ms.
Product exploration explored 100000 steps with 16605 reset in 183 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 234 ms :[p0, p0, p0, p0, p0, true]
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 589/589 places, 771/771 transitions.
Graph (trivial) has 545 edges and 589 vertex of which 67 / 589 are part of one of the 11 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 533 transition count 714
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 47 place count 533 transition count 715
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 84 place count 533 transition count 715
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 138 place count 479 transition count 661
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 192 place count 479 transition count 661
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 261 place count 479 transition count 685
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 291 place count 449 transition count 655
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 321 place count 449 transition count 655
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 333 place count 449 transition count 679
Deduced a syphon composed of 101 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 1 with 23 rules applied. Total rules applied 356 place count 449 transition count 656
Deduced a syphon composed of 101 places in 0 ms
Applied a total of 356 rules in 272 ms. Remains 449 /589 variables (removed 140) and now considering 656/771 (removed 115) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:01:23] [INFO ] Redundant transitions in 15 ms returned []
Running 655 sub problems to find dead transitions.
[2025-06-03 10:01:23] [INFO ] Flow matrix only has 634 transitions (discarded 22 similar events)
// Phase 1: matrix 634 rows 449 cols
[2025-06-03 10:01:23] [INFO ] Computed 14 invariants in 7 ms
[2025-06-03 10:01:23] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:44] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:45] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:45] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:45] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:46] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 3 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD237 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:46] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 3 ms to minimize.
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:46] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:46] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 4 ms to minimize.
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:47] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 3 ms to minimize.
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:47] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 3 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:47] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:48] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 5 ms to minimize.
Problem TDEAD420 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:01:50] [INFO ] Deduced a trap composed of 3 places in 410 ms of which 21 ms to minimize.
Problem TDEAD581 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 14/28 constraints. Problems are: Problem set: 138 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/1083 variables, and 28 constraints, problems are : Problem set: 138 solved, 517 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/449 constraints, ReadFeed: 0/98 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 138 solved, 517 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 138 solved, 517 unsolved
At refinement iteration 1 (OVERLAPS) 102/449 variables, 14/14 constraints. Problems are: Problem set: 138 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 14/28 constraints. Problems are: Problem set: 138 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/28 constraints. Problems are: Problem set: 138 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 633/1082 variables, 449/477 constraints. Problems are: Problem set: 138 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1082 variables, 97/574 constraints. Problems are: Problem set: 138 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1082 variables, 517/1091 constraints. Problems are: Problem set: 138 solved, 517 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1082/1083 variables, and 1091 constraints, problems are : Problem set: 138 solved, 517 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 449/449 constraints, ReadFeed: 97/98 constraints, PredecessorRefiner: 517/655 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60500ms problems are : Problem set: 138 solved, 517 unsolved
Search for dead transitions found 138 dead transitions in 60502ms
Found 138 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 138 transitions
Dead transitions reduction (with SMT) removed 138 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 449/589 places, 518/771 transitions.
Graph (complete) has 1460 edges and 449 vertex of which 348 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.3 ms
Discarding 101 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 532
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 45 ms. Remains 348 /449 variables (removed 101) and now considering 532/518 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 348/589 places, 532/771 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60856 ms. Remains : 348/589 places, 532/771 transitions.
Built C files in :
/tmp/ltsmin4429835099608348462
[2025-06-03 10:02:24] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4429835099608348462
Running compilation step : cd /tmp/ltsmin4429835099608348462;'/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 2400 ms.
Running link step : cd /tmp/ltsmin4429835099608348462;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin4429835099608348462;'/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/stateBased13422980455279819978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 589 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 589/589 places, 771/771 transitions.
Applied a total of 0 rules in 10 ms. Remains 589 /589 variables (removed 0) and now considering 771/771 (removed 0) transitions.
// Phase 1: matrix 771 rows 589 cols
[2025-06-03 10:02:39] [INFO ] Computed 14 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:02:40] [INFO ] Implicit Places using invariants in 610 ms returned []
[2025-06-03 10:02:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:02:41] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
Running 770 sub problems to find dead transitions.
[2025-06-03 10:02: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/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
SMT process timed out in 30209ms, After SMT, problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 30211ms
Finished structural reductions in LTL mode , in 1 iterations and 31818 ms. Remains : 589/589 places, 771/771 transitions.
Built C files in :
/tmp/ltsmin7350951226660782374
[2025-06-03 10:03:11] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7350951226660782374
Running compilation step : cd /tmp/ltsmin7350951226660782374;'/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 1965 ms.
Running link step : cd /tmp/ltsmin7350951226660782374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7350951226660782374;'/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/stateBased16986648491939187531.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 10:03:26] [INFO ] Flatten gal took : 54 ms
[2025-06-03 10:03:26] [INFO ] Flatten gal took : 55 ms
[2025-06-03 10:03:26] [INFO ] Time to serialize gal into /tmp/LTL4374079881043911931.gal : 14 ms
[2025-06-03 10:03:26] [INFO ] Time to serialize properties into /tmp/LTL7447986194878117098.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4374079881043911931.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7307326686499440979.hoa' '-atoms' '/tmp/LTL7447986194878117098.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7447986194878117098.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7307326686499440979.hoa
Detected timeout of ITS tools.
[2025-06-03 10:03:41] [INFO ] Flatten gal took : 38 ms
[2025-06-03 10:03:41] [INFO ] Flatten gal took : 36 ms
[2025-06-03 10:03:41] [INFO ] Time to serialize gal into /tmp/LTL18230544611703628963.gal : 10 ms
[2025-06-03 10:03:41] [INFO ] Time to serialize properties into /tmp/LTL16997070295111301854.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18230544611703628963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16997070295111301854.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(!("((p60==1)||(p1788==1))"))))U((X(X(G(!("((p60==1)||(p1788==1))")))))||(("(p812==1)")&&(X(X(!("((p60==1)||(p1788==1))")))...162
Formula 0 simplified : XX(XX"((p60==1)||(p1788==1))" R (XXF"((p60==1)||(p1788==1))" & (!"(p812==1)" | XX"((p60==1)||(p1788==1))")))
Detected timeout of ITS tools.
[2025-06-03 10:03:57] [INFO ] Flatten gal took : 31 ms
[2025-06-03 10:03:57] [INFO ] Applying decomposition
[2025-06-03 10:03:57] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11982274733468093760.txt' '-o' '/tmp/graph11982274733468093760.bin' '-w' '/tmp/graph11982274733468093760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11982274733468093760.bin' '-l' '-1' '-v' '-w' '/tmp/graph11982274733468093760.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:03:57] [INFO ] Decomposing Gal with order
[2025-06-03 10:03:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:03:57] [INFO ] Removed a total of 217 redundant transitions.
[2025-06-03 10:03:57] [INFO ] Flatten gal took : 192 ms
[2025-06-03 10:03:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 16 ms.
[2025-06-03 10:03:57] [INFO ] Time to serialize gal into /tmp/LTL1903860453622685717.gal : 16 ms
[2025-06-03 10:03:57] [INFO ] Time to serialize properties into /tmp/LTL15084950460340334525.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1903860453622685717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15084950460340334525.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(!("((i1.u14.p60==1)||(u126.p1788==1))"))))U((X(X(G(!("((i1.u14.p60==1)||(u126.p1788==1))")))))||(("(i9.u72.p812==1)")&&(X(...205
Formula 0 simplified : XX(XX"((i1.u14.p60==1)||(u126.p1788==1))" R (XXF"((i1.u14.p60==1)||(u126.p1788==1))" & (!"(i9.u72.p812==1)" | XX"((i1.u14.p60==1)||(...174
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-11 finished in 273555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Graph (trivial) has 582 edges and 634 vertex of which 67 / 634 are part of one of the 11 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 577 transition count 709
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 512 transition count 709
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 131 place count 512 transition count 678
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 193 place count 481 transition count 678
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 238 place count 436 transition count 633
Iterating global reduction 2 with 45 rules applied. Total rules applied 283 place count 436 transition count 633
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 288 place count 436 transition count 628
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 288 place count 436 transition count 627
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 290 place count 435 transition count 627
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 299 place count 426 transition count 618
Iterating global reduction 3 with 9 rules applied. Total rules applied 308 place count 426 transition count 618
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 317 place count 426 transition count 609
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 467 place count 351 transition count 534
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 471 place count 347 transition count 530
Iterating global reduction 4 with 4 rules applied. Total rules applied 475 place count 347 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 479 place count 347 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
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 483 place count 345 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 497 place count 345 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 499 place count 343 transition count 523
Applied a total of 499 rules in 126 ms. Remains 343 /634 variables (removed 291) and now considering 523/832 (removed 309) transitions.
[2025-06-03 10:04:12] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
// Phase 1: matrix 501 rows 343 cols
[2025-06-03 10:04:12] [INFO ] Computed 14 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:04:13] [INFO ] Implicit Places using invariants in 552 ms returned []
[2025-06-03 10:04:13] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
[2025-06-03 10:04:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:04:14] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:04:14] [INFO ] Redundant transitions in 6 ms returned []
Running 360 sub problems to find dead transitions.
[2025-06-03 10:04:14] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
[2025-06-03 10:04:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 4/343 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 500/843 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 360 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 843/844 variables, and 357 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 4/343 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 500/843 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 360/717 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/844 variables, and 717 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 343/634 places, 523/832 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61734 ms. Remains : 343/634 places, 523/832 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-12 finished in 61845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G(F(p1))||G(p2)))))'
Support contains 3 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 609 transition count 807
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 609 transition count 807
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 609 transition count 802
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 70 place count 594 transition count 787
Iterating global reduction 1 with 15 rules applied. Total rules applied 85 place count 594 transition count 787
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 93 place count 594 transition count 779
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 588 transition count 773
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 588 transition count 773
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 588 transition count 768
Applied a total of 110 rules in 106 ms. Remains 588 /634 variables (removed 46) and now considering 768/832 (removed 64) transitions.
// Phase 1: matrix 768 rows 588 cols
[2025-06-03 10:05:14] [INFO ] Computed 14 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:05:15] [INFO ] Implicit Places using invariants in 845 ms returned []
[2025-06-03 10:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:05:16] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2025-06-03 10:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)timeout

(s422 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 30200ms
Starting structural reductions in LTL mode, iteration 1 : 588/634 places, 768/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32255 ms. Remains : 588/634 places, 768/832 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-14
Stuttering criterion allowed to conclude after 215 steps with 3 reset in 3 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-14 finished in 32574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 634/634 places, 832/832 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 608 transition count 806
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 608 transition count 806
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 608 transition count 801
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 72 place count 593 transition count 786
Iterating global reduction 1 with 15 rules applied. Total rules applied 87 place count 593 transition count 786
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 593 transition count 779
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 587 transition count 773
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 587 transition count 773
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 587 transition count 768
Applied a total of 111 rules in 66 ms. Remains 587 /634 variables (removed 47) and now considering 768/832 (removed 64) transitions.
// Phase 1: matrix 768 rows 587 cols
[2025-06-03 10:05:47] [INFO ] Computed 14 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:05:47] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-06-03 10:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:05:48] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2025-06-03 10:05:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
SMT process timed out in 30210ms, After SMT, problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 30213ms
Starting structural reductions in LTL mode, iteration 1 : 587/634 places, 768/832 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31826 ms. Remains : 587/634 places, 768/832 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-15
Product exploration explored 100000 steps with 1123 reset in 464 ms.
Product exploration explored 100000 steps with 1120 reset in 367 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (450 resets) in 194 ms. (205 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (49 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
[2025-06-03 10:06: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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/587 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:21] [INFO ] Deduced a trap composed of 82 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:21] [INFO ] Deduced a trap composed of 134 places in 288 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1355 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1355 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1355 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 603 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1481 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/587 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 768/1355 variables, 587/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1355 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1355 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1355 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 606 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3054ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 96 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 363 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Graph (trivial) has 426 edges and 587 vertex of which 73 / 587 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 525 transition count 647
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 467 transition count 647
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 117 place count 467 transition count 622
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 167 place count 442 transition count 622
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 190 place count 419 transition count 599
Iterating global reduction 2 with 23 rules applied. Total rules applied 213 place count 419 transition count 599
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 361 place count 345 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 363 place count 343 transition count 523
Applied a total of 363 rules in 58 ms. Remains 343 /587 variables (removed 244) and now considering 523/768 (removed 245) transitions.
[2025-06-03 10:06:24] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
// Phase 1: matrix 489 rows 343 cols
[2025-06-03 10:06:24] [INFO ] Computed 14 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:24] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-06-03 10:06:24] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2025-06-03 10:06:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:25] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:06:25] [INFO ] Redundant transitions in 5 ms returned []
Running 364 sub problems to find dead transitions.
[2025-06-03 10:06:25] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2025-06-03 10:06: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/342 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 488/831 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 831/832 variables, and 357 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 488/831 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 364/721 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/832 variables, and 721 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 343/587 places, 523/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61476 ms. Remains : 343/587 places, 523/768 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 : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 573 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (2112 resets) in 1859 ms. (21 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 26 ms. (1481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 26 ms. (1481 steps per ms) remains 3/3 properties
[2025-06-03 10:07:26] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2025-06-03 10:07:26] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 289/432 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 366/798 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 33/831 variables, 11/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/831 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/831 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 831/832 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 289/432 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 366/798 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 33/831 variables, 11/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 33/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/831 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/831 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 831/832 variables, and 360 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2056ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 705 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering criterion allowed to conclude after 47 steps with 2 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-15 finished in 103045 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((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))))'
[2025-06-03 10:07:30] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18153286628862455151
[2025-06-03 10:07:30] [INFO ] Computing symmetric may disable matrix : 832 transitions.
[2025-06-03 10:07:30] [INFO ] Applying decomposition
[2025-06-03 10:07:30] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:07:30] [INFO ] Flatten gal took : 51 ms
[2025-06-03 10:07:30] [INFO ] Computing symmetric may enable matrix : 832 transitions.
[2025-06-03 10:07:30] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11636394295491415320.txt' '-o' '/tmp/graph11636394295491415320.bin' '-w' '/tmp/graph11636394295491415320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11636394295491415320.bin' '-l' '-1' '-v' '-w' '/tmp/graph11636394295491415320.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:07:30] [INFO ] Decomposing Gal with order
[2025-06-03 10:07:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:07:30] [INFO ] Computing Do-Not-Accords matrix : 832 transitions.
[2025-06-03 10:07:30] [INFO ] Computation of Completed DNA matrix. took 132 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 10:07:30] [INFO ] Removed a total of 249 redundant transitions.
[2025-06-03 10:07:30] [INFO ] Built C files in 496ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18153286628862455151
Running compilation step : cd /tmp/ltsmin18153286628862455151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-06-03 10:07:30] [INFO ] Flatten gal took : 151 ms
[2025-06-03 10:07:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 91 ms.
[2025-06-03 10:07:31] [INFO ] Time to serialize gal into /tmp/LTLFireability11642837077087506500.gal : 27 ms
[2025-06-03 10:07:31] [INFO ] Time to serialize properties into /tmp/LTLFireability14912463493519054677.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11642837077087506500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14912463493519054677.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(!("((i2.u16.p60==1)||(i14.u136.p1788==1))"))))U((("(i8.u78.p812==1)")&&(X(X(!("((i2.u16.p60==1)||(i14.u136.p1788==1))"))))...217
Formula 0 simplified : XX(XX"((i2.u16.p60==1)||(i14.u136.p1788==1))" R (XXF"((i2.u16.p60==1)||(i14.u136.p1788==1))" & (!"(i8.u78.p812==1)" | XX"((i2.u16.p6...186
Compilation finished in 4158 ms.
Running link step : cd /tmp/ltsmin18153286628862455151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin18153286628862455151;'/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' '--ltl' 'X(X((X(X(!(LTLAPp0==true))) U (((LTLAPp1==true)&&X(X(!(LTLAPp0==true))))||X(X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 10:32:34] [INFO ] Applying decomposition
[2025-06-03 10:32:35] [INFO ] Flatten gal took : 45 ms
[2025-06-03 10:32:35] [INFO ] Decomposing Gal with order
[2025-06-03 10:32:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:32:35] [INFO ] Removed a total of 214 redundant transitions.
[2025-06-03 10:32:35] [INFO ] Flatten gal took : 186 ms
[2025-06-03 10:32:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 661 labels/synchronizations in 187 ms.
[2025-06-03 10:32:35] [INFO ] Time to serialize gal into /tmp/LTLFireability15987093801176366243.gal : 25 ms
[2025-06-03 10:32:35] [INFO ] Time to serialize properties into /tmp/LTLFireability13311262786097129516.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15987093801176366243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13311262786097129516.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X(!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p60==1)||(i1.u25.p1788==1))"))))U((("(i0.i0.i0.i0.i0.i0.u18.p812==1)")&&(X(X(!("...316
Formula 0 simplified : XX(XX"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p60==1)||(i1.u25.p1788==1))" R (XXF"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p60==1)||(i1...285

BK_TIME_CONFINEMENT_REACHED

--------------------
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-12b"
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-12b, 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-174860102600476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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