Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730100858.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 BART-PT-030, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730100858
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 52M
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.8M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.0M 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 809K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 591K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.7M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 86K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 174K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 7.1M 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 BART-PT-030-CTLFireability-2025-00
FORMULA_NAME BART-PT-030-CTLFireability-2025-01
FORMULA_NAME BART-PT-030-CTLFireability-2025-02
FORMULA_NAME BART-PT-030-CTLFireability-2025-03
FORMULA_NAME BART-PT-030-CTLFireability-2025-04
FORMULA_NAME BART-PT-030-CTLFireability-2025-05
FORMULA_NAME BART-PT-030-CTLFireability-2025-06
FORMULA_NAME BART-PT-030-CTLFireability-2025-07
FORMULA_NAME BART-PT-030-CTLFireability-2025-08
FORMULA_NAME BART-PT-030-CTLFireability-2025-09
FORMULA_NAME BART-PT-030-CTLFireability-2025-10
FORMULA_NAME BART-PT-030-CTLFireability-2025-11
FORMULA_NAME BART-PT-030-CTLFireability-2025-12
FORMULA_NAME BART-PT-030-CTLFireability-2025-13
FORMULA_NAME BART-PT-030-CTLFireability-2025-14
FORMULA_NAME BART-PT-030-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748674784319

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 06:59:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 06:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:59:46] [INFO ] Load time of PNML (sax parser for PT used): 552 ms
[2025-05-31 06:59:46] [INFO ] Transformed 4170 places.
[2025-05-31 06:59:46] [INFO ] Transformed 6060 transitions.
[2025-05-31 06:59:46] [INFO ] Found NUPN structural information;
[2025-05-31 06:59:46] [INFO ] Parsed PT model containing 4170 places and 6060 transitions and 48600 arcs in 679 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 157 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 3960 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 36 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2025-05-31 06:59:47] [INFO ] Computed 30 invariants in 69 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:59:48] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2025-05-31 06:59:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:59:50] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 3658 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2025-05-31 06:59:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30132 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 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 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30069 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62976ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 63009ms
Finished structural reductions in LTL mode , in 1 iterations and 66743 ms. Remains : 3960/3960 places, 6060/6060 transitions.
Support contains 3960 out of 3960 places after structural reductions.
[2025-05-31 07:00:54] [INFO ] Flatten gal took : 415 ms
[2025-05-31 07:00:57] [INFO ] Flatten gal took : 383 ms
[2025-05-31 07:01:00] [INFO ] Input system was already deterministic with 6060 transitions.
Reduction of identical properties reduced properties to check from 41 to 36
RANDOM walk for 40000 steps (8 resets) in 2384 ms. (16 steps per ms) remains 2/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4907 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
[2025-05-31 07:01:02] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2640 variables, 2640/2640 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2640 variables, 0/2640 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1320/3960 variables, 30/2670 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3960 variables, 1320/3990 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3960 variables, 0/3990 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6060/10020 variables, 3960/7950 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10020 variables, 0/7950 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/10020 variables, 0/7950 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10020/10020 variables, and 7950 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3249 ms.
Refiners :[Domain max(s): 3960/3960 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 3960/3960 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 262/264 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 262/266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 1/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/10020 variables, and 531 constraints, problems are : Problem set: 1 solved, 1 unsolved in 348 ms.
Refiners :[Domain max(s): 264/3960 constraints, Positive P Invariants (semi-flows): 2/30 constraints, State Equation: 264/3960 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3637ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA BART-PT-030-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 07:01:06] [INFO ] Flatten gal took : 224 ms
[2025-05-31 07:01:08] [INFO ] Flatten gal took : 307 ms
[2025-05-31 07:01:10] [INFO ] Input system was already deterministic with 6060 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 111 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
[2025-05-31 07:01:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:11] [INFO ] Implicit Places using invariants in 668 ms returned []
[2025-05-31 07:01:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:14] [INFO ] Implicit Places using invariants and state equation in 2599 ms returned []
Implicit Place search using SMT with State Equation took 3270 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2025-05-31 07:01: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/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30071 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
(s451 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30072 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62696ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 62706ms
Finished structural reductions in LTL mode , in 1 iterations and 66101 ms. Remains : 3960/3960 places, 6060/6060 transitions.
[2025-05-31 07:02:17] [INFO ] Flatten gal took : 97 ms
[2025-05-31 07:02:17] [INFO ] Flatten gal took : 110 ms
[2025-05-31 07:02:17] [INFO ] Input system was already deterministic with 6060 transitions.
[2025-05-31 07:02:17] [INFO ] Flatten gal took : 101 ms
[2025-05-31 07:02:17] [INFO ] Flatten gal took : 102 ms
[2025-05-31 07:02:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3272597195875367044.gal : 36 ms
[2025-05-31 07:02:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10253112662478638443.ctl : 25 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3272597195875367044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10253112662478638443.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 07:02:48] [INFO ] Flatten gal took : 97 ms
[2025-05-31 07:02:48] [INFO ] Applying decomposition
[2025-05-31 07:02:48] [INFO ] Flatten gal took : 99 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/graph3559113581442906210.txt' '-o' '/tmp/graph3559113581442906210.bin' '-w' '/tmp/graph3559113581442906210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3559113581442906210.bin' '-l' '-1' '-v' '-w' '/tmp/graph3559113581442906210.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:02:48] [INFO ] Decomposing Gal with order
[2025-05-31 07:02:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:02:50] [INFO ] Removed a total of 463 redundant transitions.
[2025-05-31 07:02:50] [INFO ] Flatten gal took : 451 ms
[2025-05-31 07:02:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2025-05-31 07:02:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12529106939085380844.gal : 53 ms
[2025-05-31 07:02:53] [INFO ] Time to serialize properties into /tmp/CTLFireability14297115702873865283.ctl : 27 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12529106939085380844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14297115702873865283.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14207e+63,2.40176,44488,1135,75,20502,3438,3266,18654,295,3121,0


Converting to forward existential form...Done !
original formula: (A((AX(!(((((((((((i21.i0.u7.TrainState_17_2_4==1)||(i3.i1.u229.TrainState_2_3_7==1))||((i23.i0.u193.TrainState_15_3_8==1)||(i8.i0.u183.T...264163
=> equivalent forward existential formula: ([((Init * !(EG(!(E(!(EG(!(EG((((((((((((((i5.i5.u818.TrainState_8_2_26==1)||(i27.i1.u349.TrainState_19_2_16==1)...489339
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 3960 transition count 5970
Reduce places removed 90 places and 0 transitions.
Performed 780 Post agglomeration using F-continuation condition.Transition count delta: 780
Iterating post reduction 1 with 870 rules applied. Total rules applied 960 place count 3870 transition count 5190
Reduce places removed 780 places and 0 transitions.
Iterating post reduction 2 with 780 rules applied. Total rules applied 1740 place count 3090 transition count 5190
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1770 place count 3060 transition count 5160
Iterating global reduction 3 with 30 rules applied. Total rules applied 1800 place count 3060 transition count 5160
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 2040 place count 2940 transition count 5040
Applied a total of 2040 rules in 610 ms. Remains 2940 /3960 variables (removed 1020) and now considering 5040/6060 (removed 1020) transitions.
// Phase 1: matrix 5040 rows 2940 cols
[2025-05-31 07:03:24] [INFO ] Computed 30 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:24] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-05-31 07:03:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:26] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:03:26] [INFO ] Redundant transitions in 369 ms returned []
Running 3960 sub problems to find dead transitions.
[2025-05-31 07:03:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)timeout

(s2028 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2910/7980 variables, and 0 constraints, problems are : Problem set: 0 solved, 3960 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2940 constraints, PredecessorRefiner: 3960/3960 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3960 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2910/7980 variables, and 0 constraints, problems are : Problem set: 0 solved, 3960 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2940 constraints, PredecessorRefiner: 0/3960 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61655ms problems are : Problem set: 0 solved, 3960 unsolved
Search for dead transitions found 0 dead transitions in 61661ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2940/3960 places, 5040/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64667 ms. Remains : 2940/3960 places, 5040/6060 transitions.
[2025-05-31 07:04:28] [INFO ] Flatten gal took : 72 ms
[2025-05-31 07:04:28] [INFO ] Flatten gal took : 82 ms
[2025-05-31 07:04:28] [INFO ] Input system was already deterministic with 5040 transitions.
[2025-05-31 07:04:28] [INFO ] Flatten gal took : 73 ms
[2025-05-31 07:04:28] [INFO ] Flatten gal took : 75 ms
[2025-05-31 07:04:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15278305674464175954.gal : 15 ms
[2025-05-31 07:04:28] [INFO ] Time to serialize properties into /tmp/CTLFireability9277400221446077625.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15278305674464175954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9277400221446077625.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 07:04:58] [INFO ] Flatten gal took : 64 ms
[2025-05-31 07:04:58] [INFO ] Applying decomposition
[2025-05-31 07:04:58] [INFO ] Flatten gal took : 66 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/graph3830726878120829290.txt' '-o' '/tmp/graph3830726878120829290.bin' '-w' '/tmp/graph3830726878120829290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3830726878120829290.bin' '-l' '-1' '-v' '-w' '/tmp/graph3830726878120829290.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:04:59] [INFO ] Decomposing Gal with order
[2025-05-31 07:04:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:04:59] [INFO ] Removed a total of 264 redundant transitions.
[2025-05-31 07:04:59] [INFO ] Flatten gal took : 160 ms
[2025-05-31 07:04:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2025-05-31 07:04:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6756097793020184661.gal : 31 ms
[2025-05-31 07:04:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14131785884251400938.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6756097793020184661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14131785884251400938.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45484e+59,1.4155,32884,1183,89,10495,3932,2097,7674,368,3801,0


Converting to forward existential form...Done !
original formula: EG((((((((((((AF(((((((i24.u18.TrainState_1_1_1==1)||(i9.u0.TrainState_2_1_1==1))||((i17.u19.TrainState_3_1_1==1)||(i28.u1.TrainState_4_1...71809
=> equivalent forward existential formula: [FwdG(Init,(((((((((((!(EG(!(((((((i24.u18.TrainState_1_1_1==1)||(i9.u0.TrainState_2_1_1==1))||((i17.u19.TrainSt...71858
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1920 transitions
Trivial Post-agglo rules discarded 1920 transitions
Performed 1920 trivial Post agglomeration. Transition count delta: 1920
Iterating post reduction 0 with 1920 rules applied. Total rules applied 1920 place count 3960 transition count 4140
Reduce places removed 1920 places and 0 transitions.
Iterating post reduction 1 with 1920 rules applied. Total rules applied 3840 place count 2040 transition count 4140
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 3840 place count 2040 transition count 4020
Deduced a syphon composed of 120 places in 2 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 4080 place count 1920 transition count 4020
Discarding 180 places :
Symmetric choice reduction at 2 with 180 rule applications. Total rules 4260 place count 1740 transition count 3840
Iterating global reduction 2 with 180 rules applied. Total rules applied 4440 place count 1740 transition count 3840
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 4470 place count 1740 transition count 3810
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 4590 place count 1620 transition count 3690
Iterating global reduction 3 with 120 rules applied. Total rules applied 4710 place count 1620 transition count 3690
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 4800 place count 1530 transition count 3600
Iterating global reduction 3 with 90 rules applied. Total rules applied 4890 place count 1530 transition count 3600
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 4980 place count 1440 transition count 3510
Iterating global reduction 3 with 90 rules applied. Total rules applied 5070 place count 1440 transition count 3510
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 5130 place count 1380 transition count 3450
Iterating global reduction 3 with 60 rules applied. Total rules applied 5190 place count 1380 transition count 3450
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 5250 place count 1320 transition count 3390
Iterating global reduction 3 with 60 rules applied. Total rules applied 5310 place count 1320 transition count 3390
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 5340 place count 1290 transition count 3360
Iterating global reduction 3 with 30 rules applied. Total rules applied 5370 place count 1290 transition count 3360
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 5730 place count 1110 transition count 3180
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 5790 place count 1110 transition count 3120
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 5850 place count 1080 transition count 3090
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 5910 place count 1080 transition count 3030
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 5970 place count 1050 transition count 3000
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 5 with 60 rules applied. Total rules applied 6030 place count 1050 transition count 2940
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 6090 place count 1020 transition count 2910
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 6150 place count 1020 transition count 2850
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 6210 place count 990 transition count 2820
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 7 with 60 rules applied. Total rules applied 6270 place count 990 transition count 2760
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 6330 place count 960 transition count 2730
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 8 with 60 rules applied. Total rules applied 6390 place count 960 transition count 2670
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 6450 place count 930 transition count 2640
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 6510 place count 930 transition count 2580
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 60 rules applied. Total rules applied 6570 place count 900 transition count 2550
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 10 with 60 rules applied. Total rules applied 6630 place count 900 transition count 2490
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 6690 place count 870 transition count 2460
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 11 with 60 rules applied. Total rules applied 6750 place count 870 transition count 2400
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 6810 place count 840 transition count 2370
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 12 with 60 rules applied. Total rules applied 6870 place count 840 transition count 2310
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 13 with 60 rules applied. Total rules applied 6930 place count 810 transition count 2280
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 13 with 60 rules applied. Total rules applied 6990 place count 810 transition count 2220
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 14 with 60 rules applied. Total rules applied 7050 place count 780 transition count 2190
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 14 with 60 rules applied. Total rules applied 7110 place count 780 transition count 2130
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 15 with 60 rules applied. Total rules applied 7170 place count 750 transition count 2100
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 15 with 60 rules applied. Total rules applied 7230 place count 750 transition count 2040
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 16 with 60 rules applied. Total rules applied 7290 place count 720 transition count 2010
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 16 with 60 rules applied. Total rules applied 7350 place count 720 transition count 1950
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 17 with 60 rules applied. Total rules applied 7410 place count 690 transition count 1920
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 17 with 60 rules applied. Total rules applied 7470 place count 690 transition count 1860
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 18 with 60 rules applied. Total rules applied 7530 place count 660 transition count 1830
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 18 with 60 rules applied. Total rules applied 7590 place count 660 transition count 1770
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 19 with 60 rules applied. Total rules applied 7650 place count 630 transition count 1740
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 19 with 60 rules applied. Total rules applied 7710 place count 630 transition count 1680
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 20 with 60 rules applied. Total rules applied 7770 place count 600 transition count 1650
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 60 rules applied. Total rules applied 7830 place count 600 transition count 1590
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 21 with 60 rules applied. Total rules applied 7890 place count 570 transition count 1560
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 21 with 60 rules applied. Total rules applied 7950 place count 570 transition count 1500
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 22 with 60 rules applied. Total rules applied 8010 place count 540 transition count 1470
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 22 with 60 rules applied. Total rules applied 8070 place count 540 transition count 1410
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 23 with 60 rules applied. Total rules applied 8130 place count 510 transition count 1380
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 23 with 60 rules applied. Total rules applied 8190 place count 510 transition count 1320
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 24 with 60 rules applied. Total rules applied 8250 place count 480 transition count 1290
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 24 with 60 rules applied. Total rules applied 8310 place count 480 transition count 1230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 25 with 60 rules applied. Total rules applied 8370 place count 450 transition count 1200
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 25 with 60 rules applied. Total rules applied 8430 place count 450 transition count 1140
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 26 with 60 rules applied. Total rules applied 8490 place count 420 transition count 1110
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 26 with 60 rules applied. Total rules applied 8550 place count 420 transition count 1050
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 27 with 60 rules applied. Total rules applied 8610 place count 390 transition count 1020
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 27 with 60 rules applied. Total rules applied 8670 place count 390 transition count 960
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 28 with 60 rules applied. Total rules applied 8730 place count 360 transition count 930
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 28 with 60 rules applied. Total rules applied 8790 place count 360 transition count 870
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 29 with 60 rules applied. Total rules applied 8850 place count 330 transition count 840
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 29 with 60 rules applied. Total rules applied 8910 place count 330 transition count 780
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 30 with 60 rules applied. Total rules applied 8970 place count 300 transition count 750
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 30 with 60 rules applied. Total rules applied 9030 place count 300 transition count 690
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 31 with 60 rules applied. Total rules applied 9090 place count 270 transition count 660
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 31 with 60 rules applied. Total rules applied 9150 place count 270 transition count 600
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 32 with 60 rules applied. Total rules applied 9210 place count 240 transition count 570
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 32 with 60 rules applied. Total rules applied 9270 place count 240 transition count 510
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 33 with 60 rules applied. Total rules applied 9330 place count 210 transition count 480
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 33 with 60 rules applied. Total rules applied 9390 place count 210 transition count 420
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 34 with 60 rules applied. Total rules applied 9450 place count 180 transition count 390
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 34 with 60 rules applied. Total rules applied 9510 place count 180 transition count 330
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 35 with 60 rules applied. Total rules applied 9570 place count 150 transition count 300
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 35 with 60 rules applied. Total rules applied 9630 place count 150 transition count 240
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 36 with 60 rules applied. Total rules applied 9690 place count 120 transition count 210
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 36 with 90 rules applied. Total rules applied 9780 place count 120 transition count 120
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 37 with 60 rules applied. Total rules applied 9840 place count 90 transition count 90
Applied a total of 9840 rules in 1615 ms. Remains 90 /3960 variables (removed 3870) and now considering 90/6060 (removed 5970) transitions.
// Phase 1: matrix 90 rows 90 cols
[2025-05-31 07:05:31] [INFO ] Computed 30 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:05:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-31 07:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:05:31] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:05:31] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-05-31 07:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 30/90 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 90/180 variables, 90/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 0/180 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 120 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 30/90 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 90/180 variables, 90/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 60/180 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 180 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2298ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2299ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/3960 places, 90/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3995 ms. Remains : 90/3960 places, 90/6060 transitions.
[2025-05-31 07:05:33] [INFO ] Flatten gal took : 6 ms
[2025-05-31 07:05:33] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:05:33] [INFO ] Input system was already deterministic with 90 transitions.
[2025-05-31 07:05:33] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:05:33] [INFO ] Flatten gal took : 9 ms
[2025-05-31 07:05:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12725233312266661857.gal : 0 ms
[2025-05-31 07:05:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13853307885133791063.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12725233312266661857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13853307885133791063.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05891e+14,0.019526,4276,2,151,5,688,6,0,453,448,0


Converting to forward existential form...Done !
original formula: E(((((((TrainState_10_0_0==1)||(TrainState_29_0_0==1))||((TrainState_5_0_0==1)||(TrainState_2_0_0==1)))||(((TrainState_23_0_0==1)||(Train...57044
=> equivalent forward existential formula: [FwdG(FwdU(Init,((((((TrainState_10_0_0==1)||(TrainState_29_0_0==1))||((TrainState_5_0_0==1)||(TrainState_2_0_0=...57106
Hit Full ! (commute/partial/dont) 30/0/60
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.07061,16052,1,0,19,21660,34,6,2332,27025,19
FORMULA BART-PT-030-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 15 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2025-05-31 07:05:35] [INFO ] Computed 30 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:05:35] [INFO ] Implicit Places using invariants in 676 ms returned []
[2025-05-31 07:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:05:38] [INFO ] Implicit Places using invariants and state equation in 2719 ms returned []
Implicit Place search using SMT with State Equation took 3401 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2025-05-31 07:05:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30067 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 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 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30058 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62809ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 62817ms
Finished structural reductions in LTL mode , in 1 iterations and 66246 ms. Remains : 3960/3960 places, 6060/6060 transitions.
[2025-05-31 07:06:41] [INFO ] Flatten gal took : 88 ms
[2025-05-31 07:06:41] [INFO ] Flatten gal took : 107 ms
[2025-05-31 07:06:41] [INFO ] Input system was already deterministic with 6060 transitions.
[2025-05-31 07:06:41] [INFO ] Flatten gal took : 102 ms
[2025-05-31 07:06:42] [INFO ] Flatten gal took : 106 ms
[2025-05-31 07:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6875565679898117593.gal : 17 ms
[2025-05-31 07:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5896258679983636656.ctl : 13 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6875565679898117593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5896258679983636656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 07:07:12] [INFO ] Flatten gal took : 102 ms
[2025-05-31 07:07:12] [INFO ] Applying decomposition
[2025-05-31 07:07:12] [INFO ] Flatten gal took : 103 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/graph4450396556154764756.txt' '-o' '/tmp/graph4450396556154764756.bin' '-w' '/tmp/graph4450396556154764756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4450396556154764756.bin' '-l' '-1' '-v' '-w' '/tmp/graph4450396556154764756.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:07:12] [INFO ] Decomposing Gal with order
[2025-05-31 07:07:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:07:13] [INFO ] Removed a total of 429 redundant transitions.
[2025-05-31 07:07:13] [INFO ] Flatten gal took : 207 ms
[2025-05-31 07:07:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-05-31 07:07:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18173521424266182990.gal : 30 ms
[2025-05-31 07:07:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12229468603841410333.ctl : 29 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18173521424266182990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12229468603841410333.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14207e+63,2.41989,44800,1067,75,20148,3179,3311,18653,280,2647,0


Converting to forward existential form...Done !
original formula: (E(EX(((((((((((((i21.i0.u1266.TrainState_20_1_5==1)||(i16.i0.u84.TrainState_21_1_8==1))||((i22.i5.u138.TrainState_18_2_6==1)||(i6.i0.u74...371917
=> equivalent forward existential formula: [((FwdU((Init * E(EX(((((((((((((i21.i0.u1266.TrainState_20_1_5==1)||(i16.i0.u84.TrainState_21_1_8==1))||((i22.i...374163
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 11 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
[2025-05-31 07:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:07:48] [INFO ] Implicit Places using invariants in 666 ms returned []
[2025-05-31 07:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:07:51] [INFO ] Implicit Places using invariants and state equation in 2480 ms returned []
Implicit Place search using SMT with State Equation took 3148 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2025-05-31 07:07:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30069 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 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 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30062 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62403ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 62410ms
Finished structural reductions in LTL mode , in 1 iterations and 65579 ms. Remains : 3960/3960 places, 6060/6060 transitions.
[2025-05-31 07:08:53] [INFO ] Flatten gal took : 88 ms
[2025-05-31 07:08:53] [INFO ] Flatten gal took : 107 ms
[2025-05-31 07:08:53] [INFO ] Input system was already deterministic with 6060 transitions.
[2025-05-31 07:08:54] [INFO ] Flatten gal took : 102 ms
[2025-05-31 07:08:54] [INFO ] Flatten gal took : 106 ms
[2025-05-31 07:08:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7850745520087757224.gal : 16 ms
[2025-05-31 07:08:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17043116228815915076.ctl : 11 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7850745520087757224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17043116228815915076.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 07:09:24] [INFO ] Flatten gal took : 103 ms
[2025-05-31 07:09:24] [INFO ] Applying decomposition
[2025-05-31 07:09:24] [INFO ] Flatten gal took : 105 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/graph9828916435855522836.txt' '-o' '/tmp/graph9828916435855522836.bin' '-w' '/tmp/graph9828916435855522836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9828916435855522836.bin' '-l' '-1' '-v' '-w' '/tmp/graph9828916435855522836.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:09:24] [INFO ] Decomposing Gal with order
[2025-05-31 07:09:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:09:25] [INFO ] Removed a total of 436 redundant transitions.
[2025-05-31 07:09:25] [INFO ] Flatten gal took : 199 ms
[2025-05-31 07:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-05-31 07:09:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4228642183958202545.gal : 27 ms
[2025-05-31 07:09:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11571533291126889671.ctl : 17 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4228642183958202545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11571533291126889671.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14207e+63,2.44717,44644,1051,75,21252,3165,3383,20124,277,2621,0


Converting to forward existential form...Done !
original formula: AG(E(AX(((((((((((((AF(((((((((((((i8.i0.u82.TrainState_20_1_5==1)||(i6.i0.u101.TrainState_21_1_8==1))||((i20.i6.u94.TrainState_18_2_6==1...371009
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX(!(((((((((((((!(EG(!(((((((((((((i8.i0.u82.TrainState_20_1_5==1)||(i6.i0.u101.Train...526150
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 3870 transition count 5970
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 3870 transition count 5970
Applied a total of 180 rules in 240 ms. Remains 3870 /3960 variables (removed 90) and now considering 5970/6060 (removed 90) transitions.
// Phase 1: matrix 5970 rows 3870 cols
[2025-05-31 07:09:59] [INFO ] Computed 30 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:10:00] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-05-31 07:10:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:10:02] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 2577 ms to find 0 implicit places.
Running 4890 sub problems to find dead transitions.
[2025-05-31 07:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3840/9840 variables, and 0 constraints, problems are : Problem set: 0 solved, 4890 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3870 constraints, PredecessorRefiner: 4890/4890 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4890 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3840/9840 variables, and 0 constraints, problems are : Problem set: 0 solved, 4890 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3870 constraints, PredecessorRefiner: 0/4890 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62346ms problems are : Problem set: 0 solved, 4890 unsolved
Search for dead transitions found 0 dead transitions in 62353ms
Starting structural reductions in LTL mode, iteration 1 : 3870/3960 places, 5970/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65181 ms. Remains : 3870/3960 places, 5970/6060 transitions.
[2025-05-31 07:11:04] [INFO ] Flatten gal took : 87 ms
[2025-05-31 07:11:05] [INFO ] Flatten gal took : 105 ms
[2025-05-31 07:11:05] [INFO ] Input system was already deterministic with 5970 transitions.
[2025-05-31 07:11:05] [INFO ] Flatten gal took : 99 ms
[2025-05-31 07:11:05] [INFO ] Flatten gal took : 103 ms
[2025-05-31 07:11:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12815207013008904553.gal : 17 ms
[2025-05-31 07:11:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1755242578581626794.ctl : 10 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12815207013008904553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1755242578581626794.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 07:11:35] [INFO ] Flatten gal took : 97 ms
[2025-05-31 07:11:35] [INFO ] Applying decomposition
[2025-05-31 07:11:35] [INFO ] Flatten gal took : 101 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/graph2298160322181652288.txt' '-o' '/tmp/graph2298160322181652288.bin' '-w' '/tmp/graph2298160322181652288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2298160322181652288.bin' '-l' '-1' '-v' '-w' '/tmp/graph2298160322181652288.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:11:36] [INFO ] Decomposing Gal with order
[2025-05-31 07:11:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:11:36] [INFO ] Removed a total of 473 redundant transitions.
[2025-05-31 07:11:36] [INFO ] Flatten gal took : 187 ms
[2025-05-31 07:11:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-05-31 07:11:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16249005141095268698.gal : 26 ms
[2025-05-31 07:11:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6764866961158279722.ctl : 14 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16249005141095268698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6764866961158279722.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.07822e+63,2.39886,43952,1107,75,22157,3088,3270,21619,284,2462,0


Converting to forward existential form...Done !
original formula: E(E(!(((((((((((((i19.i0.u73.TrainState_20_1_5==1)||(i28.i0.u74.TrainState_21_1_8==1))||((i5.i0.u139.TrainState_18_2_6==1)||(i21.i1.u157....309377
=> equivalent forward existential formula: [(FwdU(Init,E(!(((((((((((((i19.i0.u73.TrainState_20_1_5==1)||(i28.i0.u74.TrainState_21_1_8==1))||((i5.i0.u139.T...309435
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,5.69068,109232,1,0,132286,221530,36660,209292,2316,280846,240460
FORMULA BART-PT-030-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 13 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2025-05-31 07:11:45] [INFO ] Computed 30 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:11:46] [INFO ] Implicit Places using invariants in 653 ms returned []
[2025-05-31 07:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:11:49] [INFO ] Implicit Places using invariants and state equation in 2478 ms returned []
Implicit Place search using SMT with State Equation took 3135 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2025-05-31 07:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30060 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30060 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62389ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 62397ms
Finished structural reductions in LTL mode , in 1 iterations and 65555 ms. Remains : 3960/3960 places, 6060/6060 transitions.
[2025-05-31 07:12:51] [INFO ] Flatten gal took : 116 ms
[2025-05-31 07:12:51] [INFO ] Flatten gal took : 151 ms
[2025-05-31 07:12:52] [INFO ] Input system was already deterministic with 6060 transitions.
[2025-05-31 07:12:52] [INFO ] Flatten gal took : 146 ms
[2025-05-31 07:12:52] [INFO ] Flatten gal took : 150 ms
[2025-05-31 07:12:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10015604035737048120.gal : 17 ms
[2025-05-31 07:12:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11660136617167778110.ctl : 27 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10015604035737048120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11660136617167778110.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 07:13:22] [INFO ] Flatten gal took : 148 ms
[2025-05-31 07:13:22] [INFO ] Applying decomposition
[2025-05-31 07:13:22] [INFO ] Flatten gal took : 154 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/graph4057574229530272566.txt' '-o' '/tmp/graph4057574229530272566.bin' '-w' '/tmp/graph4057574229530272566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4057574229530272566.bin' '-l' '-1' '-v' '-w' '/tmp/graph4057574229530272566.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:13:23] [INFO ] Decomposing Gal with order
[2025-05-31 07:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:13:24] [INFO ] Removed a total of 616 redundant transitions.
[2025-05-31 07:13:24] [INFO ] Flatten gal took : 272 ms
[2025-05-31 07:13:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 15 ms.
[2025-05-31 07:13:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17385842406154940231.gal : 26 ms
[2025-05-31 07:13:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7030534910093251900.ctl : 47 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17385842406154940231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7030534910093251900.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14207e+63,2.52706,45772,1193,75,28105,3385,3715,27867,281,3089,0


Converting to forward existential form...Done !
original formula: A(A(!(((AG(((((((((((((i4.i0.u75.TrainState_10_0_0==1)||(i27.i10.u1312.TrainState_29_0_0==1))||((i3.i0.u73.TrainState_5_0_0==1)||(i1.i0.u...870562
=> equivalent forward existential formula: [((Init * !(EG(!(((EG(EX(((!((((((i23.i0.u11.TrainState_1_1_1==1)||(i1.i0.u12.TrainState_2_1_1==1))||((i9.i0.u13...3402033
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,27.3844,407808,1,0,711129,267654,48853,2.13662e+06,2799,334646,850378
FORMULA BART-PT-030-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6053 edges and 3960 vertex of which 3944 / 3960 are part of one of the 30 SCC in 8 ms
Free SCC test removed 3914 places
Ensure Unique test removed 6008 transitions
Reduce isomorphic transitions removed 6008 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 18 transition count 15
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 50 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 7 transition count 11
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 6 transition count 10
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 5 transition count 9
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 60 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 60 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 4 transition count 5
Applied a total of 62 rules in 25 ms. Remains 4 /3960 variables (removed 3956) and now considering 5/6060 (removed 6055) transitions.
// Phase 1: matrix 5 rows 4 cols
[2025-05-31 07:14:00] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:14:00] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-05-31 07:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:14:00] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:14:00] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-05-31 07:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/3960 places, 5/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 121 ms. Remains : 4/3960 places, 5/6060 transitions.
[2025-05-31 07:14:00] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:14:00] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:14:00] [INFO ] Input system was already deterministic with 5 transitions.
[2025-05-31 07:14:00] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:14:00] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16652901582424040826.gal : 0 ms
[2025-05-31 07:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14779132435979058838.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16652901582424040826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14779132435979058838.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.001639,3660,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: AF(EG(((TrainState_27_1_38==0)&&(TrainState_24_4_20==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((TrainState_27_1_38==0)&&(TrainState_24_4_20==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.00278,3916,1,0,9,56,21,6,86,55,14
FORMULA BART-PT-030-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4046 place count 1892 transition count 3992
Iterating global reduction 0 with 90 rules applied. Total rules applied 4136 place count 1892 transition count 3992
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4226 place count 1802 transition count 3902
Iterating global reduction 0 with 90 rules applied. Total rules applied 4316 place count 1802 transition count 3902
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4406 place count 1712 transition count 3812
Iterating global reduction 0 with 90 rules applied. Total rules applied 4496 place count 1712 transition count 3812
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4586 place count 1622 transition count 3722
Iterating global reduction 0 with 90 rules applied. Total rules applied 4676 place count 1622 transition count 3722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4736 place count 1562 transition count 3662
Iterating global reduction 0 with 60 rules applied. Total rules applied 4796 place count 1562 transition count 3662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4856 place count 1502 transition count 3602
Iterating global reduction 0 with 60 rules applied. Total rules applied 4916 place count 1502 transition count 3602
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4946 place count 1472 transition count 3572
Iterating global reduction 0 with 30 rules applied. Total rules applied 4976 place count 1472 transition count 3572
Applied a total of 4976 rules in 1242 ms. Remains 1472 /3960 variables (removed 2488) and now considering 3572/6060 (removed 2488) transitions.
// Phase 1: matrix 3572 rows 1472 cols
[2025-05-31 07:14:02] [INFO ] Computed 30 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:14:02] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-05-31 07:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:14:03] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
Running 2492 sub problems to find dead transitions.
[2025-05-31 07:14:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/5044 variables, and 0 constraints, problems are : Problem set: 0 solved, 2492 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1472 constraints, PredecessorRefiner: 2492/2492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2492 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/5044 variables, and 0 constraints, problems are : Problem set: 0 solved, 2492 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1472 constraints, PredecessorRefiner: 0/2492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60880ms problems are : Problem set: 0 solved, 2492 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Starting structural reductions in LTL mode, iteration 1 : 1472/3960 places, 3572/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63166 ms. Remains : 1472/3960 places, 3572/6060 transitions.
[2025-05-31 07:15:04] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:15:04] [INFO ] Flatten gal took : 39 ms
[2025-05-31 07:15:04] [INFO ] Input system was already deterministic with 3572 transitions.
[2025-05-31 07:15:04] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:15:04] [INFO ] Flatten gal took : 39 ms
[2025-05-31 07:15:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16296884899540548742.gal : 8 ms
[2025-05-31 07:15:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1361951681249958825.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16296884899540548742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1361951681249958825.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.28757e+50,3.12988,40980,2,2915,5,23077,6,0,9463,12441,0


Converting to forward existential form...Done !
original formula: EX((EG((TrainState_1_1_28==0)) * ((TrainState_5_3_33==0)||(TrainState_7_1_6==0))))
=> equivalent forward existential formula: [FwdG((EY(Init) * ((TrainState_5_3_33==0)||(TrainState_7_1_6==0))),(TrainState_1_1_28==0))] != FALSE
Hit Full ! (commute/partial/dont) 3568/0/4
(forward)formula 0,1,19.5925,376528,1,0,9,2.18218e+06,20,2,39305,55457,10
FORMULA BART-PT-030-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4046 place count 1892 transition count 3992
Iterating global reduction 0 with 90 rules applied. Total rules applied 4136 place count 1892 transition count 3992
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4226 place count 1802 transition count 3902
Iterating global reduction 0 with 90 rules applied. Total rules applied 4316 place count 1802 transition count 3902
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4406 place count 1712 transition count 3812
Iterating global reduction 0 with 90 rules applied. Total rules applied 4496 place count 1712 transition count 3812
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4586 place count 1622 transition count 3722
Iterating global reduction 0 with 90 rules applied. Total rules applied 4676 place count 1622 transition count 3722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4736 place count 1562 transition count 3662
Iterating global reduction 0 with 60 rules applied. Total rules applied 4796 place count 1562 transition count 3662
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4855 place count 1503 transition count 3603
Iterating global reduction 0 with 59 rules applied. Total rules applied 4914 place count 1503 transition count 3603
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4944 place count 1473 transition count 3573
Iterating global reduction 0 with 30 rules applied. Total rules applied 4974 place count 1473 transition count 3573
Applied a total of 4974 rules in 762 ms. Remains 1473 /3960 variables (removed 2487) and now considering 3573/6060 (removed 2487) transitions.
// Phase 1: matrix 3573 rows 1473 cols
[2025-05-31 07:15:24] [INFO ] Computed 30 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:15:24] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-31 07:15:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:15:25] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
Running 2493 sub problems to find dead transitions.
[2025-05-31 07:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1443/5046 variables, and 0 constraints, problems are : Problem set: 0 solved, 2493 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1473 constraints, PredecessorRefiner: 2493/2493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2493 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1443/5046 variables, and 0 constraints, problems are : Problem set: 0 solved, 2493 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1473 constraints, PredecessorRefiner: 0/2493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60880ms problems are : Problem set: 0 solved, 2493 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Starting structural reductions in LTL mode, iteration 1 : 1473/3960 places, 3573/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62673 ms. Remains : 1473/3960 places, 3573/6060 transitions.
[2025-05-31 07:16:26] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:16:26] [INFO ] Flatten gal took : 41 ms
[2025-05-31 07:16:26] [INFO ] Input system was already deterministic with 3573 transitions.
[2025-05-31 07:16:26] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:16:26] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:16:26] [INFO ] Time to serialize gal into /tmp/CTLFireability4626435248382977595.gal : 9 ms
[2025-05-31 07:16:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12571544110635089434.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4626435248382977595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12571544110635089434.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.39125e+50,3.13898,40988,2,3108,5,25696,6,0,9468,13606,0


Converting to forward existential form...Done !
original formula: E(!(EG(!(AX(((TrainState_14_1_20==1)||(TrainState_26_0_0==1)))))) U AF((TrainState_14_4_33==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(!(EX(!(((TrainState_14_1_20==1)||(TrainState_26_0_0==1))))))))) * !(EG(!((TrainState_14_4_33=...172
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,20.082,362184,1,0,11,2.31103e+06,30,4,39324,78505,12
FORMULA BART-PT-030-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 958 places :
Symmetric choice reduction at 0 with 958 rule applications. Total rules 958 place count 3002 transition count 5102
Iterating global reduction 0 with 958 rules applied. Total rules applied 1916 place count 3002 transition count 5102
Discarding 804 places :
Symmetric choice reduction at 0 with 804 rule applications. Total rules 2720 place count 2198 transition count 4298
Iterating global reduction 0 with 804 rules applied. Total rules applied 3524 place count 2198 transition count 4298
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 3643 place count 2079 transition count 4179
Iterating global reduction 0 with 119 rules applied. Total rules applied 3762 place count 2079 transition count 4179
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3851 place count 1990 transition count 4090
Iterating global reduction 0 with 89 rules applied. Total rules applied 3940 place count 1990 transition count 4090
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4029 place count 1901 transition count 4001
Iterating global reduction 0 with 89 rules applied. Total rules applied 4118 place count 1901 transition count 4001
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4207 place count 1812 transition count 3912
Iterating global reduction 0 with 89 rules applied. Total rules applied 4296 place count 1812 transition count 3912
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4385 place count 1723 transition count 3823
Iterating global reduction 0 with 89 rules applied. Total rules applied 4474 place count 1723 transition count 3823
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4563 place count 1634 transition count 3734
Iterating global reduction 0 with 89 rules applied. Total rules applied 4652 place count 1634 transition count 3734
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4711 place count 1575 transition count 3675
Iterating global reduction 0 with 59 rules applied. Total rules applied 4770 place count 1575 transition count 3675
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4829 place count 1516 transition count 3616
Iterating global reduction 0 with 59 rules applied. Total rules applied 4888 place count 1516 transition count 3616
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4918 place count 1486 transition count 3586
Iterating global reduction 0 with 30 rules applied. Total rules applied 4948 place count 1486 transition count 3586
Applied a total of 4948 rules in 772 ms. Remains 1486 /3960 variables (removed 2474) and now considering 3586/6060 (removed 2474) transitions.
// Phase 1: matrix 3586 rows 1486 cols
[2025-05-31 07:16:47] [INFO ] Computed 30 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:16:48] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-05-31 07:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:16:48] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Running 2506 sub problems to find dead transitions.
[2025-05-31 07:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1456/5072 variables, and 0 constraints, problems are : Problem set: 0 solved, 2506 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1486 constraints, PredecessorRefiner: 2506/2506 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2506 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1456/5072 variables, and 0 constraints, problems are : Problem set: 0 solved, 2506 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1486 constraints, PredecessorRefiner: 0/2506 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60823ms problems are : Problem set: 0 solved, 2506 unsolved
Search for dead transitions found 0 dead transitions in 60826ms
Starting structural reductions in LTL mode, iteration 1 : 1486/3960 places, 3586/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62637 ms. Remains : 1486/3960 places, 3586/6060 transitions.
[2025-05-31 07:17:49] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:17:49] [INFO ] Flatten gal took : 43 ms
[2025-05-31 07:17:49] [INFO ] Input system was already deterministic with 3586 transitions.
[2025-05-31 07:17:49] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:17:50] [INFO ] Flatten gal took : 39 ms
[2025-05-31 07:17:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1889857035799235472.gal : 9 ms
[2025-05-31 07:17:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16868102127218218703.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1889857035799235472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16868102127218218703.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.90253e+50,3.36441,41316,2,3124,5,26114,6,0,9533,13971,0


Converting to forward existential form...Done !
original formula: (EF(((AX((TrainState_4_2_15==1)) * AG(((TrainState_23_2_18==1)||(TrainState_20_2_19==1)))) * (((((TrainState_30_3_7==1)||(TrainState_26_2...329
=> equivalent forward existential formula: [(EY(FwdU((Init * !(E(TRUE U ((!(EX(!((TrainState_4_2_15==1)))) * !(E(TRUE U !(((TrainState_23_2_18==1)||(TrainS...410
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,29.21,398904,1,0,10,2.37159e+06,21,3,42533,37622,10
FORMULA BART-PT-030-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6051 edges and 3960 vertex of which 3950 / 3960 are part of one of the 30 SCC in 5 ms
Free SCC test removed 3920 places
Ensure Unique test removed 6015 transitions
Reduce isomorphic transitions removed 6015 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 13 transition count 16
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 10 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 8 transition count 13
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 8 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 42 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 42 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 46 place count 6 transition count 7
Applied a total of 46 rules in 14 ms. Remains 6 /3960 variables (removed 3954) and now considering 7/6060 (removed 6053) transitions.
// Phase 1: matrix 7 rows 6 cols
[2025-05-31 07:18:19] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-31 07:18:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:19] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:18:19] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-05-31 07:18:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/3960 places, 7/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 6/3960 places, 7/6060 transitions.
[2025-05-31 07:18:19] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:18:19] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:18:19] [INFO ] Input system was already deterministic with 7 transitions.
[2025-05-31 07:18:19] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:18:19] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:18:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16068823166032572212.gal : 0 ms
[2025-05-31 07:18:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16189277014770042450.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16068823166032572212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16189277014770042450.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8,0.001728,3660,2,10,5,38,5,0,32,22,0


Converting to forward existential form...Done !
original formula: AF(!(E(!(EG(E((TrainState_6_1_9==1) U (TrainState_3_3_32==1)))) U (TrainState_14_4_27==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!(EG(E((TrainState_6_1_9==1) U (TrainState_3_3_32==1)))) U (TrainState_14_4_27==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/3
Using saturation style SCC detection
(forward)formula 0,0,0.003455,4044,1,0,16,144,31,12,139,170,25
FORMULA BART-PT-030-CTLFireability-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2729 place count 2191 transition count 4291
Iterating global reduction 0 with 809 rules applied. Total rules applied 3538 place count 2191 transition count 4291
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3658 place count 2071 transition count 4171
Iterating global reduction 0 with 120 rules applied. Total rules applied 3778 place count 2071 transition count 4171
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3868 place count 1981 transition count 4081
Iterating global reduction 0 with 90 rules applied. Total rules applied 3958 place count 1981 transition count 4081
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4048 place count 1891 transition count 3991
Iterating global reduction 0 with 90 rules applied. Total rules applied 4138 place count 1891 transition count 3991
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4228 place count 1801 transition count 3901
Iterating global reduction 0 with 90 rules applied. Total rules applied 4318 place count 1801 transition count 3901
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4408 place count 1711 transition count 3811
Iterating global reduction 0 with 90 rules applied. Total rules applied 4498 place count 1711 transition count 3811
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4588 place count 1621 transition count 3721
Iterating global reduction 0 with 90 rules applied. Total rules applied 4678 place count 1621 transition count 3721
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4738 place count 1561 transition count 3661
Iterating global reduction 0 with 60 rules applied. Total rules applied 4798 place count 1561 transition count 3661
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4858 place count 1501 transition count 3601
Iterating global reduction 0 with 60 rules applied. Total rules applied 4918 place count 1501 transition count 3601
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4948 place count 1471 transition count 3571
Iterating global reduction 0 with 30 rules applied. Total rules applied 4978 place count 1471 transition count 3571
Applied a total of 4978 rules in 736 ms. Remains 1471 /3960 variables (removed 2489) and now considering 3571/6060 (removed 2489) transitions.
// Phase 1: matrix 3571 rows 1471 cols
[2025-05-31 07:18:20] [INFO ] Computed 30 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:20] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-31 07:18:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:18:21] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Running 2491 sub problems to find dead transitions.
[2025-05-31 07:18:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1441/5042 variables, and 0 constraints, problems are : Problem set: 0 solved, 2491 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1471 constraints, PredecessorRefiner: 2491/2491 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2491 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1441/5042 variables, and 0 constraints, problems are : Problem set: 0 solved, 2491 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1471 constraints, PredecessorRefiner: 0/2491 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60834ms problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 60839ms
Starting structural reductions in LTL mode, iteration 1 : 1471/3960 places, 3571/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62590 ms. Remains : 1471/3960 places, 3571/6060 transitions.
[2025-05-31 07:19:22] [INFO ] Flatten gal took : 37 ms
[2025-05-31 07:19:22] [INFO ] Flatten gal took : 39 ms
[2025-05-31 07:19:22] [INFO ] Input system was already deterministic with 3571 transitions.
[2025-05-31 07:19:22] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:19:22] [INFO ] Flatten gal took : 39 ms
[2025-05-31 07:19:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3584388018767018417.gal : 8 ms
[2025-05-31 07:19:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10294189624403757499.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3584388018767018417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10294189624403757499.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.1839e+50,3.10058,40848,2,2920,5,23039,6,0,9458,12422,0


Converting to forward existential form...Done !
original formula: EX(((AF(AX((TrainState_8_1_25==1))) * EF((TrainState_13_1_10==0))) * (TrainState_30_2_22==0)))
=> equivalent forward existential formula: [(FwdU(((EY(Init) * (TrainState_30_2_22==0)) * !(EG(!(!(EX(!((TrainState_8_1_25==1)))))))),TRUE) * (TrainState_1...176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,17.321,351100,1,0,8,2.16546e+06,18,0,36395,27707,8
FORMULA BART-PT-030-CTLFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6050 edges and 3960 vertex of which 3955 / 3960 are part of one of the 30 SCC in 5 ms
Free SCC test removed 3925 places
Ensure Unique test removed 6022 transitions
Reduce isomorphic transitions removed 6022 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 6 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 6 transition count 7
Applied a total of 34 rules in 15 ms. Remains 6 /3960 variables (removed 3954) and now considering 7/6060 (removed 6053) transitions.
// Phase 1: matrix 7 rows 6 cols
[2025-05-31 07:19:39] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-05-31 07:19:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:39] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:19:39] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-05-31 07:19:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/12 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 15 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Domain max(s): 6/6 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/12 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/12 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 18 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Domain max(s): 6/6 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/3960 places, 7/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 143 ms. Remains : 6/3960 places, 7/6060 transitions.
[2025-05-31 07:19:39] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:19:39] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:19:39] [INFO ] Input system was already deterministic with 7 transitions.
[2025-05-31 07:19:39] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:19:39] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:19:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6772931461706566215.gal : 0 ms
[2025-05-31 07:19:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17904486697601040039.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6772931461706566215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17904486697601040039.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8,0.002324,3660,2,10,5,38,5,0,32,22,0


Converting to forward existential form...Done !
original formula: AF((EG((TrainState_28_1_8==0)) * ((TrainState_21_1_8==1)||(TrainState_20_2_39==0))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((TrainState_28_1_8==0)) * ((TrainState_21_1_8==1)||(TrainState_20_2_39==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.003583,3916,1,0,9,86,22,3,125,44,7
FORMULA BART-PT-030-CTLFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 957 places :
Symmetric choice reduction at 0 with 957 rule applications. Total rules 957 place count 3003 transition count 5103
Iterating global reduction 0 with 957 rules applied. Total rules applied 1914 place count 3003 transition count 5103
Discarding 807 places :
Symmetric choice reduction at 0 with 807 rule applications. Total rules 2721 place count 2196 transition count 4296
Iterating global reduction 0 with 807 rules applied. Total rules applied 3528 place count 2196 transition count 4296
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3648 place count 2076 transition count 4176
Iterating global reduction 0 with 120 rules applied. Total rules applied 3768 place count 2076 transition count 4176
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3858 place count 1986 transition count 4086
Iterating global reduction 0 with 90 rules applied. Total rules applied 3948 place count 1986 transition count 4086
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4037 place count 1897 transition count 3997
Iterating global reduction 0 with 89 rules applied. Total rules applied 4126 place count 1897 transition count 3997
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4215 place count 1808 transition count 3908
Iterating global reduction 0 with 89 rules applied. Total rules applied 4304 place count 1808 transition count 3908
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4393 place count 1719 transition count 3819
Iterating global reduction 0 with 89 rules applied. Total rules applied 4482 place count 1719 transition count 3819
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4571 place count 1630 transition count 3730
Iterating global reduction 0 with 89 rules applied. Total rules applied 4660 place count 1630 transition count 3730
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4720 place count 1570 transition count 3670
Iterating global reduction 0 with 60 rules applied. Total rules applied 4780 place count 1570 transition count 3670
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 4838 place count 1512 transition count 3612
Iterating global reduction 0 with 58 rules applied. Total rules applied 4896 place count 1512 transition count 3612
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4926 place count 1482 transition count 3582
Iterating global reduction 0 with 30 rules applied. Total rules applied 4956 place count 1482 transition count 3582
Applied a total of 4956 rules in 746 ms. Remains 1482 /3960 variables (removed 2478) and now considering 3582/6060 (removed 2478) transitions.
// Phase 1: matrix 3582 rows 1482 cols
[2025-05-31 07:19:40] [INFO ] Computed 30 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:40] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-31 07:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:41] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
Running 2502 sub problems to find dead transitions.
[2025-05-31 07:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1452/5064 variables, and 0 constraints, problems are : Problem set: 0 solved, 2502 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1482 constraints, PredecessorRefiner: 2502/2502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2502 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/5064 variables, and 0 constraints, problems are : Problem set: 0 solved, 2502 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1482 constraints, PredecessorRefiner: 0/2502 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60826ms problems are : Problem set: 0 solved, 2502 unsolved
Search for dead transitions found 0 dead transitions in 60831ms
Starting structural reductions in LTL mode, iteration 1 : 1482/3960 places, 3582/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62590 ms. Remains : 1482/3960 places, 3582/6060 transitions.
[2025-05-31 07:20:42] [INFO ] Flatten gal took : 37 ms
[2025-05-31 07:20:42] [INFO ] Flatten gal took : 39 ms
[2025-05-31 07:20:42] [INFO ] Input system was already deterministic with 3582 transitions.
[2025-05-31 07:20:42] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:20:42] [INFO ] Flatten gal took : 38 ms
[2025-05-31 07:20:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1889097426044949872.gal : 9 ms
[2025-05-31 07:20:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14825804533127950568.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1889097426044949872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14825804533127950568.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.4219e+50,3.26126,41168,2,2935,5,23341,6,0,9513,12660,0


Converting to forward existential form...Done !
original formula: A((AX(EX(!(A((TrainState_30_4_34==1) U (TrainState_10_4_34==1))))) * E((TrainState_5_4_19==1) U !(AG((TrainState_25_0_0==1))))) U EX(!(AF...182
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(!(EG(!((TrainState_27_0_0!=1)))))))))) * !(E(!(EX(!(!(EG(!((TrainState_27_0_0!=1))))))) U ...436
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 3580/0/2
Hit Full ! (commute/partial/dont) 3580/0/2
Using saturation style SCC detection
(forward)formula 0,1,26.9368,413384,1,0,13,2.25828e+06,50,4,45144,73453,20
FORMULA BART-PT-030-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 07:21:10] [INFO ] Flatten gal took : 165 ms
[2025-05-31 07:21:10] [INFO ] Flatten gal took : 155 ms
[2025-05-31 07:21:10] [INFO ] Applying decomposition
[2025-05-31 07:21:10] [INFO ] Flatten gal took : 157 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/graph11712004590278733320.txt' '-o' '/tmp/graph11712004590278733320.bin' '-w' '/tmp/graph11712004590278733320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11712004590278733320.bin' '-l' '-1' '-v' '-w' '/tmp/graph11712004590278733320.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:21:11] [INFO ] Decomposing Gal with order
[2025-05-31 07:21:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:21:12] [INFO ] Removed a total of 515 redundant transitions.
[2025-05-31 07:21:12] [INFO ] Flatten gal took : 270 ms
[2025-05-31 07:21:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2025-05-31 07:21:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5055042154724152511.gal : 26 ms
[2025-05-31 07:21:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15087213796879593216.ctl : 48 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5055042154724152511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15087213796879593216.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14207e+63,2.54633,45400,1199,75,22787,3523,3609,21558,296,3234,0


Converting to forward existential form...Done !
original formula: (A((AX(!(((((((((((i20.i4.u20.TrainState_17_2_4==1)||(i18.i0.u112.TrainState_2_3_7==1))||((i8.i0.u187.TrainState_15_3_8==1)||(i3.i2.u178....263683
=> equivalent forward existential formula: ([((Init * !(EG(!(E(!(EG(!(EG((((((((((((((i23.i7.u746.TrainState_8_2_26==1)||(i25.i0.u349.TrainState_19_2_16==1...488319
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,160.293,1901776,1,0,3.52293e+06,826121,45445,1.06951e+07,2305,2.3288e+06,1036805
FORMULA BART-PT-030-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG((((((((((((AF(((((((i4.u11.TrainState_1_1_1==1)||(i18.i0.u12.TrainState_2_1_1==1))||((i7.i0.u0.TrainState_3_1_1==1)||(i0.i0.u13.TrainS...78413
=> equivalent forward existential formula: [FwdG(Init,(((((((((((!(EG(!(((((((i4.u11.TrainState_1_1_1==1)||(i18.i0.u12.TrainState_2_1_1==1))||((i7.i0.u0.Tr...78462
(forward)formula 1,1,160.685,1909584,1,0,3.5312e+06,831038,55727,1.07117e+07,3486,2.34261e+06,1048063
FORMULA BART-PT-030-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (E(EX(((((((((((((i15.i0.u81.TrainState_20_1_5==1)||(i29.i12.u1280.TrainState_21_1_8==1))||((i14.i0.u92.TrainState_18_2_6==1)||(i0.i0.u15...370884
=> equivalent forward existential formula: [((FwdU((Init * E(EX(((((((((((((i15.i0.u81.TrainState_20_1_5==1)||(i29.i12.u1280.TrainState_21_1_8==1))||((i14....373124
(forward)formula 2,1,204.267,2208080,1,0,4.09757e+06,876015,12582,1.26605e+07,889,2.47696e+06,1717029
FORMULA BART-PT-030-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(E(AX(((((((((((((AF(((((((((((((i15.i0.u81.TrainState_20_1_5==1)||(i29.i12.u1280.TrainState_21_1_8==1))||((i14.i0.u92.TrainState_18_2_...370018
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX(!(((((((((((((!(EG(!(((((((((((((i15.i0.u81.TrainState_20_1_5==1)||(i29.i12.u1280.T...524763
(forward)formula 3,1,388.369,2457180,1,0,4.63328e+06,1.01747e+06,29425,1.65779e+07,1839,3.03505e+06,903373
FORMULA BART-PT-030-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1686802 ms.

BK_STOP 1748676472343

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -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="BART-PT-030"
export BK_EXAMINATION="CTLFireability"
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 BART-PT-030, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853730100858"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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