Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 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.4K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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.8K 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 293K 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 CircularTrains-PT-384-LTLFireability-00
FORMULA_NAME CircularTrains-PT-384-LTLFireability-01
FORMULA_NAME CircularTrains-PT-384-LTLFireability-02
FORMULA_NAME CircularTrains-PT-384-LTLFireability-03
FORMULA_NAME CircularTrains-PT-384-LTLFireability-04
FORMULA_NAME CircularTrains-PT-384-LTLFireability-05
FORMULA_NAME CircularTrains-PT-384-LTLFireability-06
FORMULA_NAME CircularTrains-PT-384-LTLFireability-07
FORMULA_NAME CircularTrains-PT-384-LTLFireability-08
FORMULA_NAME CircularTrains-PT-384-LTLFireability-09
FORMULA_NAME CircularTrains-PT-384-LTLFireability-10
FORMULA_NAME CircularTrains-PT-384-LTLFireability-11
FORMULA_NAME CircularTrains-PT-384-LTLFireability-12
FORMULA_NAME CircularTrains-PT-384-LTLFireability-13
FORMULA_NAME CircularTrains-PT-384-LTLFireability-14
FORMULA_NAME CircularTrains-PT-384-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748910061195

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-384
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 00:21:03] [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 00:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:21:04] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2025-06-03 00:21:04] [INFO ] Transformed 768 places.
[2025-06-03 00:21:04] [INFO ] Transformed 384 transitions.
[2025-06-03 00:21:04] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-384-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-384-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 384/384 transitions.
Applied a total of 0 rules in 177 ms. Remains 768 /768 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 768 cols
[2025-06-03 00:21:04] [INFO ] Computed 385 invariants in 106 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:21:07] [INFO ] Implicit Places using invariants in 2587 ms returned [1, 17, 21, 26, 32, 42, 46, 48, 58, 63, 71, 85, 86, 88, 98, 103, 107, 108, 109, 135, 137, 158, 162, 167, 174, 179, 185, 193, 198, 203, 215, 220, 221, 230, 245, 246, 254, 270, 276, 287, 293, 301, 303, 340, 346, 347, 350, 351, 353, 354, 357, 365, 383, 390, 397, 403, 411, 412, 422, 426, 433, 447, 448, 470, 475, 476, 485, 496, 502, 505, 507, 508, 522, 525, 538, 539, 545, 551, 579, 580, 586, 600, 607, 619, 622, 625, 628, 638, 643, 644, 647, 648, 662, 666, 671, 674, 677, 689, 693, 700, 708, 715, 719, 723, 732, 735, 740, 741, 743, 747, 749, 755, 758, 759, 760, 763, 764]
Discarding 117 places :
Implicit Place search using SMT only with invariants took 2672 ms to find 117 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 651/768 places, 384/384 transitions.
Applied a total of 0 rules in 88 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2970 ms. Remains : 651/768 places, 384/384 transitions.
Support contains 64 out of 651 places after structural reductions.
[2025-06-03 00:21:07] [INFO ] Flatten gal took : 133 ms
[2025-06-03 00:21:07] [INFO ] Flatten gal took : 68 ms
[2025-06-03 00:21:08] [INFO ] Input system was already deterministic with 384 transitions.
RANDOM walk for 9184 steps (1 resets) in 1842 ms. (4 steps per ms) remains 0/30 properties
FORMULA CircularTrains-PT-384-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CircularTrains-PT-384-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F((p1&&X(F(p1)))))))'
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 22 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2025-06-03 00:21:09] [INFO ] Computed 268 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:21:10] [INFO ] Implicit Places using invariants in 1047 ms returned [6, 54, 114, 288, 291, 386, 435, 498, 616, 637]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1059 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/651 places, 384/384 transitions.
Applied a total of 0 rules in 25 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1107 ms. Remains : 641/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-00
Product exploration explored 100000 steps with 905 reset in 2636 ms.
Product exploration explored 100000 steps with 921 reset in 2275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 506 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 2330 steps (0 resets) in 288 ms. (8 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 630 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 298 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 384 rows 641 cols
[2025-06-03 00:21:18] [INFO ] Computed 258 invariants in 16 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:21:19] [INFO ] [Real]Absence check using 255 positive place invariants in 198 ms returned sat
[2025-06-03 00:21:19] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 65 ms returned sat
[2025-06-03 00:21:23] [INFO ] [Real]Absence check using state equation in 4548 ms returned sat
[2025-06-03 00:21:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:21:24] [INFO ] [Nat]Absence check using 255 positive place invariants in 196 ms returned sat
[2025-06-03 00:21:24] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 25 ms returned sat
[2025-06-03 00:21:39] [INFO ] [Nat]Absence check using state equation in 14254 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 11 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-03 00:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:21:39] [INFO ] Implicit Places using invariants in 928 ms returned []
[2025-06-03 00:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:21:41] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-03 00:21: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/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/640 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/1025 variables, and 258 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/640 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1025 variables, 256/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 1)
(s37 1)
(s38 0)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 1)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 1)
(s144 1)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 1)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 1)
(s180 1)
(s181 0)
(s182 0)
(s183 1)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 1)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 1)
(s263 0)
(s264 1)
(s265 1)
(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 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 1)
(s330 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1155 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 62330 ms. Remains : 641/641 places, 384/384 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 p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 595 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1187 steps (0 resets) in 45 ms. (25 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 625 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-06-03 00:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:22:44] [INFO ] [Real]Absence check using 255 positive place invariants in 256 ms returned sat
[2025-06-03 00:22:44] [INFO ] [Real]Absence check using 255 positive and 3 generalized place invariants in 92 ms returned sat
[2025-06-03 00:22:52] [INFO ] [Real]Absence check using state equation in 7467 ms returned sat
[2025-06-03 00:22:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:22:53] [INFO ] [Nat]Absence check using 255 positive place invariants in 296 ms returned sat
[2025-06-03 00:22:53] [INFO ] [Nat]Absence check using 255 positive and 3 generalized place invariants in 60 ms returned sat
[2025-06-03 00:23:07] [INFO ] [Nat]Absence check using state equation in 14013 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 918 reset in 2523 ms.
Product exploration explored 100000 steps with 932 reset in 2252 ms.
Applying partial POR strategy [false, true, false, true, false, false]
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 641 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 641 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 127 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 641 transition count 384
Deduced a syphon composed of 127 places in 1 ms
Applied a total of 127 rules in 227 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:23:13] [INFO ] Redundant transitions in 49 ms returned []
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 384 rows 641 cols
[2025-06-03 00:23:13] [INFO ] Computed 258 invariants in 12 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/640 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:22] [INFO ] Deduced a trap composed of 2 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:22] [INFO ] Deduced a trap composed of 2 places in 224 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:23] [INFO ] Deduced a trap composed of 2 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:23] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:23] [INFO ] Deduced a trap composed of 2 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:23] [INFO ] Deduced a trap composed of 2 places in 202 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:23] [INFO ] Deduced a trap composed of 2 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:24] [INFO ] Deduced a trap composed of 2 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:24] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:24] [INFO ] Deduced a trap composed of 2 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:24] [INFO ] Deduced a trap composed of 2 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:24] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:25] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:25] [INFO ] Deduced a trap composed of 2 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:25] [INFO ] Deduced a trap composed of 2 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:25] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:25] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:25] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:25] [INFO ] Deduced a trap composed of 2 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:26] [INFO ] Deduced a trap composed of 2 places in 125 ms of which 10 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 20/277 constraints. Problems are: Problem set: 20 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:30] [INFO ] Deduced a trap composed of 2 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:30] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:31] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 20/297 constraints. Problems are: Problem set: 40 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:32] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 3 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD236 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 20/317 constraints. Problems are: Problem set: 60 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:33] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:34] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:35] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:35] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:35] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 20/337 constraints. Problems are: Problem set: 80 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 3 ms to minimize.
Problem TDEAD114 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD123 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:38] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:39] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:39] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:39] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:39] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:39] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:39] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD140 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 20/357 constraints. Problems are: Problem set: 100 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD143 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD148 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD150 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD168 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD169 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:40] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:41] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD173 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:41] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD179 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:41] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD180 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:41] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:41] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 20/377 constraints. Problems are: Problem set: 120 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:42] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
Problem TDEAD190 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:42] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:42] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:42] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
Problem TDEAD207 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:23:43] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD225 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 5/382 constraints. Problems are: Problem set: 123 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/1025 variables, and 382 constraints, problems are : Problem set: 123 solved, 133 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 125/125 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 123 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 378/640 variables, 255/255 constraints. Problems are: Problem set: 123 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 123 solved, 133 unsolved
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 125/382 constraints. Problems are: Problem set: 125 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/382 constraints. Problems are: Problem set: 125 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 1/641 variables, 1/383 constraints. Problems are: Problem set: 125 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/383 constraints. Problems are: Problem set: 125 solved, 131 unsolved
Problem TDEAD196 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 7 (OVERLAPS) 384/1025 variables, 641/1024 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1025 variables, 129/1153 constraints. Problems are: Problem set: 127 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1025 variables, 0/1153 constraints. Problems are: Problem set: 127 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1153 constraints, problems are : Problem set: 127 solved, 129 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 129/256 constraints, Known Traps: 125/125 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 127 solved, 129 unsolved
Search for dead transitions found 127 dead transitions in 60112ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 641/641 places, 257/384 transitions.
Graph (complete) has 1028 edges and 641 vertex of which 514 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.7 ms
Discarding 127 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 48 ms. Remains 514 /641 variables (removed 127) and now considering 257/257 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/641 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60464 ms. Remains : 514/641 places, 257/384 transitions.
Built C files in :
/tmp/ltsmin8041384310105546273
[2025-06-03 00:24:13] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8041384310105546273
Running compilation step : cd /tmp/ltsmin8041384310105546273;'/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 1896 ms.
Running link step : cd /tmp/ltsmin8041384310105546273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin8041384310105546273;'/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/stateBased10925755233342218739.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 641 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 384/384 transitions.
Applied a total of 0 rules in 17 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 641 cols
[2025-06-03 00:24:28] [INFO ] Computed 258 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:24:29] [INFO ] Implicit Places using invariants in 936 ms returned []
[2025-06-03 00:24:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:24:30] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-03 00:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/640 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 899 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 255/640 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 1/641 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 384/1025 variables, 641/899 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1025 variables, 256/1155 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1155 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in LTL mode , in 1 iterations and 62527 ms. Remains : 641/641 places, 384/384 transitions.
Built C files in :
/tmp/ltsmin10340224700654535556
[2025-06-03 00:25:31] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10340224700654535556
Running compilation step : cd /tmp/ltsmin10340224700654535556;'/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 1254 ms.
Running link step : cd /tmp/ltsmin10340224700654535556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin10340224700654535556;'/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/stateBased9795071605176224654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:25:46] [INFO ] Flatten gal took : 55 ms
[2025-06-03 00:25:46] [INFO ] Flatten gal took : 54 ms
[2025-06-03 00:25:46] [INFO ] Time to serialize gal into /tmp/LTL12275263918376890510.gal : 11 ms
[2025-06-03 00:25:46] [INFO ] Time to serialize properties into /tmp/LTL12933743962572351866.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/LTL12275263918376890510.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12786016367652207719.hoa' '-atoms' '/tmp/LTL12933743962572351866.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...320
Loading property file /tmp/LTL12933743962572351866.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12786016367652207719.hoa
Detected timeout of ITS tools.
[2025-06-03 00:26:01] [INFO ] Flatten gal took : 54 ms
[2025-06-03 00:26:01] [INFO ] Flatten gal took : 49 ms
[2025-06-03 00:26:01] [INFO ] Time to serialize gal into /tmp/LTL4367717872399510110.gal : 8 ms
[2025-06-03 00:26:01] [INFO ] Time to serialize properties into /tmp/LTL17373093556211403904.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/LTL4367717872399510110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17373093556211403904.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...276
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((F221>=1)&&(Section_220>=1))")))||(F(("((Section_285<1)||(F286<1))")&&(X(F("((Section_285<1)||(F286<1))"))))))))
Formula 0 simplified : X(XF!"((F221>=1)&&(Section_220>=1))" & G(!"((Section_285<1)||(F286<1))" | XG!"((Section_285<1)||(F286<1))"))
Detected timeout of ITS tools.
[2025-06-03 00:26:16] [INFO ] Flatten gal took : 42 ms
[2025-06-03 00:26:16] [INFO ] Applying decomposition
[2025-06-03 00:26:16] [INFO ] Flatten gal took : 41 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/graph6942295880392418050.txt' '-o' '/tmp/graph6942295880392418050.bin' '-w' '/tmp/graph6942295880392418050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6942295880392418050.bin' '-l' '-1' '-v' '-w' '/tmp/graph6942295880392418050.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:26:17] [INFO ] Decomposing Gal with order
[2025-06-03 00:26:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:26:17] [INFO ] Flatten gal took : 133 ms
[2025-06-03 00:26:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-03 00:26:17] [INFO ] Time to serialize gal into /tmp/LTL9189668716558748308.gal : 17 ms
[2025-06-03 00:26:17] [INFO ] Time to serialize properties into /tmp/LTL7387717846662196878.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/LTL9189668716558748308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7387717846662196878.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...254
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((i23.i1.u92.F221>=1)&&(i23.i1.u62.Section_220>=1))")))||(F(("((i13.i1.u40.Section_285<1)||(i13.i1.u40.F286<1))")&&(X(F("((...211
Formula 0 simplified : X(XF!"((i23.i1.u92.F221>=1)&&(i23.i1.u62.Section_220>=1))" & G(!"((i13.i1.u40.Section_285<1)||(i13.i1.u40.F286<1))" | XG!"((i13.i1.u...197
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLFireability-00 finished in 323033 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 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 651 transition count 282
Reduce places removed 102 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 104 rules applied. Total rules applied 206 place count 549 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 208 place count 547 transition count 280
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 208 place count 547 transition count 267
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 234 place count 534 transition count 267
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 256 place count 523 transition count 256
Applied a total of 256 rules in 58 ms. Remains 523 /651 variables (removed 128) and now considering 256/384 (removed 128) transitions.
// Phase 1: matrix 256 rows 523 cols
[2025-06-03 00:26:32] [INFO ] Computed 268 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:33] [INFO ] Implicit Places using invariants in 832 ms returned [5, 7, 48, 99, 239, 242, 312, 354, 397, 494, 512]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 849 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/651 places, 256/384 transitions.
Applied a total of 0 rules in 23 ms. Remains 512 /512 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 932 ms. Remains : 512/651 places, 256/384 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-02
Product exploration explored 100000 steps with 87 reset in 1973 ms.
Product exploration explored 100000 steps with 75 reset in 1957 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1758 steps (0 resets) in 62 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 256 rows 512 cols
[2025-06-03 00:26:38] [INFO ] Computed 257 invariants in 6 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-384-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-384-LTLFireability-02 finished in 6679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 651 transition count 280
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 547 transition count 280
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 208 place count 547 transition count 269
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 230 place count 536 transition count 269
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 252 place count 525 transition count 258
Applied a total of 252 rules in 59 ms. Remains 525 /651 variables (removed 126) and now considering 258/384 (removed 126) transitions.
// Phase 1: matrix 258 rows 525 cols
[2025-06-03 00:26:39] [INFO ] Computed 268 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:40] [INFO ] Implicit Places using invariants in 1039 ms returned [5, 7, 48, 100, 241, 244, 314, 356, 399, 514]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1040 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 515/651 places, 258/384 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 257
Applied a total of 2 rules in 23 ms. Remains 514 /515 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 514 cols
[2025-06-03 00:26:40] [INFO ] Computed 258 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:41] [INFO ] Implicit Places using invariants in 822 ms returned []
[2025-06-03 00:26:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:42] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 514/651 places, 257/384 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3244 ms. Remains : 514/651 places, 257/384 transitions.
Stuttering acceptance computed with spot in 238 ms :[p1, p0, (AND p1 p2), (AND p0 p2 (NOT p1))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-03
Product exploration explored 100000 steps with 295 reset in 2097 ms.
Product exploration explored 100000 steps with 296 reset in 2002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 1264 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[p1, p0, (AND p1 p2), (AND p0 p2 (NOT p1))]
RANDOM walk for 4006 steps (0 resets) in 110 ms. (36 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 1807 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, p0, (AND p1 p2), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[p1, p0, (AND p1 p2), (AND p0 p2 (NOT p1))]
Support contains 6 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2025-06-03 00:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:51] [INFO ] Implicit Places using invariants in 702 ms returned []
[2025-06-03 00:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:52] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:26:52] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2025-06-03 00:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 28674 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 255/513 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 24219 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52919ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 52920ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54622 ms. Remains : 514/514 places, 257/257 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 p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 1589 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[p1, p0, (AND p1 p2), (AND p0 p2 (NOT p1))]
RANDOM walk for 3592 steps (0 resets) in 186 ms. (19 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 2138 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[p1, p0, (AND p1 p2), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[p1, p0, (AND p1 p2), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[p1, p0, (AND p1 p2), (AND p0 p2 (NOT p1))]
Product exploration explored 100000 steps with 310 reset in 2337 ms.
Product exploration explored 100000 steps with 299 reset in 2129 ms.
Built C files in :
/tmp/ltsmin16770077424625155995
[2025-06-03 00:27:54] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2025-06-03 00:27:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:27:54] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2025-06-03 00:27:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:27:54] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2025-06-03 00:27:54] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:27:54] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16770077424625155995
Running compilation step : cd /tmp/ltsmin16770077424625155995;'/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 948 ms.
Running link step : cd /tmp/ltsmin16770077424625155995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16770077424625155995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15580618854980952079.hoa' '--buchi-type=spotba'
LTSmin run took 4002 ms.
FORMULA CircularTrains-PT-384-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-03 finished in 80424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U (X(X(p1)) U (p1 U p2))))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2025-06-03 00:27:59] [INFO ] Computed 268 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:00] [INFO ] Implicit Places using invariants in 935 ms returned [8, 54, 114, 288, 291, 386, 498, 616, 637]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 937 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/651 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 963 ms. Remains : 642/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 318 ms :[p2, true, p2, (AND p1 p2), (AND p0 p2), p1, (AND p1 p2), (AND p2 p1), p0]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-05
Entered a terminal (fully accepting) state of product in 11598 steps with 193 reset in 401 ms.
FORMULA CircularTrains-PT-384-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-05 finished in 1709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&X((!p0 U (X(p1)||G(!p0))))&&G((!p0||G(!p2)))))'
Support contains 6 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-03 00:28:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:02] [INFO ] Implicit Places using invariants in 987 ms returned [6, 8, 114, 288, 291, 386, 435, 498, 616, 637]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 989 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/651 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1019 ms. Remains : 641/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, p0, p2, (OR (NOT p1) p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p2 p0)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-06
Entered a terminal (fully accepting) state of product in 233 steps with 0 reset in 9 ms.
FORMULA CircularTrains-PT-384-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-06 finished in 1304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&F(((p3&&X(X(p3)))||p2)))))'
Support contains 8 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-03 00:28:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:03] [INFO ] Implicit Places using invariants in 977 ms returned [6, 8, 54, 114, 288, 291, 386, 435, 498, 616, 637]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 984 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 640/651 places, 384/384 transitions.
Applied a total of 0 rules in 15 ms. Remains 640 /640 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1015 ms. Remains : 640/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-08
Entered a terminal (fully accepting) state of product in 41 steps with 2 reset in 2 ms.
FORMULA CircularTrains-PT-384-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-08 finished in 1446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U !p1)) U (p2||X(p3))))'
Support contains 8 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-03 00:28:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:05] [INFO ] Implicit Places using invariants in 958 ms returned [6, 8, 54, 114, 288, 291, 435, 616, 637]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 964 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/651 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 989 ms. Remains : 642/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), true, p1]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-09
Entered a terminal (fully accepting) state of product in 161 steps with 0 reset in 3 ms.
FORMULA CircularTrains-PT-384-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-09 finished in 1159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 651 transition count 279
Reduce places removed 105 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 106 rules applied. Total rules applied 211 place count 546 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 545 transition count 278
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 212 place count 545 transition count 268
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 232 place count 535 transition count 268
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 254 place count 524 transition count 257
Applied a total of 254 rules in 44 ms. Remains 524 /651 variables (removed 127) and now considering 257/384 (removed 127) transitions.
// Phase 1: matrix 257 rows 524 cols
[2025-06-03 00:28:05] [INFO ] Computed 268 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:06] [INFO ] Implicit Places using invariants in 820 ms returned [5, 7, 48, 239, 242, 312, 354, 397, 495, 513]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 824 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 514/651 places, 257/384 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 882 ms. Remains : 514/651 places, 257/384 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-10
Product exploration explored 100000 steps with 376 reset in 1883 ms.
Product exploration explored 100000 steps with 393 reset in 2774 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 512 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 262 steps (0 resets) in 20 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 761 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 18 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 514 cols
[2025-06-03 00:28:12] [INFO ] Computed 258 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:13] [INFO ] Implicit Places using invariants in 901 ms returned []
[2025-06-03 00:28:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:28:14] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:28:14] [INFO ] Redundant transitions in 4 ms returned []
Running 129 sub problems to find dead transitions.
[2025-06-03 00:28: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/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 29245 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 28762 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58032ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 58035ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60267 ms. Remains : 514/514 places, 257/257 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)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 453 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 495 steps (0 resets) in 18 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 515 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 370 reset in 1944 ms.
Product exploration explored 100000 steps with 418 reset in 2184 ms.
Built C files in :
/tmp/ltsmin10401832321010925407
[2025-06-03 00:29:18] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2025-06-03 00:29:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:29:18] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2025-06-03 00:29:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:29:18] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2025-06-03 00:29:18] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:29:18] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10401832321010925407
Running compilation step : cd /tmp/ltsmin10401832321010925407;'/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 1014 ms.
Running link step : cd /tmp/ltsmin10401832321010925407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10401832321010925407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2160096241837033709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2025-06-03 00:29:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:34] [INFO ] Implicit Places using invariants in 706 ms returned []
[2025-06-03 00:29:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:29:35] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:29:35] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2025-06-03 00:29:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/771 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 772 constraints, problems are : Problem set: 0 solved, 129 unsolved in 23752 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 255/513 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 257/771 variables, 514/772 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 129/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/771 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 901 constraints, problems are : Problem set: 0 solved, 129 unsolved in 24728 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48504ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 48505ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50146 ms. Remains : 514/514 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin6954749187021719203
[2025-06-03 00:30:23] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2025-06-03 00:30:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:23] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2025-06-03 00:30:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:23] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2025-06-03 00:30:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:30:23] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6954749187021719203
Running compilation step : cd /tmp/ltsmin6954749187021719203;'/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 1104 ms.
Running link step : cd /tmp/ltsmin6954749187021719203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6954749187021719203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3480612230791421145.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:30:38] [INFO ] Flatten gal took : 25 ms
[2025-06-03 00:30:38] [INFO ] Flatten gal took : 16 ms
[2025-06-03 00:30:38] [INFO ] Time to serialize gal into /tmp/LTL12150697458805237221.gal : 3 ms
[2025-06-03 00:30:38] [INFO ] Time to serialize properties into /tmp/LTL12416075400959009941.prop : 0 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/LTL12150697458805237221.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1638101943332727386.hoa' '-atoms' '/tmp/LTL12416075400959009941.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...319
Loading property file /tmp/LTL12416075400959009941.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1638101943332727386.hoa
Detected timeout of ITS tools.
[2025-06-03 00:30:53] [INFO ] Flatten gal took : 23 ms
[2025-06-03 00:30:53] [INFO ] Flatten gal took : 22 ms
[2025-06-03 00:30:53] [INFO ] Time to serialize gal into /tmp/LTL13982324043225767104.gal : 4 ms
[2025-06-03 00:30:53] [INFO ] Time to serialize properties into /tmp/LTL14741591168986179765.ltl : 0 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/LTL13982324043225767104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14741591168986179765.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 : !((G(F((G("((Section_294>=1)&&(F295>=1))"))||("((F14>=1)&&(Section_13>=1))")))))
Formula 0 simplified : G(F!"((Section_294>=1)&&(F295>=1))" & FG!"((F14>=1)&&(Section_13>=1))")
Detected timeout of ITS tools.
[2025-06-03 00:31:09] [INFO ] Flatten gal took : 12 ms
[2025-06-03 00:31:09] [INFO ] Applying decomposition
[2025-06-03 00:31:09] [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/graph5775117577406215941.txt' '-o' '/tmp/graph5775117577406215941.bin' '-w' '/tmp/graph5775117577406215941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5775117577406215941.bin' '-l' '-1' '-v' '-w' '/tmp/graph5775117577406215941.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:31:09] [INFO ] Decomposing Gal with order
[2025-06-03 00:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:31:09] [INFO ] Flatten gal took : 33 ms
[2025-06-03 00:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-03 00:31:09] [INFO ] Time to serialize gal into /tmp/LTL8249154689012511089.gal : 9 ms
[2025-06-03 00:31:09] [INFO ] Time to serialize properties into /tmp/LTL16719318423005707033.ltl : 0 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/LTL8249154689012511089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16719318423005707033.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 : !((G(F((G("((i11.i1.i1.u183.Section_294>=1)&&(i11.i1.i0.u236.F295>=1))"))||("((i16.i1.i1.u223.F14>=1)&&(i16.i1.i1.u223.Section_13>=1))...161
Formula 0 simplified : G(F!"((i11.i1.i1.u183.Section_294>=1)&&(i11.i1.i0.u236.F295>=1))" & FG!"((i16.i1.i1.u223.F14>=1)&&(i16.i1.i1.u223.Section_13>=1))")
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-384-LTLFireability-10 finished in 199135 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(!p0))))'
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 16 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 651 cols
[2025-06-03 00:31:24] [INFO ] Computed 268 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:25] [INFO ] Implicit Places using invariants in 987 ms returned [6, 8, 54, 114, 291, 386, 435, 498, 616, 637]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 989 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/651 places, 384/384 transitions.
Applied a total of 0 rules in 12 ms. Remains 641 /641 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1019 ms. Remains : 641/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-12
Entered a terminal (fully accepting) state of product in 160 steps with 0 reset in 4 ms.
FORMULA CircularTrains-PT-384-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-384-LTLFireability-12 finished in 1230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(G((!p1||X(!p2))))||G(!p3))))'
Support contains 8 out of 651 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 651/651 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 651 /651 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2025-06-03 00:31:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:26] [INFO ] Implicit Places using invariants in 1067 ms returned [6, 8, 54, 114, 288, 386, 435, 616, 637]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1076 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 642/651 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1098 ms. Remains : 642/651 places, 384/384 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND p1 p2 p3), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2 p3), (AND p1 p2)]
Running random walk in product with property : CircularTrains-PT-384-LTLFireability-14
Product exploration explored 100000 steps with 288 reset in 2135 ms.
Product exploration explored 100000 steps with 298 reset in 2003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p1 p3))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 30 factoid took 1540 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 2615 steps (0 resets) in 86 ms. (30 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (AND p1 p3 p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 p2))), (X (NOT (AND p1 p3))), (X (NOT (AND p3 (NOT p0) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (AND p1 p3 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p3) p0 p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F p3)]
Knowledge based reduction with 30 factoid took 1903 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 210 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Support contains 6 out of 642 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 642/642 places, 384/384 transitions.
Applied a total of 0 rules in 13 ms. Remains 642 /642 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 642 cols
[2025-06-03 00:31:35] [INFO ] Computed 259 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:36] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2025-06-03 00:31:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:31:37] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-03 00:31:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/1026 variables, and 259 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 255/641 variables, 255/256 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 1/642 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 384/1026 variables, 642/901 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1026 variables, 256/1157 constraints. Problems are: Problem set: 0 solved, 256 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 1026/1026 variables, and 1157 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 255/255 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 62418 ms. Remains : 642/642 places, 384/384 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 p1) (NOT p3) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
RANDOM walk for 4431 steps (0 resets) in 180 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F p3)]
Knowledge based reduction with 2 factoid took 420 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 209 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 213 ms :[(AND p1 p3 p2), (AND p1 p2), (AND p1 p3 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 287 reset in 2260 ms.
Product exploration explored 100000 steps with 284 reset in 1971 ms.
Built C files in :
/tmp/ltsmin18061062072569059061
[2025-06-03 00:32:44] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18061062072569059061
Running compilation step : cd /tmp/ltsmin18061062072569059061;'/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 1274 ms.
Running link step : cd /tmp/ltsmin18061062072569059061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin18061062072569059061;'/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/stateBased2356725584960648696.hoa' '--buchi-type=spotba'
LTSmin run took 7984 ms.
FORMULA CircularTrains-PT-384-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-384-LTLFireability-14 finished in 87822 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(G(p0))||F((p1&&X(F(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2025-06-03 00:32:53] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5941872311762393654
[2025-06-03 00:32:53] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2025-06-03 00:32:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:53] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2025-06-03 00:32:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:53] [INFO ] Applying decomposition
[2025-06-03 00:32:53] [INFO ] Flatten gal took : 15 ms
[2025-06-03 00:32:53] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2025-06-03 00:32:53] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:32:53] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5941872311762393654
Running compilation step : cd /tmp/ltsmin5941872311762393654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
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/graph10533754259324495261.txt' '-o' '/tmp/graph10533754259324495261.bin' '-w' '/tmp/graph10533754259324495261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10533754259324495261.bin' '-l' '-1' '-v' '-w' '/tmp/graph10533754259324495261.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:32:53] [INFO ] Decomposing Gal with order
[2025-06-03 00:32:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:32:53] [INFO ] Flatten gal took : 51 ms
[2025-06-03 00:32:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 00:32:53] [INFO ] Time to serialize gal into /tmp/LTLFireability14093871358594168482.gal : 14 ms
[2025-06-03 00:32:53] [INFO ] Time to serialize properties into /tmp/LTLFireability5574361864047136870.ltl : 0 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/LTLFireability14093871358594168482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5574361864047136870.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...277
Read 2 LTL properties
Checking formula 0 : !((X((X(G("((i19.i0.u60.F221>=1)&&(i19.i0.u60.Section_220>=1))")))||(F(("((i9.i1.u35.Section_285<1)||(i9.i1.u35.F286<1))")&&(X(F("((i9...207
Formula 0 simplified : X(XF!"((i19.i0.u60.F221>=1)&&(i19.i0.u60.Section_220>=1))" & G(!"((i9.i1.u35.Section_285<1)||(i9.i1.u35.F286<1))" | XG!"((i9.i1.u35....193
Compilation finished in 1665 ms.
Running link step : cd /tmp/ltsmin5941872311762393654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin5941872311762393654;'/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([]((LTLAPp0==true)))||<>(((LTLAPp1==true)&&X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: LTL layer: formula: X((X([]((LTLAPp0==true)))||<>(((LTLAPp1==true)&&X(<>((LTLAPp1==true)))))))
pins2lts-mc-linux64( 2/ 8), 0.015: "X((X([]((LTLAPp0==true)))||<>(((LTLAPp1==true)&&X(<>((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.016: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.173: DFS-FIFO for weak LTL, using special progress label 389
pins2lts-mc-linux64( 0/ 8), 0.173: There are 390 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.173: State length is 652, there are 396 groups
pins2lts-mc-linux64( 0/ 8), 0.173: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.173: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.173: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.173: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.391: ~1 levels ~960 states ~4096 transitions
pins2lts-mc-linux64( 0/ 8), 1.591: ~52 levels ~1920 states ~87776 transitions
pins2lts-mc-linux64( 0/ 8), 2.155: ~122 levels ~3840 states ~150744 transitions
pins2lts-mc-linux64( 4/ 8), 3.083: ~271 levels ~7680 states ~222216 transitions
pins2lts-mc-linux64( 2/ 8), 4.676: ~660 levels ~15360 states ~501824 transitions
pins2lts-mc-linux64( 2/ 8), 6.672: ~1586 levels ~30720 states ~1077536 transitions
pins2lts-mc-linux64( 7/ 8), 9.382: ~3395 levels ~61440 states ~2043616 transitions
pins2lts-mc-linux64( 4/ 8), 13.927: ~7140 levels ~122880 states ~3781456 transitions
pins2lts-mc-linux64( 4/ 8), 18.757: ~12225 levels ~245760 states ~5204552 transitions
pins2lts-mc-linux64( 4/ 8), 23.434: ~12225 levels ~491520 states ~5810640 transitions
pins2lts-mc-linux64( 4/ 8), 33.597: ~12225 levels ~983040 states ~7161368 transitions
pins2lts-mc-linux64( 4/ 8), 54.313: ~12225 levels ~1966080 states ~10167992 transitions
pins2lts-mc-linux64( 5/ 8), 96.701: ~12211 levels ~3932160 states ~16855696 transitions
pins2lts-mc-linux64( 7/ 8), 182.079: ~12216 levels ~7864320 states ~29426344 transitions
pins2lts-mc-linux64( 1/ 8), 255.932: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 255.986:
pins2lts-mc-linux64( 0/ 8), 255.986: mean standard work distribution: 1.4% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 255.986:
pins2lts-mc-linux64( 0/ 8), 255.986: Explored 10506728 states 39921445 transitions, fanout: 3.800
pins2lts-mc-linux64( 0/ 8), 255.986: Total exploration time 255.810 sec (255.760 sec minimum, 255.774 sec on average)
pins2lts-mc-linux64( 0/ 8), 255.986: States per second: 41072, Transitions per second: 156059
pins2lts-mc-linux64( 0/ 8), 255.986:
pins2lts-mc-linux64( 0/ 8), 255.986: Progress states detected: 8307
pins2lts-mc-linux64( 0/ 8), 255.986: Redundant explorations: -31.7573
pins2lts-mc-linux64( 0/ 8), 255.986:
pins2lts-mc-linux64( 0/ 8), 255.986: Queue width: 8B, total height: 114463, memory: 0.87MB
pins2lts-mc-linux64( 0/ 8), 255.986: Tree memory: 373.5MB, 25.4 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 255.986: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 255.986: Stored 465 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 255.986: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 255.986: Est. total memory use: 374.3MB (~1024.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5941872311762393654;'/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([]((LTLAPp0==true)))||<>(((LTLAPp1==true)&&X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5941872311762393654;'/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([]((LTLAPp0==true)))||<>(((LTLAPp1==true)&&X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-03 00:56:50] [INFO ] Flatten gal took : 30 ms
[2025-06-03 00:56:50] [INFO ] Time to serialize gal into /tmp/LTLFireability1462426697025214909.gal : 3 ms
[2025-06-03 00:56:50] [INFO ] Time to serialize properties into /tmp/LTLFireability1945979157822137237.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/LTLFireability1462426697025214909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1945979157822137237.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...297
Read 2 LTL properties
Checking formula 0 : !((X((X(G("((F221>=1)&&(Section_220>=1))")))||(F(("((Section_285<1)||(F286<1))")&&(X(F("((Section_285<1)||(F286<1))"))))))))
Formula 0 simplified : X(XF!"((F221>=1)&&(Section_220>=1))" & G(!"((Section_285<1)||(F286<1))" | XG!"((Section_285<1)||(F286<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-03 01:20:46] [INFO ] Flatten gal took : 24 ms
[2025-06-03 01:20:46] [INFO ] Input system was already deterministic with 384 transitions.
[2025-06-03 01:20:46] [INFO ] Transformed 651 places.
[2025-06-03 01:20:46] [INFO ] Transformed 384 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-03 01:20:47] [INFO ] Time to serialize gal into /tmp/LTLFireability13558664153444236751.gal : 3 ms
[2025-06-03 01:20:47] [INFO ] Time to serialize properties into /tmp/LTLFireability9381900064327130401.ltl : 0 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/LTLFireability13558664153444236751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9381900064327130401.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(G("((F221>=1)&&(Section_220>=1))")))||(F(("((Section_285<1)||(F286<1))")&&(X(F("((Section_285<1)||(F286<1))"))))))))
Formula 0 simplified : X(XF!"((F221>=1)&&(Section_220>=1))" & G(!"((Section_285<1)||(F286<1))" | XG!"((Section_285<1)||(F286<1))"))

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="CircularTrains-PT-384"
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 CircularTrains-PT-384, 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 r030-smll-174853813900428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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