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-178024402800092.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-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 3.7K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 16 12:27 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 1.7K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 16 12:28 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-LTLFireability-00
FORMULA_NAME LastZero-PT-N10-LTLFireability-01
FORMULA_NAME LastZero-PT-N10-LTLFireability-02
FORMULA_NAME LastZero-PT-N10-LTLFireability-03
FORMULA_NAME LastZero-PT-N10-LTLFireability-04
FORMULA_NAME LastZero-PT-N10-LTLFireability-05
FORMULA_NAME LastZero-PT-N10-LTLFireability-06
FORMULA_NAME LastZero-PT-N10-LTLFireability-07
FORMULA_NAME LastZero-PT-N10-LTLFireability-08
FORMULA_NAME LastZero-PT-N10-LTLFireability-09
FORMULA_NAME LastZero-PT-N10-LTLFireability-10
FORMULA_NAME LastZero-PT-N10-LTLFireability-11
FORMULA_NAME LastZero-PT-N10-LTLFireability-12
FORMULA_NAME LastZero-PT-N10-LTLFireability-13
FORMULA_NAME LastZero-PT-N10-LTLFireability-14
FORMULA_NAME LastZero-PT-N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1781643071183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202604301425
[2026-06-16 20:51:12] [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]
[2026-06-16 20:51:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:51:12] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2026-06-16 20:51:12] [INFO ] Transformed 264 places.
[2026-06-16 20:51:12] [INFO ] Transformed 1531 transitions.
[2026-06-16 20:51:12] [INFO ] Parsed PT model containing 264 places and 1531 transitions and 4793 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
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 3 formulas.
FORMULA LastZero-PT-N10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 32 ms. Remains 140 /141 variables (removed 1) and now considering 550/550 (removed 0) transitions.
[2026-06-16 20:51:12] [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-410651617158833298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18136771700380041534.kers'
[2026-06-16 20:51:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-410651617158833298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18136771700380041534.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-16 20:51:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18136771700380041534.kers
Total runtime 2 ms.
[2026-06-16 20:51:13] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-06-16 20:51:13] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-16 20:51:13] [INFO ] Invariant cache hit.
[2026-06-16 20:51:13] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-06-16 20:51:14] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2026-06-16 20:51:14] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-16 20:51:14] [INFO ] Invariant cache hit.
[2026-06-16 20:51:14] [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 22856 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 19431 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 42532ms 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 132 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 132 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 125 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 125 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 121 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 121 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 119 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 119 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 117 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 117 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 116 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 116 transition count 135
Applied a total of 48 rules in 19 ms. Remains 116 /140 variables (removed 24) and now considering 135/165 (removed 30) transitions.
[2026-06-16 20:51:56] [INFO ] Flow matrix only has 100 transitions (discarded 35 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17176055037779738604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17077935987976183901.kers'
[2026-06-16 20:51:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17176055037779738604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17077935987976183901.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 100 rows 115 cols 243 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-06-16 20:51:56] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17077935987976183901.kers
Total runtime 2 ms.
[2026-06-16 20:51:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-06-16 20:51:56] [INFO ] Flow matrix only has 100 transitions (discarded 35 similar events)
[2026-06-16 20:51:56] [INFO ] Invariant cache hit.
[2026-06-16 20:51:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-06-16 20:51:57] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/141 places, 135/550 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44396 ms. Remains : 116/141 places, 135/550 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-06-16 20:51:57] [INFO ] Flow matrix only has 100 transitions (discarded 35 similar events)
[2026-06-16 20:51:57] [INFO ] Invariant cache hit.
[2026-06-16 20:51:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-16 20:51:57] [INFO ] Flow matrix only has 100 transitions (discarded 35 similar events)
[2026-06-16 20:51:57] [INFO ] Invariant cache hit.
[2026-06-16 20:51:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-06-16 20:51:57] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-06-16 20:51:57] [INFO ] Flow matrix only has 100 transitions (discarded 35 similar events)
[2026-06-16 20:51:57] [INFO ] Invariant cache hit.
[2026-06-16 20:51:57] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 1/116 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 100/216 variables, 116/182 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 45/227 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/216 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 227 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9388 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 46/65 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 1/116 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 100/216 variables, 116/183 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 45/228 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 125/353 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/216 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 353 constraints, problems are : Problem set: 0 solved, 125 unsolved in 7259 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16660ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 16661ms
Finished structural reductions in LTL mode , in 1 iterations and 16906 ms. Remains : 116/116 places, 135/135 transitions.
Support contains 17 out of 116 places after structural reductions.
[2026-06-16 20:52:14] [INFO ] Flatten gal took : 32 ms
[2026-06-16 20:52:14] [INFO ] Flatten gal took : 15 ms
[2026-06-16 20:52:14] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 40000 steps (1288 resets) in 1253 ms. (31 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (226 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (240 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (228 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (227 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (227 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (229 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (222 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (228 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (230 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 915820 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :1 out of 9
Probabilistic random walk after 915820 steps, saw 155597 distinct states, run finished after 3007 ms. (steps per millisecond=304 ) properties seen :1
[2026-06-16 20:52:18] [INFO ] Flow matrix only has 100 transitions (discarded 35 similar events)
[2026-06-16 20:52:18] [INFO ] Invariant cache hit.
[2026-06-16 20:52:18] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 47/62 variables, 10/10 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 5/15 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 56/118 variables, 62/77 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 13/90 constraints. Problems are: Problem set: 7 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/90 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/139 variables, 21/111 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/111 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/178 variables, 31/142 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 1/143 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 2/145 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/145 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/180 variables, 3/148 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 2/150 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/180 variables, 0/150 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/182 variables, 1/151 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/151 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/184 variables, 1/152 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/184 variables, 0/152 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/186 variables, 1/153 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/186 variables, 0/153 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/192 variables, 6/159 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/159 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 21/213 variables, 15/174 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/213 variables, 3/177 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/213 variables, 3/180 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/213 variables, 0/180 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/215 variables, 2/182 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/215 variables, 2/184 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/215 variables, 0/184 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/216 variables, 1/185 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/216 variables, 1/186 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/216 variables, 0/186 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/216 variables, 0/186 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 186 constraints, problems are : Problem set: 7 solved, 1 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/16 variables, 3/12 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/31 variables, 7/19 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 1/20 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 2/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/31 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/40 variables, 2/25 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/40 variables, 3/28 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/40 variables, 0/28 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/47 variables, 7/35 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/47 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/49 variables, 1/36 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/49 variables, 0/36 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/51 variables, 1/37 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/51 variables, 0/37 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/53 variables, 1/38 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/53 variables, 0/38 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/55 variables, 1/39 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/55 variables, 0/39 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/57 variables, 1/40 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/57 variables, 0/40 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/59 variables, 1/41 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/61 variables, 1/42 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/61 variables, 0/42 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 35/96 variables, 14/56 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/96 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 112/208 variables, 77/133 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/208 variables, 8/141 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/208 variables, 27/168 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/208 variables, 2/170 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/208 variables, 0/170 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 7/215 variables, 7/177 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/215 variables, 7/184 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/215 variables, 1/185 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/215 variables, 0/185 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 1/216 variables, 1/186 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/216 variables, 1/187 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/216 variables, 0/187 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/216 variables, 0/187 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 187 constraints, problems are : Problem set: 7 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 664ms problems are : Problem set: 7 solved, 1 unsolved
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 7 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 116 stabilizing places and 135 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 135
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
All properties solved by simple procedures.
Total runtime 66386 ms.

BK_STOP 1781643138800

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="LastZero-PT-N10"
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-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N10, 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 r354-tall-178024402800092"
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 [ "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 ;