Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 538K 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 AutoFlight-PT-24b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748634881896

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 19:54:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 19:54:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 19:54:43] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2025-05-30 19:54:43] [INFO ] Transformed 2230 places.
[2025-05-30 19:54:43] [INFO ] Transformed 2228 transitions.
[2025-05-30 19:54:43] [INFO ] Found NUPN structural information;
[2025-05-30 19:54:43] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-24b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 304 places :
Symmetric choice reduction at 0 with 304 rule applications. Total rules 304 place count 1926 transition count 1924
Iterating global reduction 0 with 304 rules applied. Total rules applied 608 place count 1926 transition count 1924
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 655 place count 1926 transition count 1877
Discarding 137 places :
Symmetric choice reduction at 1 with 137 rule applications. Total rules 792 place count 1789 transition count 1740
Iterating global reduction 1 with 137 rules applied. Total rules applied 929 place count 1789 transition count 1740
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 953 place count 1765 transition count 1716
Iterating global reduction 1 with 24 rules applied. Total rules applied 977 place count 1765 transition count 1716
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 996 place count 1746 transition count 1697
Iterating global reduction 1 with 19 rules applied. Total rules applied 1015 place count 1746 transition count 1697
Applied a total of 1015 rules in 928 ms. Remains 1746 /2230 variables (removed 484) and now considering 1697/2228 (removed 531) transitions.
// Phase 1: matrix 1697 rows 1746 cols
[2025-05-30 19:54:45] [INFO ] Computed 148 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:54:46] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2025-05-30 19:54:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:54:48] [INFO ] Implicit Places using invariants and state equation in 2672 ms returned []
Implicit Place search using SMT with State Equation took 3740 ms to find 0 implicit places.
Running 1696 sub problems to find dead transitions.
[2025-05-30 19:54: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 1745/3443 variables, and 0 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1746 constraints, PredecessorRefiner: 1696/1696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1696 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(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 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/3443 variables, and 0 constraints, problems are : Problem set: 0 solved, 1696 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1746 constraints, PredecessorRefiner: 0/1696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60508ms problems are : Problem set: 0 solved, 1696 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in LTL mode, iteration 1 : 1746/2230 places, 1697/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65250 ms. Remains : 1746/2230 places, 1697/2228 transitions.
Support contains 34 out of 1746 places after structural reductions.
[2025-05-30 19:55:49] [INFO ] Flatten gal took : 125 ms
[2025-05-30 19:55:49] [INFO ] Flatten gal took : 70 ms
[2025-05-30 19:55:49] [INFO ] Input system was already deterministic with 1697 transitions.
Support contains 32 out of 1746 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (36 resets) in 1359 ms. (29 steps per ms) remains 8/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
[2025-05-30 19:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 812/825 variables, 69/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/825 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 801/1626 variables, 78/147 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1626 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 120/1746 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1746 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1697/3443 variables, 1746/1894 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:55:52] [INFO ] Deduced a trap composed of 65 places in 552 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:55:53] [INFO ] Deduced a trap composed of 66 places in 581 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:55:54] [INFO ] Deduced a trap composed of 67 places in 537 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:55:54] [INFO ] Deduced a trap composed of 68 places in 529 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:55:55] [INFO ] Deduced a trap composed of 69 places in 495 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:55:55] [INFO ] Deduced a trap composed of 71 places in 485 ms of which 89 ms to minimize.
SMT process timed out in 5030ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 1746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 624 transitions
Trivial Post-agglo rules discarded 624 transitions
Performed 624 trivial Post agglomeration. Transition count delta: 624
Iterating post reduction 0 with 624 rules applied. Total rules applied 624 place count 1746 transition count 1073
Reduce places removed 624 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 698 rules applied. Total rules applied 1322 place count 1122 transition count 999
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 1372 place count 1074 transition count 997
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1374 place count 1072 transition count 997
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1374 place count 1072 transition count 798
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1772 place count 873 transition count 798
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1779 place count 866 transition count 791
Iterating global reduction 4 with 7 rules applied. Total rules applied 1786 place count 866 transition count 791
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1786 place count 866 transition count 788
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1792 place count 863 transition count 788
Performed 339 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2470 place count 524 transition count 402
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 94 times.
Iterating global reduction 4 with 94 rules applied. Total rules applied 2564 place count 524 transition count 308
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 4 with 94 rules applied. Total rules applied 2658 place count 430 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2659 place count 429 transition count 307
Reduce places removed 54 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 5 with 88 rules applied. Total rules applied 2747 place count 375 transition count 273
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 35 rules applied. Total rules applied 2782 place count 341 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2783 place count 340 transition count 272
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 29 Pre rules applied. Total rules applied 2783 place count 340 transition count 243
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 2841 place count 311 transition count 243
Applied a total of 2841 rules in 361 ms. Remains 311 /1746 variables (removed 1435) and now considering 243/1697 (removed 1454) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 311/1746 places, 243/1697 transitions.
RANDOM walk for 40000 steps (373 resets) in 724 ms. (55 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40001 steps (92 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (87 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (85 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (63 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (79 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
// Phase 1: matrix 243 rows 311 cols
[2025-05-30 19:55:56] [INFO ] Computed 94 invariants in 8 ms
[2025-05-30 19:55:56] [INFO ] State equation strengthened by 169 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 65/153 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 134/287 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 24/311 variables, 24/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 243/554 variables, 311/405 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 169/574 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:55:57] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:55:57] [INFO ] Deduced a trap composed of 151 places in 86 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/554 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 576 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 311/311 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 65/153 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 134/287 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 24/311 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 243/554 variables, 311/407 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 169/576 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 4/580 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/580 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/554 variables, 0/580 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 580 constraints, problems are : Problem set: 1 solved, 4 unsolved in 906 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 311/311 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2567ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 196 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=39 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 9 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 425 stabilizing places and 425 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1746 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1745 transition count 1069
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 701 rules applied. Total rules applied 1328 place count 1118 transition count 995
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 1378 place count 1070 transition count 993
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1380 place count 1068 transition count 993
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1380 place count 1068 transition count 793
Deduced a syphon composed of 200 places in 10 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1780 place count 868 transition count 793
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1792 place count 856 transition count 781
Iterating global reduction 4 with 12 rules applied. Total rules applied 1804 place count 856 transition count 781
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 1804 place count 856 transition count 774
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1818 place count 849 transition count 774
Performed 334 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 4 with 668 rules applied. Total rules applied 2486 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2487 place count 514 transition count 392
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2559 place count 466 transition count 368
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2583 place count 442 transition count 368
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2583 place count 442 transition count 344
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2631 place count 418 transition count 344
Applied a total of 2631 rules in 315 ms. Remains 418 /1746 variables (removed 1328) and now considering 344/1697 (removed 1353) transitions.
// Phase 1: matrix 344 rows 418 cols
[2025-05-30 19:55:59] [INFO ] Computed 100 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:56:00] [INFO ] Implicit Places using invariants in 382 ms returned [336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404, 408, 412, 417]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 387 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 397/1746 places, 344/1697 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 378 transition count 325
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 378 transition count 325
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 52 place count 371 transition count 318
Applied a total of 52 rules in 31 ms. Remains 371 /397 variables (removed 26) and now considering 318/344 (removed 26) transitions.
// Phase 1: matrix 318 rows 371 cols
[2025-05-30 19:56:00] [INFO ] Computed 79 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:56:00] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-05-30 19:56:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:56:01] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 371/1746 places, 318/1697 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1817 ms. Remains : 371/1746 places, 318/1697 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-00
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 5 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-00 finished in 2054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 5 out of 1746 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1735 transition count 1686
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1735 transition count 1686
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1730 transition count 1681
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1730 transition count 1681
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1728 transition count 1679
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1728 transition count 1679
Applied a total of 36 rules in 330 ms. Remains 1728 /1746 variables (removed 18) and now considering 1679/1697 (removed 18) transitions.
// Phase 1: matrix 1679 rows 1728 cols
[2025-05-30 19:56:01] [INFO ] Computed 148 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:56:02] [INFO ] Implicit Places using invariants in 800 ms returned []
[2025-05-30 19:56:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:56:05] [INFO ] Implicit Places using invariants and state equation in 2443 ms returned []
Implicit Place search using SMT with State Equation took 3245 ms to find 0 implicit places.
Running 1678 sub problems to find dead transitions.
[2025-05-30 19:56:05] [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 1727/3407 variables, and 0 constraints, problems are : Problem set: 0 solved, 1678 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1678/1678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1678 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 1727/3407 variables, and 0 constraints, problems are : Problem set: 0 solved, 1678 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 1678 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1746 places, 1679/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63956 ms. Remains : 1728/1746 places, 1679/1697 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 501 ms.
Product exploration explored 100000 steps with 50000 reset in 446 ms.
Computed a total of 416 stabilizing places and 416 stable transitions
Computed a total of 416 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 65193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 1746 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 631 transitions
Trivial Post-agglo rules discarded 631 transitions
Performed 631 trivial Post agglomeration. Transition count delta: 631
Iterating post reduction 0 with 631 rules applied. Total rules applied 631 place count 1745 transition count 1065
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 705 rules applied. Total rules applied 1336 place count 1114 transition count 991
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1384 place count 1066 transition count 991
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1384 place count 1066 transition count 792
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1782 place count 867 transition count 792
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1793 place count 856 transition count 781
Iterating global reduction 3 with 11 rules applied. Total rules applied 1804 place count 856 transition count 781
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1804 place count 856 transition count 774
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1818 place count 849 transition count 774
Performed 337 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 2492 place count 512 transition count 390
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2493 place count 511 transition count 389
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2565 place count 463 transition count 365
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2589 place count 439 transition count 365
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2589 place count 439 transition count 341
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2637 place count 415 transition count 341
Applied a total of 2637 rules in 138 ms. Remains 415 /1746 variables (removed 1331) and now considering 341/1697 (removed 1356) transitions.
// Phase 1: matrix 341 rows 415 cols
[2025-05-30 19:57:06] [INFO ] Computed 100 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:57:07] [INFO ] Implicit Places using invariants in 354 ms returned [169, 243, 317, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 381, 385, 389, 393, 397, 401, 405, 409, 414]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 356 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 388/1746 places, 341/1697 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 363 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 358 transition count 311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 357 transition count 310
Applied a total of 62 rules in 48 ms. Remains 357 /388 variables (removed 31) and now considering 310/341 (removed 31) transitions.
// Phase 1: matrix 310 rows 357 cols
[2025-05-30 19:57:07] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:57:07] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-05-30 19:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:57:08] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 357/1746 places, 310/1697 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1485 ms. Remains : 357/1746 places, 310/1697 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-04
Product exploration explored 100000 steps with 1273 reset in 417 ms.
Product exploration explored 100000 steps with 1258 reset in 414 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (500 resets) in 456 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 629588 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 4
Probabilistic random walk after 629588 steps, saw 83563 distinct states, run finished after 3005 ms. (steps per millisecond=209 ) properties seen :0
[2025-05-30 19:57:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 190/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 216/408 variables, 192/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 259/667 variables, 165/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 71/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/667 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 430 constraints, problems are : Problem set: 0 solved, 4 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 190/192 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 216/408 variables, 192/194 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 259/667 variables, 165/359 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 71/430 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 3/433 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 0/433 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/667 variables, 0/433 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 667/667 variables, and 433 constraints, problems are : Problem set: 1 solved, 3 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1220ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 223 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=55 )
Parikh walk visited 3 properties in 354 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLCardinality-04 finished in 7516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 4 out of 1746 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1734 transition count 1685
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1734 transition count 1684
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 1729 transition count 1679
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 1729 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1727 transition count 1677
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1727 transition count 1677
Applied a total of 39 rules in 326 ms. Remains 1727 /1746 variables (removed 19) and now considering 1677/1697 (removed 20) transitions.
// Phase 1: matrix 1677 rows 1727 cols
[2025-05-30 19:57:14] [INFO ] Computed 148 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:57:15] [INFO ] Implicit Places using invariants in 778 ms returned []
[2025-05-30 19:57:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:57:17] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 3193 ms to find 0 implicit places.
Running 1676 sub problems to find dead transitions.
[2025-05-30 19:57:17] [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 1726/3404 variables, and 0 constraints, problems are : Problem set: 0 solved, 1676 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1727 constraints, PredecessorRefiner: 1676/1676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1676 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 1726/3404 variables, and 0 constraints, problems are : Problem set: 0 solved, 1676 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1727 constraints, PredecessorRefiner: 0/1676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60384ms problems are : Problem set: 0 solved, 1676 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Starting structural reductions in LTL mode, iteration 1 : 1727/1746 places, 1677/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63918 ms. Remains : 1727/1746 places, 1677/1697 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 248 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-05 finished in 64104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1746 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1732 transition count 1683
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1732 transition count 1683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1732 transition count 1682
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 1726 transition count 1676
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 1726 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1724 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1724 transition count 1674
Applied a total of 45 rules in 301 ms. Remains 1724 /1746 variables (removed 22) and now considering 1674/1697 (removed 23) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2025-05-30 19:58:18] [INFO ] Computed 148 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:58:19] [INFO ] Implicit Places using invariants in 761 ms returned []
[2025-05-30 19:58:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:58:22] [INFO ] Implicit Places using invariants and state equation in 2642 ms returned []
Implicit Place search using SMT with State Equation took 3406 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2025-05-30 19:58:22] [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 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 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 1723/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1724 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60396ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Starting structural reductions in LTL mode, iteration 1 : 1724/1746 places, 1674/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64113 ms. Remains : 1724/1746 places, 1674/1697 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-09
Stuttering criterion allowed to conclude after 32179 steps with 155 reset in 88 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-09 finished in 64342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(X(p0))||G(!p1)) U X(p2)))))'
Support contains 5 out of 1746 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1733 transition count 1684
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1733 transition count 1684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1733 transition count 1683
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 1729 transition count 1679
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 1729 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1728 transition count 1678
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1728 transition count 1678
Applied a total of 37 rules in 305 ms. Remains 1728 /1746 variables (removed 18) and now considering 1678/1697 (removed 19) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2025-05-30 19:59:23] [INFO ] Computed 148 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:59:23] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-05-30 19:59:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:59:26] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 3380 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2025-05-30 19:59:26] [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 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 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 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Starting structural reductions in LTL mode, iteration 1 : 1728/1746 places, 1678/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64038 ms. Remains : 1728/1746 places, 1678/1697 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-10
Product exploration explored 100000 steps with 28509 reset in 308 ms.
Product exploration explored 100000 steps with 28638 reset in 300 ms.
Computed a total of 416 stabilizing places and 416 stable transitions
Computed a total of 416 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0), (AND p1 (NOT p0)), true, p1]
RANDOM walk for 40000 steps (36 resets) in 306 ms. (130 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
[2025-05-30 20:00:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 980/985 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/985 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 620/1605 variables, 50/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 123/1728 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1728 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1678/3406 variables, 1728/1876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3406 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/3406 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3406/3406 variables, and 1876 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1789 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1728/1728 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 980/985 variables, 97/97 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/985 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 620/1605 variables, 50/147 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:30] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 38 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 123/1728 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:31] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:31] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:32] [INFO ] Deduced a trap composed of 69 places in 382 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:32] [INFO ] Deduced a trap composed of 126 places in 447 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:33] [INFO ] Deduced a trap composed of 126 places in 424 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:33] [INFO ] Deduced a trap composed of 126 places in 414 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:34] [INFO ] Deduced a trap composed of 191 places in 358 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:34] [INFO ] Deduced a trap composed of 197 places in 349 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:34] [INFO ] Deduced a trap composed of 206 places in 353 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:00:35] [INFO ] Deduced a trap composed of 210 places in 341 ms of which 103 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/3406 variables, and 159 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6836ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 1728 transition count 1052
Reduce places removed 626 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 698 rules applied. Total rules applied 1324 place count 1102 transition count 980
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1372 place count 1054 transition count 980
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1372 place count 1054 transition count 781
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1770 place count 855 transition count 781
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1771 place count 854 transition count 780
Iterating global reduction 3 with 1 rules applied. Total rules applied 1772 place count 854 transition count 780
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1772 place count 854 transition count 779
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1774 place count 853 transition count 779
Performed 339 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 2452 place count 514 transition count 392
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2548 place count 514 transition count 296
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2644 place count 418 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2645 place count 417 transition count 295
Reduce places removed 59 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 4 with 107 rules applied. Total rules applied 2752 place count 358 transition count 247
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 2800 place count 310 transition count 247
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 2800 place count 310 transition count 217
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 2860 place count 280 transition count 217
Applied a total of 2860 rules in 118 ms. Remains 280 /1728 variables (removed 1448) and now considering 217/1678 (removed 1461) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 280/1728 places, 217/1678 transitions.
RANDOM walk for 40000 steps (184 resets) in 173 ms. (229 steps per ms) remains 1/3 properties
BEST_FIRST walk for 21926 steps (6 resets) in 41 ms. (522 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), true]
Support contains 3 out of 1728 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Applied a total of 0 rules in 76 ms. Remains 1728 /1728 variables (removed 0) and now considering 1678/1678 (removed 0) transitions.
[2025-05-30 20:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:00:36] [INFO ] Implicit Places using invariants in 768 ms returned []
[2025-05-30 20:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:00:39] [INFO ] Implicit Places using invariants and state equation in 2719 ms returned []
Implicit Place search using SMT with State Equation took 3501 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2025-05-30 20:00:39] [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 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 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 1727/3406 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1728 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60340ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Finished structural reductions in LTL mode , in 1 iterations and 63925 ms. Remains : 1728/1728 places, 1678/1678 transitions.
Computed a total of 416 stabilizing places and 416 stable transitions
Computed a total of 416 stabilizing places and 416 stable transitions
Knowledge obtained : [(AND p2 p0), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), true]
RANDOM walk for 40000 steps (36 resets) in 200 ms. (199 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2025-05-30 20:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1451/1605 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:40] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:41] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1605 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1605 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 123/1728 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:41] [INFO ] Deduced a trap composed of 17 places in 347 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:42] [INFO ] Deduced a trap composed of 19 places in 370 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:42] [INFO ] Deduced a trap composed of 21 places in 374 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:42] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:43] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:43] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:43] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:44] [INFO ] Deduced a trap composed of 41 places in 370 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:44] [INFO ] Deduced a trap composed of 45 places in 368 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:45] [INFO ] Deduced a trap composed of 55 places in 398 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:01:45] [INFO ] Deduced a trap composed of 57 places in 403 ms of which 73 ms to minimize.
SMT process timed out in 5212ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1728 transition count 1051
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 699 rules applied. Total rules applied 1326 place count 1101 transition count 979
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1374 place count 1053 transition count 979
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1374 place count 1053 transition count 780
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1772 place count 854 transition count 780
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1774 place count 852 transition count 778
Iterating global reduction 3 with 2 rules applied. Total rules applied 1776 place count 852 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1776 place count 852 transition count 777
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1778 place count 851 transition count 777
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2458 place count 511 transition count 389
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 96 times.
Iterating global reduction 3 with 96 rules applied. Total rules applied 2554 place count 511 transition count 293
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 2650 place count 415 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2651 place count 414 transition count 292
Reduce places removed 120 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 4 with 331 rules applied. Total rules applied 2982 place count 294 transition count 81
Reduce places removed 211 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 212 rules applied. Total rules applied 3194 place count 83 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3195 place count 82 transition count 80
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 3195 place count 82 transition count 54
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 3247 place count 56 transition count 54
Applied a total of 3247 rules in 117 ms. Remains 56 /1728 variables (removed 1672) and now considering 54/1678 (removed 1624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 56/1728 places, 54/1678 transitions.
RANDOM walk for 112 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), true]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), true]
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), true]
Product exploration explored 100000 steps with 25037 reset in 255 ms.
Product exploration explored 100000 steps with 25063 reset in 252 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), true]
Support contains 3 out of 1728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Performed 554 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 554 rules applied. Total rules applied 554 place count 1728 transition count 1678
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 602 place count 1728 transition count 1654
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 602 place count 1728 transition count 1654
Deduced a syphon composed of 800 places in 5 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 824 place count 1728 transition count 1654
Discarding 479 places :
Symmetric choice reduction at 2 with 479 rule applications. Total rules 1303 place count 1249 transition count 1175
Deduced a syphon composed of 322 places in 4 ms
Iterating global reduction 2 with 479 rules applied. Total rules applied 1782 place count 1249 transition count 1175
Performed 412 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 734 places in 1 ms
Iterating global reduction 2 with 412 rules applied. Total rules applied 2194 place count 1249 transition count 1127
Renaming transitions due to excessive name length > 1024 char.
Discarding 267 places :
Symmetric choice reduction at 2 with 267 rule applications. Total rules 2461 place count 982 transition count 860
Deduced a syphon composed of 467 places in 0 ms
Iterating global reduction 2 with 267 rules applied. Total rules applied 2728 place count 982 transition count 860
Deduced a syphon composed of 467 places in 0 ms
Applied a total of 2728 rules in 627 ms. Remains 982 /1728 variables (removed 746) and now considering 860/1678 (removed 818) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:01:47] [INFO ] Redundant transitions in 47 ms returned []
Running 859 sub problems to find dead transitions.
// Phase 1: matrix 860 rows 982 cols
[2025-05-30 20:01:48] [INFO ] Computed 148 invariants in 21 ms
[2025-05-30 20:01:48] [INFO ] State equation strengthened by 169 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 981/1842 variables, and 1 constraints, problems are : Problem set: 0 solved, 859 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/146 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/982 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 859/696 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 859 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/981 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 2 (OVERLAPS) 1/982 variables, 146/147 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/982 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 859 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:42] [INFO ] Deduced a trap composed of 2 places in 269 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:43] [INFO ] Deduced a trap composed of 2 places in 274 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:43] [INFO ] Deduced a trap composed of 2 places in 290 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:43] [INFO ] Deduced a trap composed of 2 places in 279 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:44] [INFO ] Deduced a trap composed of 2 places in 285 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:44] [INFO ] Deduced a trap composed of 2 places in 300 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:44] [INFO ] Deduced a trap composed of 2 places in 276 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:44] [INFO ] Deduced a trap composed of 2 places in 280 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:45] [INFO ] Deduced a trap composed of 2 places in 273 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:45] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 15 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:45] [INFO ] Deduced a trap composed of 2 places in 247 ms of which 11 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:46] [INFO ] Deduced a trap composed of 2 places in 245 ms of which 11 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:46] [INFO ] Deduced a trap composed of 2 places in 251 ms of which 12 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:46] [INFO ] Deduced a trap composed of 2 places in 245 ms of which 11 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:46] [INFO ] Deduced a trap composed of 2 places in 241 ms of which 11 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:47] [INFO ] Deduced a trap composed of 2 places in 242 ms of which 11 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:47] [INFO ] Deduced a trap composed of 2 places in 248 ms of which 12 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:47] [INFO ] Deduced a trap composed of 2 places in 242 ms of which 12 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:47] [INFO ] Deduced a trap composed of 2 places in 254 ms of which 16 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:48] [INFO ] Deduced a trap composed of 2 places in 239 ms of which 13 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 20/168 constraints. Problems are: Problem set: 55 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:02:48] [INFO ] Deduced a trap composed of 2 places in 243 ms of which 12 ms to minimize.
SMT process timed out in 60711ms, After SMT, problems are : Problem set: 55 solved, 804 unsolved
Search for dead transitions found 55 dead transitions in 60713ms
Found 55 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 55 transitions
Dead transitions reduction (with SMT) removed 55 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 982/1728 places, 805/1678 transitions.
Graph (complete) has 6652 edges and 982 vertex of which 927 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.3 ms
Discarding 55 places :
Also discarding 0 output transitions
Deduced a syphon composed of 412 places in 0 ms
Applied a total of 1 rules in 47 ms. Remains 927 /982 variables (removed 55) and now considering 805/805 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 927/1728 places, 805/1678 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61447 ms. Remains : 927/1728 places, 805/1678 transitions.
Built C files in :
/tmp/ltsmin14587948396752065274
[2025-05-30 20:02:48] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14587948396752065274
Running compilation step : cd /tmp/ltsmin14587948396752065274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14587948396752065274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14587948396752065274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1728/1728 places, 1678/1678 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1727 transition count 1677
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1727 transition count 1677
Applied a total of 2 rules in 187 ms. Remains 1727 /1728 variables (removed 1) and now considering 1677/1678 (removed 1) transitions.
// Phase 1: matrix 1677 rows 1727 cols
[2025-05-30 20:02:52] [INFO ] Computed 148 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:02:52] [INFO ] Implicit Places using invariants in 721 ms returned []
[2025-05-30 20:02:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:02:55] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 3138 ms to find 0 implicit places.
Running 1676 sub problems to find dead transitions.
[2025-05-30 20:02:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1726/3404 variables, and 0 constraints, problems are : Problem set: 0 solved, 1676 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1727 constraints, PredecessorRefiner: 1676/1676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1676 unsolved
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 Int declared 1726/3404 variables, and 0 constraints, problems are : Problem set: 0 solved, 1676 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1727 constraints, PredecessorRefiner: 0/1676 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 1676 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in LTL mode, iteration 1 : 1727/1728 places, 1677/1678 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63665 ms. Remains : 1727/1728 places, 1677/1678 transitions.
Built C files in :
/tmp/ltsmin9211244093813819952
[2025-05-30 20:03:55] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9211244093813819952
Running compilation step : cd /tmp/ltsmin9211244093813819952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9211244093813819952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9211244093813819952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 20:03:58] [INFO ] Flatten gal took : 55 ms
[2025-05-30 20:03:58] [INFO ] Flatten gal took : 48 ms
[2025-05-30 20:03:58] [INFO ] Time to serialize gal into /tmp/LTL3592995024358239468.gal : 10 ms
[2025-05-30 20:03:58] [INFO ] Time to serialize properties into /tmp/LTL5407837782520800828.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3592995024358239468.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16182952345493004744.hoa' '-atoms' '/tmp/LTL5407837782520800828.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5407837782520800828.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16182952345493004744.hoa
Detected timeout of ITS tools.
[2025-05-30 20:04:13] [INFO ] Flatten gal took : 45 ms
[2025-05-30 20:04:13] [INFO ] Flatten gal took : 43 ms
[2025-05-30 20:04:13] [INFO ] Time to serialize gal into /tmp/LTL6377478389779264509.gal : 9 ms
[2025-05-30 20:04:14] [INFO ] Time to serialize properties into /tmp/LTL10913497725450076455.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6377478389779264509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10913497725450076455.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(((X(X("(p1697!=1)")))||(G(!("((p902==0)||(p399==1))"))))U(X("((p27==0)||(p422==1))"))))))
Formula 0 simplified : XF((XX!"(p1697!=1)" & F"((p902==0)||(p399==1))") R X!"((p27==0)||(p422==1))")
Detected timeout of ITS tools.
[2025-05-30 20:04:29] [INFO ] Flatten gal took : 41 ms
[2025-05-30 20:04:29] [INFO ] Applying decomposition
[2025-05-30 20:04:29] [INFO ] Flatten gal took : 40 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/graph5345152798733787577.txt' '-o' '/tmp/graph5345152798733787577.bin' '-w' '/tmp/graph5345152798733787577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5345152798733787577.bin' '-l' '-1' '-v' '-w' '/tmp/graph5345152798733787577.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:04:29] [INFO ] Decomposing Gal with order
[2025-05-30 20:04:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:04:29] [INFO ] Removed a total of 330 redundant transitions.
[2025-05-30 20:04:29] [INFO ] Flatten gal took : 121 ms
[2025-05-30 20:04:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2025-05-30 20:04:29] [INFO ] Time to serialize gal into /tmp/LTL3498553006161400894.gal : 18 ms
[2025-05-30 20:04:29] [INFO ] Time to serialize properties into /tmp/LTL1683289844056740712.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3498553006161400894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1683289844056740712.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(((X(X("(i14.u514.p1697!=1)")))||(G(!("((i5.u254.p902==0)||(i16.u127.p399==1))"))))U(X("((i24.u12.p27==0)||(i18.u134.p422==1))")...160
Formula 0 simplified : XF((XX!"(i14.u514.p1697!=1)" & F"((i5.u254.p902==0)||(i16.u127.p399==1))") R X!"((i24.u12.p27==0)||(i18.u134.p422==1))")
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-24b-LTLCardinality-10 finished in 322129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0&&(p1 U p2)))))'
Support contains 5 out of 1746 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 1745 transition count 1067
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 703 rules applied. Total rules applied 1332 place count 1116 transition count 993
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1380 place count 1068 transition count 993
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 1380 place count 1068 transition count 795
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 1776 place count 870 transition count 795
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1785 place count 861 transition count 786
Iterating global reduction 3 with 9 rules applied. Total rules applied 1794 place count 861 transition count 786
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1794 place count 861 transition count 780
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1806 place count 855 transition count 780
Performed 336 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 2478 place count 519 transition count 397
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2479 place count 518 transition count 396
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2551 place count 470 transition count 372
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2575 place count 446 transition count 372
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2575 place count 446 transition count 348
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2623 place count 422 transition count 348
Applied a total of 2623 rules in 133 ms. Remains 422 /1746 variables (removed 1324) and now considering 348/1697 (removed 1349) transitions.
// Phase 1: matrix 348 rows 422 cols
[2025-05-30 20:04:44] [INFO ] Computed 100 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:04:45] [INFO ] Implicit Places using invariants in 450 ms returned [174, 249, 323, 327, 331, 335, 339, 343, 347, 351, 355, 359, 363, 367, 371, 375, 379, 383, 387, 391, 395, 399, 404, 408, 412, 416, 421]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 451 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 395/1746 places, 348/1697 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 395 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 394 transition count 347
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 26 place count 370 transition count 323
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 370 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 369 transition count 322
Applied a total of 52 rules in 22 ms. Remains 369 /395 variables (removed 26) and now considering 322/348 (removed 26) transitions.
// Phase 1: matrix 322 rows 369 cols
[2025-05-30 20:04:45] [INFO ] Computed 73 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:04:45] [INFO ] Implicit Places using invariants in 407 ms returned []
[2025-05-30 20:04:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:04:45] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-30 20:04:46] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 369/1746 places, 322/1697 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2011 ms. Remains : 369/1746 places, 322/1697 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p2) p0), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-11
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-11 finished in 2087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1746 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1745 transition count 1066
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 704 rules applied. Total rules applied 1334 place count 1115 transition count 992
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1382 place count 1067 transition count 992
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1382 place count 1067 transition count 793
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1780 place count 868 transition count 793
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1791 place count 857 transition count 782
Iterating global reduction 3 with 11 rules applied. Total rules applied 1802 place count 857 transition count 782
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1802 place count 857 transition count 776
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1814 place count 851 transition count 776
Performed 338 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 2490 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2491 place count 512 transition count 390
Reduce places removed 48 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2563 place count 464 transition count 366
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2587 place count 440 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2587 place count 440 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2635 place count 416 transition count 342
Applied a total of 2635 rules in 131 ms. Remains 416 /1746 variables (removed 1330) and now considering 342/1697 (removed 1355) transitions.
// Phase 1: matrix 342 rows 416 cols
[2025-05-30 20:04:47] [INFO ] Computed 100 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:04:47] [INFO ] Implicit Places using invariants in 414 ms returned [170, 244, 318, 322, 326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 415]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 415 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 389/1746 places, 342/1697 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 364 transition count 317
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 342 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 341 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 341 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 340 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 340 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 339 transition count 292
Applied a total of 100 rules in 135 ms. Remains 339 /389 variables (removed 50) and now considering 292/342 (removed 50) transitions.
// Phase 1: matrix 292 rows 339 cols
[2025-05-30 20:04:47] [INFO ] Computed 73 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:04:47] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-05-30 20:04:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:04:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 20:04:48] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 339/1746 places, 292/1697 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1567 ms. Remains : 339/1746 places, 292/1697 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-13
Product exploration explored 100000 steps with 1229 reset in 362 ms.
Product exploration explored 100000 steps with 1231 reset in 452 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/339 stabilizing places and 2/292 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 174 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 339/339 places, 292/292 transitions.
Applied a total of 0 rules in 13 ms. Remains 339 /339 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2025-05-30 20:04:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:04:50] [INFO ] Implicit Places using invariants in 310 ms returned []
[2025-05-30 20:04:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 20:04:50] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:04:50] [INFO ] Redundant transitions in 3 ms returned []
Running 170 sub problems to find dead transitions.
[2025-05-30 20:04:50] [INFO ] Invariant cache hit.
[2025-05-30 20:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 2/339 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:04:53] [INFO ] Deduced a trap composed of 127 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 292/631 variables, 339/413 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:05:03] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:05:03] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:05:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/631 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 417 constraints, problems are : Problem set: 0 solved, 170 unsolved in 27908 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 2/339 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 292/631 variables, 339/413 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 170/584 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/631 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 587 constraints, problems are : Problem set: 0 solved, 170 unsolved in 26187 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 54112ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 54112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55017 ms. Remains : 339/339 places, 292/292 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/339 stabilizing places and 2/292 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1225 reset in 362 ms.
Product exploration explored 100000 steps with 1233 reset in 404 ms.
Built C files in :
/tmp/ltsmin15274434535038381668
[2025-05-30 20:05:46] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2025-05-30 20:05:46] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:05:46] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2025-05-30 20:05:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:05:46] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2025-05-30 20:05:46] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:05:46] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15274434535038381668
Running compilation step : cd /tmp/ltsmin15274434535038381668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 571 ms.
Running link step : cd /tmp/ltsmin15274434535038381668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin15274434535038381668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17265737620460318995.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 339/339 places, 292/292 transitions.
Applied a total of 0 rules in 15 ms. Remains 339 /339 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2025-05-30 20:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:06:01] [INFO ] Implicit Places using invariants in 314 ms returned []
[2025-05-30 20:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:06:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 20:06:02] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:06:02] [INFO ] Redundant transitions in 2 ms returned []
Running 170 sub problems to find dead transitions.
[2025-05-30 20:06:02] [INFO ] Invariant cache hit.
[2025-05-30 20:06:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 2/339 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:06:05] [INFO ] Deduced a trap composed of 127 places in 58 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 292/631 variables, 339/413 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:06:14] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:06:14] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:06:14] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/631 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 417 constraints, problems are : Problem set: 0 solved, 170 unsolved in 27410 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 2/339 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 292/631 variables, 339/413 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 170/584 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/631 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 631/631 variables, and 587 constraints, problems are : Problem set: 0 solved, 170 unsolved in 25442 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 52866ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 52867ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53809 ms. Remains : 339/339 places, 292/292 transitions.
Built C files in :
/tmp/ltsmin12384555549964992397
[2025-05-30 20:06:55] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2025-05-30 20:06:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:06:55] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2025-05-30 20:06:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:06:55] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2025-05-30 20:06:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:06:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12384555549964992397
Running compilation step : cd /tmp/ltsmin12384555549964992397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin12384555549964992397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12384555549964992397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11801822335749135943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 20:07:10] [INFO ] Flatten gal took : 8 ms
[2025-05-30 20:07:10] [INFO ] Flatten gal took : 7 ms
[2025-05-30 20:07:10] [INFO ] Time to serialize gal into /tmp/LTL12401256377946284504.gal : 2 ms
[2025-05-30 20:07:10] [INFO ] Time to serialize properties into /tmp/LTL8294110998703211665.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12401256377946284504.gal' '-t' 'CGAL' '-hoa' '/tmp/aut56716028503468041.hoa' '-atoms' '/tmp/LTL8294110998703211665.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL8294110998703211665.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut56716028503468041.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t27, t311.t369, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Computing Next relation with stutter on 1.61061e+09 deadlock states
Detected timeout of ITS tools.
[2025-05-30 20:07:25] [INFO ] Flatten gal took : 8 ms
[2025-05-30 20:07:25] [INFO ] Flatten gal took : 8 ms
[2025-05-30 20:07:25] [INFO ] Time to serialize gal into /tmp/LTL6363675750211513039.gal : 2 ms
[2025-05-30 20:07:25] [INFO ] Time to serialize properties into /tmp/LTL2683560369225420441.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6363675750211513039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2683560369225420441.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(p884!=1)"))))
Formula 0 simplified : GF!"(p884!=1)"
Reverse transition relation is NOT exact ! Due to transitions t1, t27, t311.t369, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Computing Next relation with stutter on 1.61061e+09 deadlock states
Detected timeout of ITS tools.
[2025-05-30 20:07:40] [INFO ] Flatten gal took : 9 ms
[2025-05-30 20:07:40] [INFO ] Applying decomposition
[2025-05-30 20:07:40] [INFO ] Flatten gal took : 7 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/graph13770772444812890459.txt' '-o' '/tmp/graph13770772444812890459.bin' '-w' '/tmp/graph13770772444812890459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13770772444812890459.bin' '-l' '-1' '-v' '-w' '/tmp/graph13770772444812890459.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:07:40] [INFO ] Decomposing Gal with order
[2025-05-30 20:07:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:07:40] [INFO ] Removed a total of 1 redundant transitions.
[2025-05-30 20:07:40] [INFO ] Flatten gal took : 15 ms
[2025-05-30 20:07:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 20:07:40] [INFO ] Time to serialize gal into /tmp/LTL12118523638740798377.gal : 3 ms
[2025-05-30 20:07:40] [INFO ] Time to serialize properties into /tmp/LTL4355626965273507582.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12118523638740798377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4355626965273507582.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i13.u58.p884!=1)"))))
Formula 0 simplified : GF!"(i13.u58.p884!=1)"
Reverse transition relation is NOT exact ! Due to transitions t311_t369, i0.t27, i13.t1, Intersection with reachable at each step enabled. (destroyed/reve...188
Computing Next relation with stutter on 1.61061e+09 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
87 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.903252,57428,1,0,68554,25056,3557,177339,1219,90018,70048
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLCardinality-13 finished in 174703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1746 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1746/1746 places, 1697/1697 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1734 transition count 1685
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1734 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1734 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 1728 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1726 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1726 transition count 1676
Applied a total of 41 rules in 409 ms. Remains 1726 /1746 variables (removed 20) and now considering 1676/1697 (removed 21) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2025-05-30 20:07:42] [INFO ] Computed 148 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:07:42] [INFO ] Implicit Places using invariants in 783 ms returned []
[2025-05-30 20:07:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:07:45] [INFO ] Implicit Places using invariants and state equation in 2508 ms returned []
Implicit Place search using SMT with State Equation took 3296 ms to find 0 implicit places.
Running 1675 sub problems to find dead transitions.
[2025-05-30 20:07:45] [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 1725/3402 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1726 constraints, PredecessorRefiner: 1675/1675 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1675 unsolved
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 Int declared 1725/3402 variables, and 0 constraints, problems are : Problem set: 0 solved, 1675 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1726 constraints, PredecessorRefiner: 0/1675 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 1675 unsolved
Search for dead transitions found 0 dead transitions in 60330ms
Starting structural reductions in LTL mode, iteration 1 : 1726/1746 places, 1676/1697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64041 ms. Remains : 1726/1746 places, 1676/1697 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-15
Product exploration explored 100000 steps with 93 reset in 271 ms.
Entered a terminal (fully accepting) state of product in 23062 steps with 21 reset in 76 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-15 finished in 64491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(X(p0))||G(!p1)) U X(p2)))))'
[2025-05-30 20:08:46] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
[2025-05-30 20:08:46] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin6176481880487936099
[2025-05-30 20:08:46] [INFO ] Too many transitions (1697) to apply POR reductions. Disabling POR matrices.
[2025-05-30 20:08:46] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6176481880487936099
Running compilation step : cd /tmp/ltsmin6176481880487936099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 20:08:46] [INFO ] Flatten gal took : 56 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/graph4739765218970782274.txt' '-o' '/tmp/graph4739765218970782274.bin' '-w' '/tmp/graph4739765218970782274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4739765218970782274.bin' '-l' '-1' '-v' '-w' '/tmp/graph4739765218970782274.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:08:46] [INFO ] Decomposing Gal with order
[2025-05-30 20:08:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:08:46] [INFO ] Removed a total of 326 redundant transitions.
[2025-05-30 20:08:46] [INFO ] Flatten gal took : 76 ms
[2025-05-30 20:08:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-05-30 20:08:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality5519503191626073643.gal : 15 ms
[2025-05-30 20:08:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality10882241467626418263.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5519503191626073643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10882241467626418263.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(((X(X("(i11.u524.p1697!=1)")))||(G(!("((i6.u256.p902==0)||(i8.u124.p399==1))"))))U(X("((i3.u11.p27==0)||(i14.u132.p422==1))")))...158
Formula 0 simplified : XF((XX!"(i11.u524.p1697!=1)" & F"((i6.u256.p902==0)||(i8.u124.p399==1))") R X!"((i3.u11.p27==0)||(i14.u132.p422==1))")
Compilation finished in 3260 ms.
Running link step : cd /tmp/ltsmin6176481880487936099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6176481880487936099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((X(X((LTLAPp0==true)))||[](!(LTLAPp1==true))) U X((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 20:33:32] [INFO ] Applying decomposition
[2025-05-30 20:33:33] [INFO ] Flatten gal took : 966 ms
[2025-05-30 20:33:33] [INFO ] Decomposing Gal with order
[2025-05-30 20:33:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:33:42] [INFO ] Removed a total of 50 redundant transitions.
[2025-05-30 20:33:44] [INFO ] Flatten gal took : 3576 ms
[2025-05-30 20:33:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 694 labels/synchronizations in 4497 ms.
[2025-05-30 20:33:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality13012657933694325866.gal : 405 ms
[2025-05-30 20:33:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality15489421602515598346.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13012657933694325866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15489421602515598346.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(G(((X(X("(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u267.p1697!=1)")))||(G(!("((i0.i0.i0.i0.i...1063
Formula 0 simplified : XF((XX!"(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u267.p1697!=1)" & F"((i0.i0.i0.i0.i0.i0.i0.i0...1046

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="AutoFlight-PT-24b"
export BK_EXAMINATION="LTLCardinality"
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 AutoFlight-PT-24b, examination is LTLCardinality"
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-174853729500563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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