Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300140.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 Champagne-PT-H09T2O, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.9K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 405K Jun 5 20:08 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 Champagne-PT-H09T2O-LTLFireability-00
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-01
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-02
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-03
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-04
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-05
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-06
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-07
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-08
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-09
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-10
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-11
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-12
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-13
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-14
FORMULA_NAME Champagne-PT-H09T2O-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749332127713

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 21:35:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 21:35:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 21:35:29] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2025-06-07 21:35:29] [INFO ] Transformed 1861 places.
[2025-06-07 21:35:29] [INFO ] Transformed 2552 transitions.
[2025-06-07 21:35:29] [INFO ] Found NUPN structural information;
[2025-06-07 21:35:29] [INFO ] Parsed PT model containing 1861 places and 2552 transitions and 6380 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H09T2O-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T2O-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T2O-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1861 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1861/1861 places, 2552/2552 transitions.
Discarding 334 places :
Symmetric choice reduction at 0 with 334 rule applications. Total rules 334 place count 1527 transition count 2218
Iterating global reduction 0 with 334 rules applied. Total rules applied 668 place count 1527 transition count 2218
Discarding 233 places :
Symmetric choice reduction at 0 with 233 rule applications. Total rules 901 place count 1294 transition count 1985
Iterating global reduction 0 with 233 rules applied. Total rules applied 1134 place count 1294 transition count 1985
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 1267 place count 1161 transition count 1852
Iterating global reduction 0 with 133 rules applied. Total rules applied 1400 place count 1161 transition count 1852
Applied a total of 1400 rules in 438 ms. Remains 1161 /1861 variables (removed 700) and now considering 1852/2552 (removed 700) transitions.
// Phase 1: matrix 1852 rows 1161 cols
[2025-06-07 21:35:29] [INFO ] Computed 49 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:35:30] [INFO ] Implicit Places using invariants in 642 ms returned []
[2025-06-07 21:35:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:35:31] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
Running 1851 sub problems to find dead transitions.
[2025-06-07 21:35:31] [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 timeout
1.0)
(s158 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1160/3013 variables, and 0 constraints, problems are : Problem set: 0 solved, 1851 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1161 constraints, PredecessorRefiner: 1851/1851 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1851 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 1)
(s514 1)
(s515 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1160/3013 variables, and 0 constraints, problems are : Problem set: 0 solved, 1851 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1161 constraints, PredecessorRefiner: 0/1851 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60760ms problems are : Problem set: 0 solved, 1851 unsolved
Search for dead transitions found 0 dead transitions in 60782ms
Starting structural reductions in LTL mode, iteration 1 : 1161/1861 places, 1852/2552 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62737 ms. Remains : 1161/1861 places, 1852/2552 transitions.
Support contains 40 out of 1161 places after structural reductions.
[2025-06-07 21:36:32] [INFO ] Flatten gal took : 129 ms
[2025-06-07 21:36:32] [INFO ] Flatten gal took : 76 ms
[2025-06-07 21:36:32] [INFO ] Input system was already deterministic with 1852 transitions.
Support contains 39 out of 1161 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (29 resets) in 2032 ms. (19 steps per ms) remains 2/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2025-06-07 21:36:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/137 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1024/1161 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1852/3013 variables, 1161/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3013 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3013 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3013/3013 variables, and 1210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1161/1161 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/137 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1024/1161 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1852/3013 variables, 1161/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3013 variables, 2/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3013 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3013 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3013/3013 variables, and 1212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1161/1161 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2346ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 318 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=159 )
Parikh walk visited 2 properties in 127 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&G((p1||X(p1))))))))'
Support contains 2 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1143 transition count 1834
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1143 transition count 1834
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1133 transition count 1824
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1133 transition count 1824
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1127 transition count 1818
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1127 transition count 1818
Applied a total of 68 rules in 650 ms. Remains 1127 /1161 variables (removed 34) and now considering 1818/1852 (removed 34) transitions.
// Phase 1: matrix 1818 rows 1127 cols
[2025-06-07 21:36:37] [INFO ] Computed 49 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:36:37] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-06-07 21:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:36:38] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
Running 1817 sub problems to find dead transitions.
[2025-06-07 21:36:38] [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 1126/2945 variables, and 0 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1127 constraints, PredecessorRefiner: 1817/1817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1817 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 1126/2945 variables, and 0 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1127 constraints, PredecessorRefiner: 0/1817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60488ms problems are : Problem set: 0 solved, 1817 unsolved
Search for dead transitions found 0 dead transitions in 60494ms
Starting structural reductions in LTL mode, iteration 1 : 1127/1161 places, 1818/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62180 ms. Remains : 1127/1161 places, 1818/1852 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-00
Stuttering criterion allowed to conclude after 2129 steps with 1 reset in 24 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-00 finished in 62684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)&&p0))&&F(p2))))'
Support contains 4 out of 1161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Graph (trivial) has 1228 edges and 1161 vertex of which 732 / 1161 are part of one of the 48 SCC in 7 ms
Free SCC test removed 684 places
Ensure Unique test removed 758 transitions
Reduce isomorphic transitions removed 758 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 476 transition count 951
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 235 rules applied. Total rules applied 378 place count 334 transition count 858
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 424 place count 288 transition count 858
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 424 place count 288 transition count 855
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 430 place count 285 transition count 855
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 470 place count 245 transition count 593
Iterating global reduction 3 with 40 rules applied. Total rules applied 510 place count 245 transition count 593
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 542 place count 245 transition count 561
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 730 place count 151 transition count 467
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 732 place count 149 transition count 455
Iterating global reduction 4 with 2 rules applied. Total rules applied 734 place count 149 transition count 455
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 736 place count 149 transition count 453
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 742 place count 146 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 743 place count 146 transition count 467
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 744 place count 145 transition count 461
Iterating global reduction 6 with 1 rules applied. Total rules applied 745 place count 145 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 746 place count 145 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 761 place count 145 transition count 445
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 762 place count 144 transition count 433
Iterating global reduction 7 with 1 rules applied. Total rules applied 763 place count 144 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 764 place count 144 transition count 432
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 766 place count 142 transition count 430
Applied a total of 766 rules in 166 ms. Remains 142 /1161 variables (removed 1019) and now considering 430/1852 (removed 1422) transitions.
[2025-06-07 21:37:39] [INFO ] Flow matrix only has 139 transitions (discarded 291 similar events)
// Phase 1: matrix 139 rows 142 cols
[2025-06-07 21:37:39] [INFO ] Computed 49 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:37:39] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-07 21:37:39] [INFO ] Flow matrix only has 139 transitions (discarded 291 similar events)
[2025-06-07 21:37:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:37:39] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:37:39] [INFO ] Redundant transitions in 23 ms returned []
Running 294 sub problems to find dead transitions.
[2025-06-07 21:37:39] [INFO ] Flow matrix only has 139 transitions (discarded 291 similar events)
[2025-06-07 21:37:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 3/142 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 138/280 variables, 142/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 191 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10548 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 3/142 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 138/280 variables, 142/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 294/485 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 485 constraints, problems are : Problem set: 0 solved, 294 unsolved in 11204 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21793ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 21794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 142/1161 places, 430/1852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22220 ms. Remains : 142/1161 places, 430/1852 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-01 finished in 22458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X((p2 U (!p3||G(p2))))&&p1)||p0))))'
Support contains 5 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1143 transition count 1834
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1143 transition count 1834
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1134 transition count 1825
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1134 transition count 1825
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 1128 transition count 1819
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 1128 transition count 1819
Applied a total of 66 rules in 151 ms. Remains 1128 /1161 variables (removed 33) and now considering 1819/1852 (removed 33) transitions.
// Phase 1: matrix 1819 rows 1128 cols
[2025-06-07 21:38:01] [INFO ] Computed 49 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:38:01] [INFO ] Implicit Places using invariants in 312 ms returned []
[2025-06-07 21:38:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:38:02] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Running 1818 sub problems to find dead transitions.
[2025-06-07 21:38:02] [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 1127/2947 variables, and 0 constraints, problems are : Problem set: 0 solved, 1818 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1128 constraints, PredecessorRefiner: 1818/1818 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1818 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 1127/2947 variables, and 0 constraints, problems are : Problem set: 0 solved, 1818 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1128 constraints, PredecessorRefiner: 0/1818 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 1818 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Starting structural reductions in LTL mode, iteration 1 : 1128/1161 places, 1819/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61769 ms. Remains : 1128/1161 places, 1819/1852 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) p3)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-02
Product exploration explored 100000 steps with 33361 reset in 405 ms.
Product exploration explored 100000 steps with 33250 reset in 441 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) p2), (X p2), (X (NOT p3)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 157 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) p3)]
RANDOM walk for 40000 steps (28 resets) in 786 ms. (50 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
[2025-06-07 21:39:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 128/133 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 995/1128 variables, 44/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1128 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1819/2947 variables, 1128/1177 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2947 variables, 0/1177 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2947 variables, 0/1177 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2947/2947 variables, and 1177 constraints, problems are : Problem set: 3 solved, 1 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1128/1128 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1128 variables, 47/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1128 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1819/2947 variables, 1128/1177 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2947 variables, 1/1178 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2947 variables, 0/1178 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2947 variables, 0/1178 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2947/2947 variables, and 1178 constraints, problems are : Problem set: 3 solved, 1 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1128/1128 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1495ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 284 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=71 )
Parikh walk visited 1 properties in 4 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) p2), (X p2), (X (NOT p3)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p3 p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p2)))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1 p2 (NOT p3))), (G (OR p0 (NOT p2) (NOT p3))), (G (OR p0 (NOT p1) p2 (NOT p3)))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F p3), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 357 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1128/1128 places, 1819/1819 transitions.
Graph (trivial) has 1193 edges and 1128 vertex of which 726 / 1128 are part of one of the 48 SCC in 3 ms
Free SCC test removed 678 places
Ensure Unique test removed 754 transitions
Reduce isomorphic transitions removed 754 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 449 transition count 939
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 215 rules applied. Total rules applied 341 place count 324 transition count 849
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 47 rules applied. Total rules applied 388 place count 279 transition count 847
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 394 place count 277 transition count 843
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 396 place count 275 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 396 place count 275 transition count 841
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 400 place count 273 transition count 841
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 434 place count 239 transition count 577
Iterating global reduction 5 with 34 rules applied. Total rules applied 468 place count 239 transition count 577
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 502 place count 239 transition count 543
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 6 with 182 rules applied. Total rules applied 684 place count 148 transition count 452
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 688 place count 146 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 689 place count 146 transition count 463
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 690 place count 145 transition count 449
Iterating global reduction 7 with 1 rules applied. Total rules applied 691 place count 145 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 692 place count 145 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 699 place count 145 transition count 441
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 701 place count 143 transition count 439
Applied a total of 701 rules in 81 ms. Remains 143 /1128 variables (removed 985) and now considering 439/1819 (removed 1380) transitions.
[2025-06-07 21:39:07] [INFO ] Flow matrix only has 158 transitions (discarded 281 similar events)
// Phase 1: matrix 158 rows 143 cols
[2025-06-07 21:39:07] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-07 21:39:07] [INFO ] Flow matrix only has 158 transitions (discarded 281 similar events)
[2025-06-07 21:39:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:07] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:39:07] [INFO ] Redundant transitions in 6 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-07 21:39:07] [INFO ] Flow matrix only has 158 transitions (discarded 281 similar events)
[2025-06-07 21:39:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 157/300 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/301 variables, and 192 constraints, problems are : Problem set: 0 solved, 304 unsolved in 11319 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 157/300 variables, 143/192 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 304/496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/301 variables, and 496 constraints, problems are : Problem set: 0 solved, 304 unsolved in 12019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23375ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 23376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/1128 places, 439/1819 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23715 ms. Remains : 143/1128 places, 439/1819 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 336 steps (1 resets) in 28 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 357 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-02 finished in 90395 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||X(X(p2))))))'
Support contains 3 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1144 transition count 1835
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1144 transition count 1835
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 1135 transition count 1826
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 1135 transition count 1826
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1130 transition count 1821
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1130 transition count 1821
Applied a total of 62 rules in 152 ms. Remains 1130 /1161 variables (removed 31) and now considering 1821/1852 (removed 31) transitions.
// Phase 1: matrix 1821 rows 1130 cols
[2025-06-07 21:39:32] [INFO ] Computed 49 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:32] [INFO ] Implicit Places using invariants in 319 ms returned []
[2025-06-07 21:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:33] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Running 1820 sub problems to find dead transitions.
[2025-06-07 21:39:33] [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 1129/2951 variables, and 0 constraints, problems are : Problem set: 0 solved, 1820 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1130 constraints, PredecessorRefiner: 1820/1820 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1820 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 1129/2951 variables, and 0 constraints, problems are : Problem set: 0 solved, 1820 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1130 constraints, PredecessorRefiner: 0/1820 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 1820 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Starting structural reductions in LTL mode, iteration 1 : 1130/1161 places, 1821/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61733 ms. Remains : 1130/1161 places, 1821/1852 transitions.
Stuttering acceptance computed with spot in 473 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-03 finished in 62235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(p1)))'
Support contains 3 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1143 transition count 1834
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1143 transition count 1834
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1133 transition count 1824
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1133 transition count 1824
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1127 transition count 1818
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1127 transition count 1818
Applied a total of 68 rules in 140 ms. Remains 1127 /1161 variables (removed 34) and now considering 1818/1852 (removed 34) transitions.
// Phase 1: matrix 1818 rows 1127 cols
[2025-06-07 21:40:34] [INFO ] Computed 49 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:40:34] [INFO ] Implicit Places using invariants in 313 ms returned []
[2025-06-07 21:40:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:40:35] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
Running 1817 sub problems to find dead transitions.
[2025-06-07 21:40:35] [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 1126/2945 variables, and 0 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1127 constraints, PredecessorRefiner: 1817/1817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1817 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)timeout

(s100 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1126/2945 variables, and 0 constraints, problems are : Problem set: 0 solved, 1817 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1127 constraints, PredecessorRefiner: 0/1817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 1817 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Starting structural reductions in LTL mode, iteration 1 : 1127/1161 places, 1818/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61675 ms. Remains : 1127/1161 places, 1818/1852 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-04 finished in 61965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(X(X(p1))))||G(p1))))'
Support contains 3 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1145 transition count 1836
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1145 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1137 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1137 transition count 1828
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 1132 transition count 1823
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 1132 transition count 1823
Applied a total of 58 rules in 134 ms. Remains 1132 /1161 variables (removed 29) and now considering 1823/1852 (removed 29) transitions.
// Phase 1: matrix 1823 rows 1132 cols
[2025-06-07 21:41:36] [INFO ] Computed 49 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:41:36] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-06-07 21:41:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:41:37] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Running 1822 sub problems to find dead transitions.
[2025-06-07 21:41:37] [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 1131/2955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1822 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1132 constraints, PredecessorRefiner: 1822/1822 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1822 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s136 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/2955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1822 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1132 constraints, PredecessorRefiner: 0/1822 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 1822 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Starting structural reductions in LTL mode, iteration 1 : 1132/1161 places, 1823/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61687 ms. Remains : 1132/1161 places, 1823/1852 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 297 ms.
Product exploration explored 100000 steps with 25000 reset in 296 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 31254 steps (22 resets) in 139 ms. (223 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 349 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 1132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1132/1132 places, 1823/1823 transitions.
Applied a total of 0 rules in 35 ms. Remains 1132 /1132 variables (removed 0) and now considering 1823/1823 (removed 0) transitions.
[2025-06-07 21:42:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:42:40] [INFO ] Implicit Places using invariants in 317 ms returned []
[2025-06-07 21:42:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:42:41] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Running 1822 sub problems to find dead transitions.
[2025-06-07 21:42:41] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1131/2955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1822 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1132 constraints, PredecessorRefiner: 1822/1822 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1822 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s89 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/2955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1822 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1132 constraints, PredecessorRefiner: 0/1822 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 1822 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Finished structural reductions in LTL mode , in 1 iterations and 61611 ms. Remains : 1132/1132 places, 1823/1823 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Computed a total of 51 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 144 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (27 resets) in 182 ms. (218 steps per ms) remains 1/6 properties
BEST_FIRST walk for 30372 steps (6 resets) in 45 ms. (660 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 364 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 350 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 350 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 268 ms.
Product exploration explored 100000 steps with 25000 reset in 282 ms.
Built C files in :
/tmp/ltsmin12078490773913823206
[2025-06-07 21:43:44] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12078490773913823206
Running compilation step : cd /tmp/ltsmin12078490773913823206;'/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/ltsmin12078490773913823206;'/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/ltsmin12078490773913823206;'/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 1132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1132/1132 places, 1823/1823 transitions.
Applied a total of 0 rules in 37 ms. Remains 1132 /1132 variables (removed 0) and now considering 1823/1823 (removed 0) transitions.
[2025-06-07 21:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:43:48] [INFO ] Implicit Places using invariants in 316 ms returned []
[2025-06-07 21:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:43:48] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Running 1822 sub problems to find dead transitions.
[2025-06-07 21:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 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 1131/2955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1822 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1132 constraints, PredecessorRefiner: 1822/1822 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1822 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 1131/2955 variables, and 0 constraints, problems are : Problem set: 0 solved, 1822 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1132 constraints, PredecessorRefiner: 0/1822 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60473ms problems are : Problem set: 0 solved, 1822 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Finished structural reductions in LTL mode , in 1 iterations and 61528 ms. Remains : 1132/1132 places, 1823/1823 transitions.
Built C files in :
/tmp/ltsmin3847278890975261479
[2025-06-07 21:44:49] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3847278890975261479
Running compilation step : cd /tmp/ltsmin3847278890975261479;'/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/ltsmin3847278890975261479;'/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/ltsmin3847278890975261479;'/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-06-07 21:44:52] [INFO ] Flatten gal took : 57 ms
[2025-06-07 21:44:52] [INFO ] Flatten gal took : 54 ms
[2025-06-07 21:44:52] [INFO ] Time to serialize gal into /tmp/LTL15285949984585603870.gal : 13 ms
[2025-06-07 21:44:52] [INFO ] Time to serialize properties into /tmp/LTL13104127505438220253.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15285949984585603870.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8916904798777047047.hoa' '-atoms' '/tmp/LTL13104127505438220253.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13104127505438220253.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8916904798777047047.hoa
Detected timeout of ITS tools.
[2025-06-07 21:45:07] [INFO ] Flatten gal took : 55 ms
[2025-06-07 21:45:07] [INFO ] Flatten gal took : 40 ms
[2025-06-07 21:45:07] [INFO ] Time to serialize gal into /tmp/LTL359190697352237810.gal : 10 ms
[2025-06-07 21:45:07] [INFO ] Time to serialize properties into /tmp/LTL13988013192420949936.ltl : 7 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/LTL359190697352237810.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13988013192420949936.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("(p396!=1)"))||(("((p1520!=1)&&(p1816!=1))")&&(X(X(X("(p396!=1)"))))))))
Formula 0 simplified : G(F!"(p396!=1)" & (!"((p1520!=1)&&(p1816!=1))" | XXX!"(p396!=1)"))
Detected timeout of ITS tools.
[2025-06-07 21:45:22] [INFO ] Flatten gal took : 38 ms
[2025-06-07 21:45:22] [INFO ] Applying decomposition
[2025-06-07 21:45:22] [INFO ] Flatten gal took : 37 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/graph10200740194938524750.txt' '-o' '/tmp/graph10200740194938524750.bin' '-w' '/tmp/graph10200740194938524750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10200740194938524750.bin' '-l' '-1' '-v' '-w' '/tmp/graph10200740194938524750.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:45:23] [INFO ] Decomposing Gal with order
[2025-06-07 21:45:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:45:23] [INFO ] Removed a total of 1381 redundant transitions.
[2025-06-07 21:45:23] [INFO ] Flatten gal took : 126 ms
[2025-06-07 21:45:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 28 ms.
[2025-06-07 21:45:23] [INFO ] Time to serialize gal into /tmp/LTL3901089508266540824.gal : 16 ms
[2025-06-07 21:45:23] [INFO ] Time to serialize properties into /tmp/LTL9858426948004590886.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/LTL3901089508266540824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9858426948004590886.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 : !((F((G("(i10.i0.i0.u95.p396!=1)"))||(("((i40.u367.p1520!=1)&&(i46.i1.i0.u440.p1816!=1))")&&(X(X(X("(i10.i0.i0.u95.p396!=1)"))))))))
Formula 0 simplified : G(F!"(i10.i0.i0.u95.p396!=1)" & (!"((i40.u367.p1520!=1)&&(i46.i1.i0.u440.p1816!=1))" | XXX!"(i10.i0.i0.u95.p396!=1)"))
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H09T2O-LTLFireability-05 finished in 242486 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&&F(G(p0)))))'
Support contains 1 out of 1161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Graph (trivial) has 1236 edges and 1161 vertex of which 753 / 1161 are part of one of the 49 SCC in 3 ms
Free SCC test removed 704 places
Ensure Unique test removed 781 transitions
Reduce isomorphic transitions removed 781 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 456 transition count 935
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 228 rules applied. Total rules applied 364 place count 321 transition count 842
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 410 place count 275 transition count 842
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 452 place count 233 transition count 575
Iterating global reduction 3 with 42 rules applied. Total rules applied 494 place count 233 transition count 575
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 528 place count 233 transition count 541
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 710 place count 142 transition count 450
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 713 place count 139 transition count 426
Iterating global reduction 4 with 3 rules applied. Total rules applied 716 place count 139 transition count 426
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 719 place count 139 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 721 place count 137 transition count 421
Applied a total of 721 rules in 56 ms. Remains 137 /1161 variables (removed 1024) and now considering 421/1852 (removed 1431) transitions.
[2025-06-07 21:45:38] [INFO ] Flow matrix only has 127 transitions (discarded 294 similar events)
// Phase 1: matrix 127 rows 137 cols
[2025-06-07 21:45:38] [INFO ] Computed 49 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:45:38] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-07 21:45:38] [INFO ] Flow matrix only has 127 transitions (discarded 294 similar events)
[2025-06-07 21:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:45:38] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:45:38] [INFO ] Redundant transitions in 4 ms returned []
Running 299 sub problems to find dead transitions.
[2025-06-07 21:45:38] [INFO ] Flow matrix only has 127 transitions (discarded 294 similar events)
[2025-06-07 21:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 126/263 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/264 variables, and 186 constraints, problems are : Problem set: 0 solved, 299 unsolved in 10439 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 126/263 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 299/485 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/264 variables, and 485 constraints, problems are : Problem set: 0 solved, 299 unsolved in 11369 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21843ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 21843ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/1161 places, 421/1852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22279 ms. Remains : 137/1161 places, 421/1852 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-07
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-07 finished in 22347 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))'
Support contains 1 out of 1161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Graph (trivial) has 1236 edges and 1161 vertex of which 753 / 1161 are part of one of the 49 SCC in 2 ms
Free SCC test removed 704 places
Ensure Unique test removed 781 transitions
Reduce isomorphic transitions removed 781 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 456 transition count 935
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 228 rules applied. Total rules applied 364 place count 321 transition count 842
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 410 place count 275 transition count 842
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 452 place count 233 transition count 575
Iterating global reduction 3 with 42 rules applied. Total rules applied 494 place count 233 transition count 575
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 528 place count 233 transition count 541
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 712 place count 141 transition count 449
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 714 place count 139 transition count 430
Iterating global reduction 4 with 2 rules applied. Total rules applied 716 place count 139 transition count 430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 718 place count 139 transition count 428
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 720 place count 137 transition count 426
Applied a total of 720 rules in 65 ms. Remains 137 /1161 variables (removed 1024) and now considering 426/1852 (removed 1426) transitions.
[2025-06-07 21:46:00] [INFO ] Flow matrix only has 128 transitions (discarded 298 similar events)
// Phase 1: matrix 128 rows 137 cols
[2025-06-07 21:46:00] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:46:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-07 21:46:01] [INFO ] Flow matrix only has 128 transitions (discarded 298 similar events)
[2025-06-07 21:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:46:01] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:46:01] [INFO ] Redundant transitions in 3 ms returned []
Running 290 sub problems to find dead transitions.
[2025-06-07 21:46:01] [INFO ] Flow matrix only has 128 transitions (discarded 298 similar events)
[2025-06-07 21:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 2/137 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 127/264 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 186 constraints, problems are : Problem set: 0 solved, 290 unsolved in 10019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 2/137 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 127/264 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 290/476 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 476 constraints, problems are : Problem set: 0 solved, 290 unsolved in 10630 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20680ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 20682ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/1161 places, 426/1852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20979 ms. Remains : 137/1161 places, 426/1852 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-08 finished in 21049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F((p1&&F(p2)&&F(p3))))))))'
Support contains 4 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1145 transition count 1836
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1145 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1137 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1137 transition count 1828
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 1133 transition count 1824
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 1133 transition count 1824
Applied a total of 56 rules in 136 ms. Remains 1133 /1161 variables (removed 28) and now considering 1824/1852 (removed 28) transitions.
// Phase 1: matrix 1824 rows 1133 cols
[2025-06-07 21:46:22] [INFO ] Computed 49 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:46:22] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-06-07 21:46:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:46:23] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1823 sub problems to find dead transitions.
[2025-06-07 21:46:23] [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 1132/2957 variables, and 0 constraints, problems are : Problem set: 0 solved, 1823 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1133 constraints, PredecessorRefiner: 1823/1823 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1823 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 1132/2957 variables, and 0 constraints, problems are : Problem set: 0 solved, 1823 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1133 constraints, PredecessorRefiner: 0/1823 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 1823 unsolved
Search for dead transitions found 0 dead transitions in 60481ms
Starting structural reductions in LTL mode, iteration 1 : 1133/1161 places, 1824/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61759 ms. Remains : 1133/1161 places, 1824/1852 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-09
Stuttering criterion allowed to conclude after 990 steps with 0 reset in 4 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-09 finished in 62138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0||X((X(p1) U (p0&&X(p1)))))) U p2) U p3))'
Support contains 5 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1142 transition count 1833
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1142 transition count 1833
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 1132 transition count 1823
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1132 transition count 1823
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1126 transition count 1817
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1126 transition count 1817
Applied a total of 70 rules in 130 ms. Remains 1126 /1161 variables (removed 35) and now considering 1817/1852 (removed 35) transitions.
// Phase 1: matrix 1817 rows 1126 cols
[2025-06-07 21:47:24] [INFO ] Computed 49 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:47:24] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-06-07 21:47:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:47:25] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Running 1816 sub problems to find dead transitions.
[2025-06-07 21:47:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/2943 variables, and 0 constraints, problems are : Problem set: 0 solved, 1816 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1126 constraints, PredecessorRefiner: 1816/1816 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1816 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 1125/2943 variables, and 0 constraints, problems are : Problem set: 0 solved, 1816 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1126 constraints, PredecessorRefiner: 0/1816 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 1816 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Starting structural reductions in LTL mode, iteration 1 : 1126/1161 places, 1817/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61641 ms. Remains : 1126/1161 places, 1817/1852 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p3), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p2), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-11 finished in 61954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 2 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1144 transition count 1835
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1144 transition count 1835
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1136 transition count 1827
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1136 transition count 1827
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 1131 transition count 1822
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 1131 transition count 1822
Applied a total of 60 rules in 128 ms. Remains 1131 /1161 variables (removed 30) and now considering 1822/1852 (removed 30) transitions.
// Phase 1: matrix 1822 rows 1131 cols
[2025-06-07 21:48:26] [INFO ] Computed 49 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:48:26] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-06-07 21:48:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:48:27] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
Running 1821 sub problems to find dead transitions.
[2025-06-07 21:48:27] [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 1130/2953 variables, and 0 constraints, problems are : Problem set: 0 solved, 1821 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1131 constraints, PredecessorRefiner: 1821/1821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1821 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 1130/2953 variables, and 0 constraints, problems are : Problem set: 0 solved, 1821 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1131 constraints, PredecessorRefiner: 0/1821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 1821 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Starting structural reductions in LTL mode, iteration 1 : 1131/1161 places, 1822/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61613 ms. Remains : 1131/1161 places, 1822/1852 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-12 finished in 61742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F(p1) U p2)))))'
Support contains 4 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1143 transition count 1834
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1143 transition count 1834
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1134 transition count 1825
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1134 transition count 1825
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1129 transition count 1820
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1129 transition count 1820
Applied a total of 64 rules in 136 ms. Remains 1129 /1161 variables (removed 32) and now considering 1820/1852 (removed 32) transitions.
// Phase 1: matrix 1820 rows 1129 cols
[2025-06-07 21:49:27] [INFO ] Computed 49 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:49:28] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-06-07 21:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:49:28] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
Running 1819 sub problems to find dead transitions.
[2025-06-07 21:49:28] [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 1128/2949 variables, and 0 constraints, problems are : Problem set: 0 solved, 1819 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1129 constraints, PredecessorRefiner: 1819/1819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1819 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 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1128/2949 variables, and 0 constraints, problems are : Problem set: 0 solved, 1819 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1129 constraints, PredecessorRefiner: 0/1819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60480ms problems are : Problem set: 0 solved, 1819 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Starting structural reductions in LTL mode, iteration 1 : 1129/1161 places, 1820/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61668 ms. Remains : 1129/1161 places, 1820/1852 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-14 finished in 61881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((((X(p0)&&F((p1 U (p2||G(p1)))))||X(G(p0))) U p3)))))'
Support contains 4 out of 1161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1161/1161 places, 1852/1852 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1144 transition count 1835
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1144 transition count 1835
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1134 transition count 1825
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1134 transition count 1825
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 1128 transition count 1819
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 1128 transition count 1819
Applied a total of 66 rules in 128 ms. Remains 1128 /1161 variables (removed 33) and now considering 1819/1852 (removed 33) transitions.
// Phase 1: matrix 1819 rows 1128 cols
[2025-06-07 21:50:29] [INFO ] Computed 49 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:50:30] [INFO ] Implicit Places using invariants in 340 ms returned []
[2025-06-07 21:50:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:50:30] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Running 1818 sub problems to find dead transitions.
[2025-06-07 21:50:30] [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 1127/2947 variables, and 0 constraints, problems are : Problem set: 0 solved, 1818 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1128 constraints, PredecessorRefiner: 1818/1818 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1818 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 1127/2947 variables, and 0 constraints, problems are : Problem set: 0 solved, 1818 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/49 constraints, State Equation: 0/1128 constraints, PredecessorRefiner: 0/1818 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 1818 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
Starting structural reductions in LTL mode, iteration 1 : 1128/1161 places, 1819/1852 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61686 ms. Remains : 1128/1161 places, 1819/1852 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Champagne-PT-H09T2O-LTLFireability-15
Entered a terminal (fully accepting) state of product in 495 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T2O-LTLFireability-15 finished in 62050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(X(X(p1))))||G(p1))))'
[2025-06-07 21:51:31] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11511450076200830181
[2025-06-07 21:51:31] [INFO ] Too many transitions (1852) to apply POR reductions. Disabling POR matrices.
[2025-06-07 21:51:31] [INFO ] Applying decomposition
[2025-06-07 21:51:31] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11511450076200830181
Running compilation step : cd /tmp/ltsmin11511450076200830181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-07 21:51:31] [INFO ] Flatten gal took : 36 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/graph13184414705086379227.txt' '-o' '/tmp/graph13184414705086379227.bin' '-w' '/tmp/graph13184414705086379227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13184414705086379227.bin' '-l' '-1' '-v' '-w' '/tmp/graph13184414705086379227.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:51:32] [INFO ] Decomposing Gal with order
[2025-06-07 21:51:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:51:32] [INFO ] Removed a total of 1339 redundant transitions.
[2025-06-07 21:51:32] [INFO ] Flatten gal took : 170 ms
[2025-06-07 21:51:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 33 ms.
[2025-06-07 21:51:32] [INFO ] Time to serialize gal into /tmp/LTLFireability15520074216213471714.gal : 31 ms
[2025-06-07 21:51:32] [INFO ] Time to serialize properties into /tmp/LTLFireability5390040609555435042.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/LTLFireability15520074216213471714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5390040609555435042.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 : !((F(((!("((i41.u374.p1520==1)||(i46.u448.p1816==1))"))&&(X(X(X("(i11.u97.p396!=1)")))))||(G("(i11.u97.p396!=1)")))))
Formula 0 simplified : G(F!"(i11.u97.p396!=1)" & ("((i41.u374.p1520==1)||(i46.u448.p1816==1))" | XXX!"(i11.u97.p396!=1)"))
Compilation finished in 3416 ms.
Running link step : cd /tmp/ltsmin11511450076200830181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin11511450076200830181;'/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' '<>(((!(LTLAPp0==true)&&X(X(X((LTLAPp1==true)))))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 510 ms.
FORMULA Champagne-PT-H09T2O-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 967034 ms.

BK_STOP 1749333096026

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H09T2O"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H09T2O, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339300140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H09T2O.tgz
mv Champagne-PT-H09T2O execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;