Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402800090.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LastZero-PT-N10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 28K May 27 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 27 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 27 10:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K May 27 10:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 486K Jun 10 11:58 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 LastZero-PT-N10-CTLFireability-2024-00
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-01
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-02
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-03
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-04
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-05
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-06
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-07
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-08
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-09
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-10
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-11
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-12
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-13
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-14
FORMULA_NAME LastZero-PT-N10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1781099673313

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-06-10 13:54:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 13:54:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 13:54:34] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2026-06-10 13:54:34] [INFO ] Transformed 264 places.
[2026-06-10 13:54:34] [INFO ] Transformed 1531 transitions.
[2026-06-10 13:54:34] [INFO ] Parsed PT model containing 264 places and 1531 transitions and 4793 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 122 places in 7 ms
Reduce places removed 122 places and 981 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA LastZero-PT-N10-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 550/550 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 550
Applied a total of 1 rules in 19 ms. Remains 140 /141 variables (removed 1) and now considering 550/550 (removed 0) transitions.
[2026-06-10 13:54:34] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14938542508055669514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5271303924951029398.kers'
[2026-06-10 13:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14938542508055669514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5271303924951029398.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 505 rows 139 cols 1338 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-06-10 13:54:34] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5271303924951029398.kers
Total runtime 2 ms.
[2026-06-10 13:54:35] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-06-10 13:54:35] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-10 13:54:35] [INFO ] Invariant cache hit.
[2026-06-10 13:54:35] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-06-10 13:54:35] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2026-06-10 13:54:35] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-10 13:54:35] [INFO ] Invariant cache hit.
[2026-06-10 13:54:35] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
At refinement iteration 2 (OVERLAPS) 505/644 variables, 139/149 constraints. Problems are: Problem set: 384 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 110/259 constraints. Problems are: Problem set: 384 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 0/259 constraints. Problems are: Problem set: 384 solved, 156 unsolved
Problem TDEAD311 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/645 variables, 1/260 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/260 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/260 constraints. Problems are: Problem set: 385 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 260 constraints, problems are : Problem set: 385 solved, 155 unsolved in 22539 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 140/140 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 385 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 10/10 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 505/644 variables, 139/149 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 110/259 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 155/414 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 0/414 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 1/645 variables, 1/415 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/415 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/415 constraints. Problems are: Problem set: 385 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 415 constraints, problems are : Problem set: 385 solved, 155 unsolved in 19774 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 140/140 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 155/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42531ms problems are : Problem set: 385 solved, 155 unsolved
Search for dead transitions found 385 dead transitions in 42551ms
Found 385 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 385 transitions
Dead transitions reduction (with SMT) removed 385 transitions
Starting structural reductions in LTL mode, iteration 1 : 140/141 places, 165/550 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 131 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 131 transition count 156
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 123 transition count 148
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 123 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 120 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 120 transition count 142
Applied a total of 40 rules in 12 ms. Remains 120 /140 variables (removed 20) and now considering 142/165 (removed 23) transitions.
[2026-06-10 13:55:18] [INFO ] Flow matrix only has 104 transitions (discarded 38 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5144697043188434820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15268000543098796650.kers'
[2026-06-10 13:55:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5144697043188434820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15268000543098796650.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 104 rows 118 cols 251 entries
Finished phase 1 with 98 SingleSign rule and 2 generalized
[2026-06-10 13:55:18] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15268000543098796650.kers
Total runtime 1 ms.
[2026-06-10 13:55:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-06-10 13:55:18] [INFO ] Flow matrix only has 104 transitions (discarded 38 similar events)
[2026-06-10 13:55:18] [INFO ] Invariant cache hit.
[2026-06-10 13:55:18] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-06-10 13:55:18] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 120/141 places, 142/550 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43886 ms. Remains : 120/141 places, 142/550 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 142/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2026-06-10 13:55:18] [INFO ] Flow matrix only has 104 transitions (discarded 38 similar events)
[2026-06-10 13:55:18] [INFO ] Invariant cache hit.
[2026-06-10 13:55:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-06-10 13:55:18] [INFO ] Flow matrix only has 104 transitions (discarded 38 similar events)
[2026-06-10 13:55:18] [INFO ] Invariant cache hit.
[2026-06-10 13:55:18] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-06-10 13:55:18] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-06-10 13:55:18] [INFO ] Flow matrix only has 104 transitions (discarded 38 similar events)
[2026-06-10 13:55:18] [INFO ] Invariant cache hit.
[2026-06-10 13:55:18] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 104/224 variables, 120/184 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 47/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 231 constraints, problems are : Problem set: 0 solved, 132 unsolved in 9673 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 44/63 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 104/224 variables, 120/187 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 47/234 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 132/366 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 366 constraints, problems are : Problem set: 0 solved, 132 unsolved in 8861 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18548ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 18550ms
Finished structural reductions in LTL mode , in 1 iterations and 18756 ms. Remains : 120/120 places, 142/142 transitions.
Support contains 37 out of 120 places after structural reductions.
[2026-06-10 13:55:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-06-10 13:55:37] [INFO ] Flatten gal took : 31 ms
FORMULA LastZero-PT-N10-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:55:37] [INFO ] Flatten gal took : 13 ms
[2026-06-10 13:55:37] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 25 out of 120 places (down from 37) after GAL structural reductions.
FORMULA LastZero-PT-N10-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1288 resets) in 1424 ms. (28 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (230 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (228 resets) in 136 ms. (292 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (225 resets) in 184 ms. (216 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (229 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (227 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (233 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (227 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (230 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (232 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (226 resets) in 66 ms. (597 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (227 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (229 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
[2026-06-10 13:55:38] [INFO ] Flow matrix only has 104 transitions (discarded 38 similar events)
[2026-06-10 13:55:38] [INFO ] Invariant cache hit.
[2026-06-10 13:55:38] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 47/69 variables, 10/10 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 7/17 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 62/131 variables, 69/86 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 15/101 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/101 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/155 variables, 24/125 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/125 constraints. Problems are: Problem set: 11 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 55/210 variables, 39/164 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 4/168 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 5/173 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/173 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/215 variables, 2/175 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 3/178 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 0/178 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/216 variables, 1/179 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 0/179 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/219 variables, 2/181 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 1/182 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 0/182 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/220 variables, 1/183 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/220 variables, 0/183 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/224 variables, 8/191 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/224 variables, 3/194 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/224 variables, 0/194 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/224 variables, 0/194 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 194 constraints, problems are : Problem set: 11 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/35 variables, 17/19 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/45 variables, 10/29 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/29 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/78 variables, 21/50 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 1/51 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 1/52 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 1/53 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 1/54 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/79 variables, 1/55 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 1/56 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/56 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/81 variables, 1/57 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/81 variables, 0/57 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/82 variables, 1/58 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/82 variables, 0/58 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/86 variables, 5/63 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/86 variables, 1/64 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/88 variables, 1/65 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/90 variables, 1/66 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/90 variables, 0/66 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/92 variables, 1/67 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/92 variables, 0/67 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/94 variables, 1/68 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/94 variables, 0/68 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/96 variables, 1/69 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/96 variables, 0/69 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/98 variables, 1/70 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/98 variables, 0/70 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 28/126 variables, 14/84 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 91/217 variables, 63/147 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/217 variables, 7/154 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/217 variables, 21/175 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/217 variables, 6/181 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/217 variables, 0/181 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 6/223 variables, 6/187 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/223 variables, 6/193 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/223 variables, 0/193 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/224 variables, 1/194 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/224 variables, 1/195 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/224 variables, 0/195 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 0/224 variables, 0/195 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 195 constraints, problems are : Problem set: 11 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/12 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 589ms problems are : Problem set: 11 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 11 atomic propositions for a total of 9 simplifications.
FORMULA LastZero-PT-N10-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:55:39] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 9 ms
FORMULA LastZero-PT-N10-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 9 ms
[2026-06-10 13:55:39] [INFO ] Input system was already deterministic with 142 transitions.
Computed a total of 120 stabilizing places and 142 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 120 transition count 142
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA LastZero-PT-N10-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 112 transition count 130
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 112 transition count 130
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 105 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 105 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 98 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 98 transition count 109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 92 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 92 transition count 101
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 86 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 86 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 81 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 81 transition count 85
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 77 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 77 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 73 transition count 73
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 73 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 70 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 70 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 67 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 67 transition count 64
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 64 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 64 transition count 59
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 62 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 62 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 60 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 60 transition count 53
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 58 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 58 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 57 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 57 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 56 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 56 transition count 48
Applied a total of 128 rules in 24 ms. Remains 56 /120 variables (removed 64) and now considering 48/142 (removed 94) transitions.
[2026-06-10 13:55:39] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3585444124484491302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-911815481331912722.kers'
[2026-06-10 13:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3585444124484491302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-911815481331912722.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 36 rows 49 cols 77 entries
Finished phase 1 with 29 SingleSign rule and 7 generalized
[2026-06-10 13:55:39] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-911815481331912722.kers
Total runtime 1 ms.
[2026-06-10 13:55:39] [INFO ] Implicit Places using invariants in 41 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/120 places, 48/142 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 55/120 places, 48/142 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:55:39] [INFO ] Input system was already deterministic with 48 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7970975897532991219.gal : 1 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8322869126378762503.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7970975897532991219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8322869126378762503.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,134620,0.01876,4100,2,186,5,676,6,0,225,397,0


Converting to forward existential form...Done !
original formula: AF(E(!(AX(FALSE)) U ((array_7_4>=1)&&(lastzero_7>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(!(EX(!(FALSE)))) U ((array_7_4>=1)&&(lastzero_7>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, Intersection with reach...229
(forward)formula 0,1,0.072599,7456,1,0,241,22581,120,130,1358,22389,231
FORMULA LastZero-PT-N10-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 112 transition count 130
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 112 transition count 130
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 105 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 105 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 98 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 98 transition count 109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 92 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 92 transition count 101
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 86 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 86 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 81 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 81 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 76 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 76 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 71 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 71 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 67 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 67 transition count 63
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 110 place count 63 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 63 transition count 58
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 118 place count 59 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 59 transition count 51
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 125 place count 56 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 56 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 130 place count 54 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 54 transition count 44
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 52 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 52 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 51 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 51 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 50 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 50 transition count 39
Applied a total of 140 rules in 13 ms. Remains 50 /120 variables (removed 70) and now considering 39/142 (removed 103) transitions.
[2026-06-10 13:55:39] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4532369876999994801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12075687795628830166.kers'
[2026-06-10 13:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4532369876999994801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12075687795628830166.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 30 rows 40 cols 59 entries
Finished phase 1 with 20 SingleSign rule and 10 generalized
[2026-06-10 13:55:39] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12075687795628830166.kers
Total runtime 0 ms.
[2026-06-10 13:55:39] [INFO ] Implicit Places using invariants in 41 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/120 places, 39/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 49/120 places, 39/142 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Input system was already deterministic with 39 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability5203146230715781749.gal : 0 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability182954283610243938.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5203146230715781749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability182954283610243938.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,88573,0.006652,4108,2,142,5,537,6,0,198,323,0


Converting to forward existential form...Done !
original formula: EF(EX(TRUE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * TRUE)] != FALSE
(forward)formula 0,1,0.007724,4108,1,0,6,658,7,1,351,353,1
FORMULA LastZero-PT-N10-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 142/142 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 113 transition count 131
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 113 transition count 131
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 108 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 108 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 103 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 103 transition count 116
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 99 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 99 transition count 112
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 95 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 95 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 91 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 91 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 88 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 88 transition count 94
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 85 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 83 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 83 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 81 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 81 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 79 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 79 transition count 81
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 77 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 77 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 75 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 75 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 73 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 73 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 72 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 72 transition count 71
Applied a total of 96 rules in 10 ms. Remains 72 /120 variables (removed 48) and now considering 71/142 (removed 71) transitions.
[2026-06-10 13:55:39] [INFO ] Flow matrix only has 54 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5762622299772775051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9383571125649743681.kers'
[2026-06-10 13:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5762622299772775051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9383571125649743681.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 4 ms.
// Phase 1: matrix 54 rows 68 cols 124 entries
Finished phase 1 with 48 SingleSign rule and 4 generalized
[2026-06-10 13:55:39] [INFO ] Computed 20 invariants in 4 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9383571125649743681.kers
Total runtime 5 ms.
[2026-06-10 13:55:39] [INFO ] Implicit Places using invariants in 53 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/120 places, 71/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 71/120 places, 71/142 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:55:39] [INFO ] Input system was already deterministic with 71 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7331548822990414775.gal : 1 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14497677664657309449.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7331548822990414775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14497677664657309449.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,283710,0.013666,4408,2,363,5,1144,6,0,298,656,0


Converting to forward existential form...Done !
original formula: AF(((EX(((array_7_4>=1)&&(lastzero_7>=1))) + ((array_3_1>=1)&&(tmp_3_2>=1))) + ((array_10_6>=1)&&(tmp_10_4>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((array_7_4>=1)&&(lastzero_7>=1))) + ((array_3_1>=1)&&(tmp_3_2>=1))) + ((array_10_6>=1)&&(tmp_...176
Reverse transition relation is NOT exact ! Due to transitions t3, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66,...274
(forward)formula 0,0,0.188962,12928,1,0,298,55392,165,141,1893,53624,246
FORMULA LastZero-PT-N10-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 112 transition count 130
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 112 transition count 130
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 105 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 105 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 98 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 98 transition count 109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 92 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 92 transition count 101
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 86 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 86 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 81 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 81 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 76 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 76 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 71 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 71 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 67 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 67 transition count 63
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 110 place count 63 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 63 transition count 58
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 118 place count 59 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 59 transition count 51
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 125 place count 56 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 56 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 130 place count 54 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 54 transition count 44
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 52 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 52 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 51 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 51 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 50 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 50 transition count 39
Applied a total of 140 rules in 7 ms. Remains 50 /120 variables (removed 70) and now considering 39/142 (removed 103) transitions.
[2026-06-10 13:55:39] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11436375530251780751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15911642276082921058.kers'
[2026-06-10 13:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11436375530251780751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15911642276082921058.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 30 rows 40 cols 59 entries
Finished phase 1 with 20 SingleSign rule and 10 generalized
[2026-06-10 13:55:39] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15911642276082921058.kers
Total runtime 0 ms.
[2026-06-10 13:55:39] [INFO ] Implicit Places using invariants in 38 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/120 places, 39/142 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 49/120 places, 39/142 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Input system was already deterministic with 39 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 1 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 1 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17998162643177924944.gal : 0 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4181638384090578804.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17998162643177924944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4181638384090578804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,88573,0.006496,4108,2,142,5,537,6,0,198,323,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.007053,4108,1,0,6,537,7,1,304,323,1
FORMULA LastZero-PT-N10-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-06-10 13:55:39] [INFO ] Flatten gal took : 10 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 7 ms
Total runtime 65291 ms.

BK_STOP 1781099739796

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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