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

--------------------
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-LTLCardinality-00
FORMULA_NAME LastZero-PT-N10-LTLCardinality-01
FORMULA_NAME LastZero-PT-N10-LTLCardinality-02
FORMULA_NAME LastZero-PT-N10-LTLCardinality-03
FORMULA_NAME LastZero-PT-N10-LTLCardinality-04
FORMULA_NAME LastZero-PT-N10-LTLCardinality-05
FORMULA_NAME LastZero-PT-N10-LTLCardinality-06
FORMULA_NAME LastZero-PT-N10-LTLCardinality-07
FORMULA_NAME LastZero-PT-N10-LTLCardinality-08
FORMULA_NAME LastZero-PT-N10-LTLCardinality-09
FORMULA_NAME LastZero-PT-N10-LTLCardinality-10
FORMULA_NAME LastZero-PT-N10-LTLCardinality-11
FORMULA_NAME LastZero-PT-N10-LTLCardinality-12
FORMULA_NAME LastZero-PT-N10-LTLCardinality-13
FORMULA_NAME LastZero-PT-N10-LTLCardinality-14
FORMULA_NAME LastZero-PT-N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781642949227

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-06-16 20:49:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 20:49:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:49:10] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-06-16 20:49:10] [INFO ] Transformed 264 places.
[2026-06-16 20:49:10] [INFO ] Transformed 1531 transitions.
[2026-06-16 20:49:10] [INFO ] Parsed PT model containing 264 places and 1531 transitions and 4793 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
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.
FORMULA LastZero-PT-N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 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 21 ms. Remains 140 /141 variables (removed 1) and now considering 550/550 (removed 0) transitions.
[2026-06-16 20:49:10] [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-5128654273210859374.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12402360808438967219.kers'
[2026-06-16 20:49:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5128654273210859374.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12402360808438967219.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:49:10] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12402360808438967219.kers
Total runtime 2 ms.
[2026-06-16 20:49:11] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-06-16 20:49:11] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-16 20:49:11] [INFO ] Invariant cache hit.
[2026-06-16 20:49:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-06-16 20:49:12] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1359 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/141 places, 550/550 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1411 ms. Remains : 139/141 places, 550/550 transitions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 550/550 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2026-06-16 20:49: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-1662949216140796408.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7540714353553218667.kers'
[2026-06-16 20:49:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1662949216140796408.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7540714353553218667.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 505 rows 138 cols 1328 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-06-16 20:49:12] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7540714353553218667.kers
Total runtime 2 ms.
[2026-06-16 20:49:12] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-06-16 20:49:12] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-16 20:49:12] [INFO ] Invariant cache hit.
[2026-06-16 20:49:12] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-06-16 20:49:13] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2026-06-16 20:49:13] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-16 20:49:13] [INFO ] Invariant cache hit.
[2026-06-16 20:49:13] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/9 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/643 variables, 138/147 constraints. Problems are: Problem set: 384 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 110/257 constraints. Problems are: Problem set: 384 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 0/257 constraints. Problems are: Problem set: 384 solved, 156 unsolved
Problem TDEAD311 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/644 variables, 1/258 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 0/258 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/644 variables, 0/258 constraints. Problems are: Problem set: 385 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 258 constraints, problems are : Problem set: 385 solved, 155 unsolved in 21927 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 139/139 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/138 variables, 9/9 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/9 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 505/643 variables, 138/147 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 110/257 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 155/412 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/412 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 1/644 variables, 1/413 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 385 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 413 constraints, problems are : Problem set: 385 solved, 155 unsolved in 18011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 139/139 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 155/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40158ms problems are : Problem set: 385 solved, 155 unsolved
Search for dead transitions found 385 dead transitions in 40180ms
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 : 139/139 places, 165/550 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 131 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 131 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 125 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 125 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 120 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 120 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 116 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 116 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 113 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 113 transition count 131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 110 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 108 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 108 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 106 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 106 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 104 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 104 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 102 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 102 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 101 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 101 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 100 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 100 transition count 113
Applied a total of 78 rules in 24 ms. Remains 100 /139 variables (removed 39) and now considering 113/165 (removed 52) transitions.
[2026-06-16 20:49:53] [INFO ] Flow matrix only has 84 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11909872414633056326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10588579266609150715.kers'
[2026-06-16 20:49:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11909872414633056326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10588579266609150715.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 84 rows 99 cols 199 entries
Finished phase 1 with 80 SingleSign rule and 1 generalized
[2026-06-16 20:49:53] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10588579266609150715.kers
Total runtime 0 ms.
[2026-06-16 20:49:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-16 20:49:53] [INFO ] Flow matrix only has 84 transitions (discarded 29 similar events)
[2026-06-16 20:49:53] [INFO ] Invariant cache hit.
[2026-06-16 20:49:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-06-16 20:49:53] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/139 places, 113/550 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41325 ms. Remains : 100/139 places, 113/550 transitions.
Support contains 16 out of 100 places after structural reductions.
[2026-06-16 20:49:53] [INFO ] Flatten gal took : 26 ms
[2026-06-16 20:49:53] [INFO ] Flatten gal took : 11 ms
[2026-06-16 20:49:53] [INFO ] Input system was already deterministic with 113 transitions.
RANDOM walk for 40000 steps (1288 resets) in 953 ms. (41 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40003 steps (227 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (227 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (228 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (229 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (226 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (226 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
[2026-06-16 20:49:54] [INFO ] Flow matrix only has 84 transitions (discarded 29 similar events)
[2026-06-16 20:49:54] [INFO ] Invariant cache hit.
[2026-06-16 20:49:54] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/38 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3/41 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 38/79 variables, 41/51 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 7/58 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/83 variables, 2/60 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/85 variables, 1/61 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/87 variables, 1/62 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/87 variables, 1/63 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/87 variables, 0/63 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/89 variables, 1/64 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/89 variables, 1/65 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/89 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/91 variables, 1/66 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/93 variables, 1/67 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/93 variables, 1/68 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/93 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/95 variables, 1/69 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/95 variables, 1/70 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/95 variables, 0/70 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 1/96 variables, 1/71 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/96 variables, 0/71 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 23/119 variables, 17/88 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/119 variables, 0/88 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 60/179 variables, 45/133 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/179 variables, 7/140 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/179 variables, 9/149 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/179 variables, 0/149 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 4/183 variables, 4/153 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/183 variables, 4/157 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/183 variables, 0/157 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 1/184 variables, 1/158 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/184 variables, 1/159 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/184 variables, 0/159 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 0/184 variables, 0/159 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 159 constraints, problems are : Problem set: 4 solved, 2 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/19 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 19/22 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/52 variables, 13/35 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 45/97 variables, 28/63 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 2/65 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 6/71 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 2/73 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 3/76 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/76 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/105 variables, 3/79 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/105 variables, 6/85 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/105 variables, 0/85 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/106 variables, 1/86 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/106 variables, 0/86 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/110 variables, 5/91 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/110 variables, 1/92 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/110 variables, 0/92 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/112 variables, 1/93 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/112 variables, 0/93 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/114 variables, 1/94 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/114 variables, 0/94 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/116 variables, 1/95 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/116 variables, 0/95 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/118 variables, 1/96 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/118 variables, 0/96 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 14/132 variables, 8/104 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/132 variables, 0/104 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 47/179 variables, 33/137 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/179 variables, 5/142 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/179 variables, 9/151 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/179 variables, 0/151 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 4/183 variables, 4/155 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/183 variables, 4/159 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/183 variables, 0/159 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 1/184 variables, 1/160 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/184 variables, 1/161 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/184 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 0/184 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 161 constraints, problems are : Problem set: 4 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 4 solved, 2 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 2 properties in 8 ms.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
FORMULA LastZero-PT-N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 100 stabilizing places and 113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 100 transition count 113
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LastZero-PT-N10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p0)))'
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 91 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 91 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 87 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 87 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 83 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 83 transition count 89
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 79 transition count 83
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 77 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 77 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 75 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 75 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 73 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 73 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 71 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 71 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 69 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 69 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 67 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 67 transition count 65
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 65 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 65 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 63 transition count 59
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 63 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 62 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 62 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 60 transition count 55
Applied a total of 80 rules in 9 ms. Remains 60 /100 variables (removed 40) and now considering 55/113 (removed 58) transitions.
[2026-06-16 20:49:55] [INFO ] Flow matrix only has 42 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1356375727858854446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3912472497949282955.kers'
[2026-06-16 20:49:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1356375727858854446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3912472497949282955.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 42 rows 56 cols 93 entries
Finished phase 1 with 37 SingleSign rule and 4 generalized
[2026-06-16 20:49:55] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3912472497949282955.kers
Total runtime 0 ms.
[2026-06-16 20:49:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-06-16 20:49:55] [INFO ] Flow matrix only has 42 transitions (discarded 13 similar events)
[2026-06-16 20:49:55] [INFO ] Invariant cache hit.
[2026-06-16 20:49:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-06-16 20:49:55] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2026-06-16 20:49:55] [INFO ] Flow matrix only has 42 transitions (discarded 13 similar events)
[2026-06-16 20:49:55] [INFO ] Invariant cache hit.
[2026-06-16 20:49:55] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 42/102 variables, 60/85 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 16/101 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 101 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 42/102 variables, 60/85 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 16/101 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 45/146 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 146 constraints, problems are : Problem set: 0 solved, 45 unsolved in 823 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1900ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1902ms
Starting structural reductions in LTL mode, iteration 1 : 60/100 places, 55/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2016 ms. Remains : 60/100 places, 55/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p0)))'
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N10-LTLCardinality-01
Product exploration explored 100000 steps with 3225 reset in 225 ms.
Product exploration explored 100000 steps with 3225 reset in 160 ms.
Computed a total of 60 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 48 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (1288 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (227 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 93001 steps, run visited all 1 properties in 148 ms. (steps per millisecond=628 )
Probabilistic random walk after 93001 steps, saw 15809 distinct states, run finished after 151 ms. (steps per millisecond=615 ) properties seen :1
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 4 factoid took 35 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 355 ms.
FORMULA LastZero-PT-N10-LTLCardinality-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property LastZero-PT-N10-LTLCardinality-01 finished in 3021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 91 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 91 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 87 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 87 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 83 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 83 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 80 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 80 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 78 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 78 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 76 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 76 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 74 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 74 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 72 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 72 transition count 73
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 70 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 70 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 68 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 68 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 66 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 66 transition count 64
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 64 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 64 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 63 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 63 transition count 60
Applied a total of 74 rules in 16 ms. Remains 63 /100 variables (removed 37) and now considering 60/113 (removed 53) transitions.
[2026-06-16 20:49:58] [INFO ] Flow matrix only has 44 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16201303967273580467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1442751961629469688.kers'
[2026-06-16 20:49:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16201303967273580467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1442751961629469688.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 61 cols 101 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-06-16 20:49:58] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1442751961629469688.kers
Total runtime 0 ms.
[2026-06-16 20:49:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-06-16 20:49:58] [INFO ] Flow matrix only has 44 transitions (discarded 16 similar events)
[2026-06-16 20:49:58] [INFO ] Invariant cache hit.
[2026-06-16 20:49:58] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-06-16 20:49:58] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2026-06-16 20:49:58] [INFO ] Flow matrix only has 44 transitions (discarded 16 similar events)
[2026-06-16 20:49:58] [INFO ] Invariant cache hit.
[2026-06-16 20:49:58] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 44/107 variables, 63/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 17/106 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/107 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 106 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 44/107 variables, 63/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 17/106 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 50/156 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 156 constraints, problems are : Problem set: 0 solved, 50 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2197ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2197ms
Starting structural reductions in LTL mode, iteration 1 : 63/100 places, 60/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2323 ms. Remains : 63/100 places, 60/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LastZero-PT-N10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LastZero-PT-N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N10-LTLCardinality-06 finished in 2447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 94 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 94 transition count 106
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 90 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 90 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 86 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 86 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 82 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 82 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 78 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 78 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 75 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 75 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 72 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 72 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 69 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 69 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 66 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 66 transition count 64
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 63 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 63 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 61 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 61 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 59 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 59 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 57 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 57 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 56 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 56 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 55 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 55 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 54 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 54 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 53 transition count 46
Applied a total of 92 rules in 26 ms. Remains 53 /100 variables (removed 47) and now considering 46/113 (removed 67) transitions.
[2026-06-16 20:50:00] [INFO ] Flow matrix only has 34 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-6274853287693035536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16435968125641179299.kers'
[2026-06-16 20:50:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6274853287693035536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16435968125641179299.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 34 rows 45 cols 71 entries
Finished phase 1 with 29 SingleSign rule and 5 generalized
[2026-06-16 20:50:00] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16435968125641179299.kers
Total runtime 0 ms.
[2026-06-16 20:50:00] [INFO ] Implicit Places using invariants in 38 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/100 places, 46/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68 ms. Remains : 52/100 places, 46/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N10-LTLCardinality-09
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA LastZero-PT-N10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N10-LTLCardinality-09 finished in 152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 91 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 91 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 87 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 87 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 83 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 83 transition count 89
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 79 transition count 83
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 76 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 76 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 73 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 73 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 70 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 70 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 67 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 67 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 64 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 64 transition count 61
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 61 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 61 transition count 56
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 58 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 58 transition count 52
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 55 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 55 transition count 47
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 53 transition count 45
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 53 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 52 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 52 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 51 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 51 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 50 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 50 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 49 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 49 transition count 39
Applied a total of 102 rules in 10 ms. Remains 49 /100 variables (removed 51) and now considering 39/113 (removed 74) transitions.
[2026-06-16 20:50:00] [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-2529305847167400125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10865538317358959661.kers'
[2026-06-16 20:50:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2529305847167400125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10865538317358959661.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 30 rows 40 cols 59 entries
Finished phase 1 with 21 SingleSign rule and 9 generalized
[2026-06-16 20:50:00] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10865538317358959661.kers
Total runtime 0 ms.
[2026-06-16 20:50:00] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-06-16 20:50:00] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
[2026-06-16 20:50:00] [INFO ] Invariant cache hit.
[2026-06-16 20:50:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-16 20:50:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2026-06-16 20:50:00] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
[2026-06-16 20:50:00] [INFO ] Invariant cache hit.
[2026-06-16 20:50:00] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 30/79 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 78 constraints, problems are : Problem set: 0 solved, 29 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 30/79 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 29/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 107 constraints, problems are : Problem set: 0 solved, 29 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 812ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 812ms
Starting structural reductions in LTL mode, iteration 1 : 49/100 places, 39/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 913 ms. Remains : 49/100 places, 39/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LastZero-PT-N10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 49 stabilizing places and 39 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 39
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 9 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 41 ms.
FORMULA LastZero-PT-N10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-PT-N10-LTLCardinality-10 finished in 1338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)||X(F(p2))))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 111
Applied a total of 4 rules in 2 ms. Remains 98 /100 variables (removed 2) and now considering 111/113 (removed 2) transitions.
[2026-06-16 20:50:01] [INFO ] Flow matrix only has 80 transitions (discarded 31 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16702972976369361310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17356155184803630947.kers'
[2026-06-16 20:50:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16702972976369361310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17356155184803630947.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 97 cols 190 entries
Finished phase 1 with 78 SingleSign rule and 1 generalized
[2026-06-16 20:50:01] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17356155184803630947.kers
Total runtime 0 ms.
[2026-06-16 20:50:01] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-06-16 20:50:01] [INFO ] Flow matrix only has 80 transitions (discarded 31 similar events)
[2026-06-16 20:50:02] [INFO ] Invariant cache hit.
[2026-06-16 20:50:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-06-16 20:50:02] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-06-16 20:50:02] [INFO ] Flow matrix only has 80 transitions (discarded 31 similar events)
[2026-06-16 20:50:02] [INFO ] Invariant cache hit.
[2026-06-16 20:50:02] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 80/178 variables, 98/150 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 35/185 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 185 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5356 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 80/178 variables, 98/150 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 35/185 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 101/286 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 286 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3617 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8982ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 8982ms
Starting structural reductions in LTL mode, iteration 1 : 98/100 places, 111/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9151 ms. Remains : 98/100 places, 111/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)||X(F(p2))))))'
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LastZero-PT-N10-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 98 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 9 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 49 ms.
FORMULA LastZero-PT-N10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-PT-N10-LTLCardinality-13 finished in 9587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 94 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 94 transition count 106
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 90 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 90 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 86 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 86 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 82 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 82 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 78 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 78 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 75 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 75 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 72 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 72 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 69 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 69 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 66 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 66 transition count 64
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 63 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 63 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 60 transition count 55
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 60 transition count 55
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 57 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 57 transition count 51
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 54 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 54 transition count 46
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 52 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 52 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 51 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 51 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 50 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 50 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 49 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 49 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 48 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 48 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 47 transition count 37
Applied a total of 104 rules in 20 ms. Remains 47 /100 variables (removed 53) and now considering 37/113 (removed 76) transitions.
[2026-06-16 20:50:11] [INFO ] Flow matrix only has 28 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-16793086022122400685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10425633169712288873.kers'
[2026-06-16 20:50:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16793086022122400685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10425633169712288873.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 28 rows 36 cols 53 entries
Finished phase 1 with 20 SingleSign rule and 8 generalized
[2026-06-16 20:50:11] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10425633169712288873.kers
Total runtime 0 ms.
[2026-06-16 20:50:11] [INFO ] Implicit Places using invariants in 34 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/100 places, 37/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57 ms. Remains : 46/100 places, 37/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N10-LTLCardinality-14
Product exploration explored 100000 steps with 3819 reset in 119 ms.
Product exploration explored 100000 steps with 3814 reset in 179 ms.
Computed a total of 46 stabilizing places and 37 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 37
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 87 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 227 ms.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2026-06-16 20:50:12] [INFO ] Flow matrix only has 28 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-12427222865743509689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18123912159850035303.kers'
[2026-06-16 20:50:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12427222865743509689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18123912159850035303.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 28 rows 36 cols 53 entries
Finished phase 1 with 20 SingleSign rule and 8 generalized
[2026-06-16 20:50:12] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18123912159850035303.kers
Total runtime 1 ms.
[2026-06-16 20:50:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-06-16 20:50:12] [INFO ] Flow matrix only has 28 transitions (discarded 9 similar events)
[2026-06-16 20:50:12] [INFO ] Invariant cache hit.
[2026-06-16 20:50:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-16 20:50:12] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2026-06-16 20:50:12] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2026-06-16 20:50:12] [INFO ] Flow matrix only has 28 transitions (discarded 9 similar events)
[2026-06-16 20:50:12] [INFO ] Invariant cache hit.
[2026-06-16 20:50:12] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/74 variables, 46/64 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 74 constraints, problems are : Problem set: 0 solved, 27 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/74 variables, 46/64 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/74 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 101 constraints, problems are : Problem set: 0 solved, 27 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 763ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 764ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 859 ms. Remains : 46/46 places, 37/37 transitions.
Computed a total of 46 stabilizing places and 37 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 37
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 50 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 86 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 224 ms.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3797 reset in 123 ms.
Product exploration explored 100000 steps with 3812 reset in 128 ms.
Built C files in :
/tmp/ltsmin15527888374475739505
[2026-06-16 20:50:13] [INFO ] Computing symmetric may disable matrix : 37 transitions.
[2026-06-16 20:50:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 20:50:13] [INFO ] Computing symmetric may enable matrix : 37 transitions.
[2026-06-16 20:50:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 20:50:13] [INFO ] Computing Do-Not-Accords matrix : 37 transitions.
[2026-06-16 20:50:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 20:50:13] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15527888374475739505
Running compilation step : cd /tmp/ltsmin15527888374475739505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin15527888374475739505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15527888374475739505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14212289453498915433.hoa' '--buchi-type=spotba'
LTSmin run took 36 ms.
FORMULA LastZero-PT-N10-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LastZero-PT-N10-LTLCardinality-14 finished in 2604 ms.
All properties solved by simple procedures.
Total runtime 63758 ms.

BK_STOP 1781643014488

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800091"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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