MCC'2026- Execution of r354-tall-178024402700019

About the Execution of ITS-Tools for LastZero-COL-N12

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1385.451	492944.00	588548.00	1260.30	FFTTFTFTFTFFTTTF	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 9.3K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 27 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 27 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 7.6K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_pt
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 5 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 32K Jun 10 17:28 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-COL-N12-LTLCardinality-00
FORMULA_NAME LastZero-COL-N12-LTLCardinality-01
FORMULA_NAME LastZero-COL-N12-LTLCardinality-02
FORMULA_NAME LastZero-COL-N12-LTLCardinality-03
FORMULA_NAME LastZero-COL-N12-LTLCardinality-04
FORMULA_NAME LastZero-COL-N12-LTLCardinality-05
FORMULA_NAME LastZero-COL-N12-LTLCardinality-06
FORMULA_NAME LastZero-COL-N12-LTLCardinality-07
FORMULA_NAME LastZero-COL-N12-LTLCardinality-08
FORMULA_NAME LastZero-COL-N12-LTLCardinality-09
FORMULA_NAME LastZero-COL-N12-LTLCardinality-10
FORMULA_NAME LastZero-COL-N12-LTLCardinality-11
FORMULA_NAME LastZero-COL-N12-LTLCardinality-12
FORMULA_NAME LastZero-COL-N12-LTLCardinality-13
FORMULA_NAME LastZero-COL-N12-LTLCardinality-14
FORMULA_NAME LastZero-COL-N12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781118295865

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-COL-N12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-06-10 19:04:56] [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-10 19:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 19:04:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-06-10 19:04:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-06-10 19:04:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 504 ms
[2026-06-10 19:04:57] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 364 PT places and 2535.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2026-06-10 19:04:57] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 11 arcs in 4 ms.
[2026-06-10 19:04:57] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA LastZero-COL-N12-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N12-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 2 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA LastZero-COL-N12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N12-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40012 steps (1480 resets) in 299 ms. (133 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40000 steps (848 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (848 resets) in 381 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (832 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (832 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16128692362813302231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1892866821284247081.kers'
[2026-06-10 19:04:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16128692362813302231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1892866821284247081.kers]
Normalized transition count is 2 out of 3 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 2 rows 2 cols 3 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-06-10 19:04:58] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1892866821284247081.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 2 constraints, problems are : Problem set: 4 solved, 0 unsolved in 147 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA LastZero-COL-N12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 19:04:58] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2026-06-10 19:04:58] [INFO ] Flatten gal took : 13 ms
FORMULA LastZero-COL-N12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N12-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N12-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N12-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 19:04:58] [INFO ] Flatten gal took : 1 ms
Domain [ID(13), ID(13)] of place array breaks symmetries in sort ID
[2026-06-10 19:04:58] [INFO ] Unfolded HLPN to a Petri net with 364 places and 2485 transitions 7743 arcs in 43 ms.
[2026-06-10 19:04:58] [INFO ] Unfolded 5 HLPN properties in 1 ms.
Deduced a syphon composed of 170 places in 13 ms
Reduce places removed 170 places and 1601 transitions.
Reduce places removed 1 places and 0 transitions.
Support contains 90 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 884/884 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 884
Applied a total of 1 rules in 19 ms. Remains 192 /193 variables (removed 1) and now considering 884/884 (removed 0) transitions.
[2026-06-10 19:04:58] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18005413624992069746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-570335831858853558.kers'
[2026-06-10 19:04:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18005413624992069746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-570335831858853558.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 818 rows 191 cols 2206 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-10 19:04:58] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-570335831858853558.kers
Total runtime 3 ms.
[2026-06-10 19:04:58] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-06-10 19:04:58] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-10 19:04:58] [INFO ] Invariant cache hit.
[2026-06-10 19:04:59] [INFO ] State equation strengthened by 156 read => feed constraints.
[2026-06-10 19:05:00] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1572 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/193 places, 884/884 transitions.
Applied a total of 0 rules in 13 ms. Remains 191 /191 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1613 ms. Remains : 191/193 places, 884/884 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 884/884 transitions.
Applied a total of 0 rules in 4 ms. Remains 191 /191 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2026-06-10 19:05:00] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4506868427888773820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5623421603492149145.kers'
[2026-06-10 19:05:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4506868427888773820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5623421603492149145.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 818 rows 190 cols 2194 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-10 19:05:00] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5623421603492149145.kers
Total runtime 2 ms.
[2026-06-10 19:05:00] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-06-10 19:05:00] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-10 19:05:00] [INFO ] Invariant cache hit.
[2026-06-10 19:05:00] [INFO ] State equation strengthened by 156 read => feed constraints.
[2026-06-10 19:05:01] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Running 872 sub problems to find dead transitions.
[2026-06-10 19:05:01] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-10 19:05:01] [INFO ] Invariant cache hit.
[2026-06-10 19:05:01] [INFO ] State equation strengthened by 156 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 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 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 TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 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 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 TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 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 TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 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 TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 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 TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 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 TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 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 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
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
At refinement iteration 2 (OVERLAPS) 818/1008 variables, 190/201 constraints. Problems are: Problem set: 649 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1008 variables, 156/357 constraints. Problems are: Problem set: 649 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1008 variables, 0/357 constraints. Problems are: Problem set: 649 solved, 223 unsolved
SMT process timed out in 30349ms, After SMT, problems are : Problem set: 649 solved, 223 unsolved
Search for dead transitions found 649 dead transitions in 30359ms
Found 649 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 649 transitions
Dead transitions reduction (with SMT) removed 649 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/191 places, 235/884 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 180 transition count 224
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 180 transition count 224
Applied a total of 22 rules in 7 ms. Remains 180 /191 variables (removed 11) and now considering 224/235 (removed 11) transitions.
[2026-06-10 19:05:31] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12002481079298605467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17875961369533985283.kers'
[2026-06-10 19:05:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12002481079298605467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17875961369533985283.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 169 rows 179 cols 401 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-06-10 19:05:31] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17875961369533985283.kers
Total runtime 1 ms.
[2026-06-10 19:05:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-06-10 19:05:31] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:05:31] [INFO ] Invariant cache hit.
[2026-06-10 19:05:31] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-06-10 19:05:32] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 180/191 places, 224/884 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31939 ms. Remains : 180/191 places, 224/884 transitions.
Support contains 90 out of 180 places after structural reductions.
[2026-06-10 19:05:32] [INFO ] Flatten gal took : 29 ms
[2026-06-10 19:05:32] [INFO ] Flatten gal took : 22 ms
[2026-06-10 19:05:32] [INFO ] Input system was already deterministic with 224 transitions.
RANDOM walk for 40000 steps (1080 resets) in 604 ms. (66 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (141 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
[2026-06-10 19:05:32] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:05:32] [INFO ] Invariant cache hit.
[2026-06-10 19:05:32] [INFO ] State equation strengthened by 79 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 77/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/165 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 157/322 variables, 165/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 67/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 325/349 variables, and 278 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, State Equation: 168/180 constraints, ReadFeed: 67/79 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1868ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 180 stabilizing places and 224 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 180 transition count 224
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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' '!(F(!p0))'
Support contains 90 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 224/224 transitions.
Applied a total of 0 rules in 16 ms. Remains 180 /180 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2026-06-10 19:05:34] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:05:34] [INFO ] Invariant cache hit.
[2026-06-10 19:05:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-06-10 19:05:34] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:05:34] [INFO ] Invariant cache hit.
[2026-06-10 19:05:34] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-06-10 19:05:34] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2026-06-10 19:05:34] [INFO ] Redundant transitions in 12 ms returned []
Running 212 sub problems to find dead transitions.
[2026-06-10 19:05:34] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:05:34] [INFO ] Invariant cache hit.
[2026-06-10 19:05:34] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 169/348 variables, 179/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 79/354 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Problem TDEAD79 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/355 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/349 variables, and 355 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 180/180 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 74/96 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 5/101 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 10/111 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/113 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 169/348 variables, 179/292 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 79/371 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 211/582 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/582 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/583 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/583 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 583 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 180/180 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 211/212 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60042ms problems are : Problem set: 1 solved, 211 unsolved
Search for dead transitions found 1 dead transitions in 60043ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/180 places, 223/224 transitions.
Applied a total of 0 rules in 12 ms. Remains 180 /180 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-06-10 19:06:34] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 60433 ms. Remains : 180/180 places, 223/224 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' '!(F(p0))'
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : LastZero-COL-N12-LTLCardinality-03
Product exploration explored 100000 steps with 5193 reset in 446 ms.
Product exploration explored 100000 steps with 5198 reset in 435 ms.
Computed a total of 180 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 180 transition count 223
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 66 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2026-06-10 19:06:36] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14088380672515278790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4218596068674929337.kers'
[2026-06-10 19:06:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14088380672515278790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4218596068674929337.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 168 rows 179 cols 400 entries
Finished phase 1 with 156 SingleSign rule and 1 generalized
[2026-06-10 19:06:36] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4218596068674929337.kers
Total runtime 1 ms.
[2026-06-10 19:06:37] [INFO ] [Real]Absence check using 22 positive place invariants in 28 ms returned sat
[2026-06-10 19:06:37] [INFO ] [Real]Absence check using 22 positive and 1 generalized place invariants in 7 ms returned sat
[2026-06-10 19:06:37] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-06-10 19:06:37] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:06:38] [INFO ] [Nat]Absence check using 22 positive place invariants in 34 ms returned sat
[2026-06-10 19:06:38] [INFO ] [Nat]Absence check using 22 positive and 1 generalized place invariants in 4 ms returned sat
[2026-06-10 19:06:38] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2026-06-10 19:06:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-06-10 19:06:38] [INFO ] [Nat]Added 78 Read/Feed constraints in 46 ms returned sat
[2026-06-10 19:06:38] [INFO ] Computed and/alt/rep : 154/164/148 causal constraints (skipped 8 transitions) in 12 ms.
[2026-06-10 19:06:38] [INFO ] Added : 16 causal constraints over 4 iterations in 106 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2846 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 90 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 223/223 transitions.
Applied a total of 0 rules in 11 ms. Remains 180 /180 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-06-10 19:06:38] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:06:38] [INFO ] Invariant cache hit.
[2026-06-10 19:06:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-10 19:06:38] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:06:38] [INFO ] Invariant cache hit.
[2026-06-10 19:06:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-06-10 19:06:39] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2026-06-10 19:06:39] [INFO ] Redundant transitions in 3 ms returned []
Running 211 sub problems to find dead transitions.
[2026-06-10 19:06:39] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:06:39] [INFO ] Invariant cache hit.
[2026-06-10 19:06:39] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 168/348 variables, 180/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 78/355 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 12 (OVERLAPS) 0/348 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 355 constraints, problems are : Problem set: 0 solved, 211 unsolved in 28028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 74/96 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 168/348 variables, 180/283 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 78/361 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 211/572 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 12 (OVERLAPS) 0/348 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 572 constraints, problems are : Problem set: 0 solved, 211 unsolved in 25244 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53299ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 53300ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53667 ms. Remains : 180/180 places, 223/223 transitions.
Computed a total of 180 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 180 transition count 223
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 43 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2026-06-10 19:07:32] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:07:32] [INFO ] Invariant cache hit.
[2026-06-10 19:07:33] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2026-06-10 19:07:33] [INFO ] [Real]Absence check using 22 positive and 1 generalized place invariants in 3 ms returned sat
[2026-06-10 19:07:34] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-06-10 19:07:34] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:07:34] [INFO ] [Nat]Absence check using 22 positive place invariants in 36 ms returned sat
[2026-06-10 19:07:34] [INFO ] [Nat]Absence check using 22 positive and 1 generalized place invariants in 11 ms returned sat
[2026-06-10 19:07:35] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2026-06-10 19:07:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-06-10 19:07:35] [INFO ] [Nat]Added 78 Read/Feed constraints in 39 ms returned sat
[2026-06-10 19:07:35] [INFO ] Computed and/alt/rep : 154/164/148 causal constraints (skipped 8 transitions) in 8 ms.
[2026-06-10 19:07:35] [INFO ] Added : 16 causal constraints over 4 iterations in 89 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2778 ms.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5207 reset in 339 ms.
Product exploration explored 100000 steps with 5200 reset in 359 ms.
Built C files in :
/tmp/ltsmin4790130348071535341
[2026-06-10 19:07:36] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2026-06-10 19:07:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:07:36] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2026-06-10 19:07:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:07:36] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2026-06-10 19:07:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:07:36] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4790130348071535341
Running compilation step : cd /tmp/ltsmin4790130348071535341;'/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 533 ms.
Running link step : cd /tmp/ltsmin4790130348071535341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4790130348071535341;'/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/stateBased8346580235148059052.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 90 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 223/223 transitions.
Applied a total of 0 rules in 14 ms. Remains 180 /180 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-06-10 19:07:51] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:07:51] [INFO ] Invariant cache hit.
[2026-06-10 19:07:51] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-06-10 19:07:51] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:07:51] [INFO ] Invariant cache hit.
[2026-06-10 19:07:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-06-10 19:07:51] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2026-06-10 19:07:51] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 180/180 places, 223/223 transitions.
Built C files in :
/tmp/ltsmin16734741253808506878
[2026-06-10 19:07:51] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2026-06-10 19:07:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:07:51] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2026-06-10 19:07:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:07:51] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2026-06-10 19:07:51] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:07:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16734741253808506878
Running compilation step : cd /tmp/ltsmin16734741253808506878;'/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 431 ms.
Running link step : cd /tmp/ltsmin16734741253808506878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16734741253808506878;'/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/stateBased7528631930985899040.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-10 19:08:06] [INFO ] Flatten gal took : 14 ms
[2026-06-10 19:08:06] [INFO ] Flatten gal took : 11 ms
[2026-06-10 19:08:06] [INFO ] Time to serialize gal into /tmp/LTL10812872397379387381.gal : 4 ms
[2026-06-10 19:08:06] [INFO ] Time to serialize properties into /tmp/LTL8329555368008651338.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10812872397379387381.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2180213263350498661.hoa' '-atoms' '/tmp/LTL8329555368008651338.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8329555368008651338.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2180213263350498661.hoa
Reverse transition relation is NOT exact ! Due to transitions t78, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97...615
Computing Next relation with stutter on 1024 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
388 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.92344,135648,1,0,677,520824,469,320,7868,441910,763
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LastZero-COL-N12-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property LastZero-COL-N12-LTLCardinality-03 finished in 156562 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((X(F(p0))||F(p1))))'
Support contains 90 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 224/224 transitions.
Applied a total of 0 rules in 2 ms. Remains 180 /180 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2026-06-10 19:08:11] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4193280980435008983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1114744862285542232.kers'
[2026-06-10 19:08:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4193280980435008983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1114744862285542232.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 169 rows 179 cols 401 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-06-10 19:08:11] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1114744862285542232.kers
Total runtime 1 ms.
[2026-06-10 19:08:11] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-06-10 19:08:11] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:08:11] [INFO ] Invariant cache hit.
[2026-06-10 19:08:11] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-06-10 19:08:11] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-06-10 19:08:11] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:08:11] [INFO ] Invariant cache hit.
[2026-06-10 19:08:11] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 169/348 variables, 179/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 79/354 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Problem TDEAD79 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/355 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/349 variables, and 355 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 180/180 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 74/96 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 5/101 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 10/111 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/113 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 169/348 variables, 179/292 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 79/371 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 211/582 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/582 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/583 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/583 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 583 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 180/180 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 211/212 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60044ms problems are : Problem set: 1 solved, 211 unsolved
Search for dead transitions found 1 dead transitions in 60050ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 180/180 places, 223/224 transitions.
Applied a total of 0 rules in 4 ms. Remains 180 /180 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60442 ms. Remains : 180/180 places, 223/224 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((X(F(p0))||F(p1))))'
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LastZero-COL-N12-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 180 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 180 transition count 223
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 5 factoid took 11 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 84 ms.
FORMULA LastZero-COL-N12-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-COL-N12-LTLCardinality-05 finished in 61137 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 12 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 224/224 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 169 transition count 213
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 169 transition count 213
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 159 transition count 193
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 159 transition count 193
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 149 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 149 transition count 183
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 140 transition count 165
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 140 transition count 165
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 131 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 131 transition count 156
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 123 transition count 140
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 123 transition count 140
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 115 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 115 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 137 place count 108 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 144 place count 108 transition count 118
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 151 place count 101 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 158 place count 101 transition count 111
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 95 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 95 transition count 99
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 176 place count 89 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 182 place count 89 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 187 place count 84 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 192 place count 84 transition count 83
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 197 place count 79 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 202 place count 79 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 206 place count 75 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 210 place count 75 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 214 place count 71 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 218 place count 71 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 221 place count 68 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 224 place count 68 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 227 place count 65 transition count 57
Iterating global reduction 0 with 3 rules applied. Total rules applied 230 place count 65 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 232 place count 63 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 234 place count 63 transition count 53
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 236 place count 61 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 238 place count 61 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 239 place count 60 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 240 place count 60 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 241 place count 59 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 242 place count 59 transition count 48
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 244 place count 58 transition count 47
Applied a total of 244 rules in 39 ms. Remains 58 /180 variables (removed 122) and now considering 47/224 (removed 177) transitions.
[2026-06-10 19:09:12] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13323906456365748344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12407788680036727981.kers'
[2026-06-10 19:09:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13323906456365748344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12407788680036727981.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 36 rows 46 cols 69 entries
Finished phase 1 with 26 SingleSign rule and 10 generalized
[2026-06-10 19:09:12] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12407788680036727981.kers
Total runtime 4 ms.
[2026-06-10 19:09:12] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-06-10 19:09:12] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
[2026-06-10 19:09:12] [INFO ] Invariant cache hit.
[2026-06-10 19:09:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-06-10 19:09:12] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2026-06-10 19:09:12] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2026-06-10 19:09:12] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
[2026-06-10 19:09:12] [INFO ] Invariant cache hit.
[2026-06-10 19:09:12] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 36/93 variables, 57/79 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem TDEAD22 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 93 constraints, problems are : Problem set: 1 solved, 34 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 36/93 variables, 57/79 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 13/92 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 34/126 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/94 variables, 1/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 127 constraints, problems are : Problem set: 1 solved, 34 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 34/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1435ms problems are : Problem set: 1 solved, 34 unsolved
Search for dead transitions found 1 dead transitions in 1435ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/180 places, 46/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2026-06-10 19:09:13] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1619 ms. Remains : 58/180 places, 46/224 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 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-COL-N12-LTLCardinality-07
Product exploration explored 100000 steps with 5267 reset in 261 ms.
Product exploration explored 100000 steps with 5269 reset in 271 ms.
Computed a total of 58 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 46
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 40 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 64 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 60 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 78 ms :[(NOT p0), (NOT p0)]
[2026-06-10 19:09:14] [INFO ] Flow matrix only has 35 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4332828742457047538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11914678265205116303.kers'
[2026-06-10 19:09:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4332828742457047538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11914678265205116303.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 35 rows 46 cols 68 entries
Finished phase 1 with 24 SingleSign rule and 11 generalized
[2026-06-10 19:09:14] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11914678265205116303.kers
Total runtime 0 ms.
[2026-06-10 19:09:14] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2026-06-10 19:09:14] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 3 ms returned sat
[2026-06-10 19:09:14] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-06-10 19:09:14] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:09:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2026-06-10 19:09:14] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 3 ms returned sat
[2026-06-10 19:09:14] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-06-10 19:09:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-10 19:09:14] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2026-06-10 19:09:14] [INFO ] Computed and/alt/rep : 23/34/23 causal constraints (skipped 0 transitions) in 3 ms.
[2026-06-10 19:09:14] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 379 ms.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 46/46 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2026-06-10 19:09:14] [INFO ] Flow matrix only has 35 transitions (discarded 11 similar events)
[2026-06-10 19:09:14] [INFO ] Invariant cache hit.
[2026-06-10 19:09:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-06-10 19:09:14] [INFO ] Flow matrix only has 35 transitions (discarded 11 similar events)
[2026-06-10 19:09:14] [INFO ] Invariant cache hit.
[2026-06-10 19:09:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-10 19:09:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-06-10 19:09:14] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2026-06-10 19:09:14] [INFO ] Flow matrix only has 35 transitions (discarded 11 similar events)
[2026-06-10 19:09:14] [INFO ] Invariant cache hit.
[2026-06-10 19:09:14] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 35/93 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 93 constraints, problems are : Problem set: 0 solved, 34 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 58/58 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 35/93 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 127 constraints, problems are : Problem set: 0 solved, 34 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 58/58 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1214ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1214ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1324 ms. Remains : 58/58 places, 46/46 transitions.
Computed a total of 58 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 46
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 51 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 71 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
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).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2026-06-10 19:09:16] [INFO ] Flow matrix only has 35 transitions (discarded 11 similar events)
[2026-06-10 19:09:16] [INFO ] Invariant cache hit.
[2026-06-10 19:09:16] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2026-06-10 19:09:16] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 1 ms returned sat
[2026-06-10 19:09:16] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-06-10 19:09:16] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:09:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2026-06-10 19:09:16] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 3 ms returned sat
[2026-06-10 19:09:16] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-06-10 19:09:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-10 19:09:16] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2026-06-10 19:09:16] [INFO ] Computed and/alt/rep : 23/34/23 causal constraints (skipped 0 transitions) in 2 ms.
[2026-06-10 19:09:16] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 340 ms.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5264 reset in 217 ms.
Product exploration explored 100000 steps with 5264 reset in 204 ms.
Built C files in :
/tmp/ltsmin383328053261783931
[2026-06-10 19:09:17] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2026-06-10 19:09:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:09:17] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2026-06-10 19:09:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:09:17] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2026-06-10 19:09:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:09:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin383328053261783931
Running compilation step : cd /tmp/ltsmin383328053261783931;'/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 130 ms.
Running link step : cd /tmp/ltsmin383328053261783931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin383328053261783931;'/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/stateBased8968568228782327593.hoa' '--buchi-type=spotba'
LTSmin run took 2935 ms.
FORMULA LastZero-COL-N12-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LastZero-COL-N12-LTLCardinality-07 finished in 8086 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' '!(F(G(p0)))'
Support contains 90 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 224/224 transitions.
Applied a total of 0 rules in 11 ms. Remains 180 /180 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2026-06-10 19:09:20] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17141188861198973672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11764938546313483126.kers'
[2026-06-10 19:09:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17141188861198973672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11764938546313483126.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 169 rows 179 cols 401 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-06-10 19:09:20] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11764938546313483126.kers
Total runtime 1 ms.
[2026-06-10 19:09:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-06-10 19:09:20] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:09:20] [INFO ] Invariant cache hit.
[2026-06-10 19:09:20] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-06-10 19:09:20] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2026-06-10 19:09:20] [INFO ] Redundant transitions in 4 ms returned []
Running 212 sub problems to find dead transitions.
[2026-06-10 19:09:20] [INFO ] Flow matrix only has 169 transitions (discarded 55 similar events)
[2026-06-10 19:09:20] [INFO ] Invariant cache hit.
[2026-06-10 19:09:20] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 169/348 variables, 179/275 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 79/354 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Problem TDEAD79 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/355 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/349 variables, and 355 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 180/180 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 74/96 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 5/101 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 10/111 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/113 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 169/348 variables, 179/292 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 79/371 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 211/582 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/582 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/583 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/583 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 583 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 180/180 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 211/212 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60043ms problems are : Problem set: 1 solved, 211 unsolved
Search for dead transitions found 1 dead transitions in 60044ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/180 places, 223/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 180 /180 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-06-10 19:10:20] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 60384 ms. Remains : 180/180 places, 223/224 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' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : LastZero-COL-N12-LTLCardinality-14
Product exploration explored 100000 steps with 2702 reset in 518 ms.
Product exploration explored 100000 steps with 2702 reset in 444 ms.
Computed a total of 180 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 180 transition count 223
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 52 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2026-06-10 19:10:21] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4726826047577758277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13389349905505681441.kers'
[2026-06-10 19:10:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4726826047577758277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13389349905505681441.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 168 rows 179 cols 400 entries
Finished phase 1 with 156 SingleSign rule and 1 generalized
[2026-06-10 19:10:21] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13389349905505681441.kers
Total runtime 1 ms.
[2026-06-10 19:10:22] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2026-06-10 19:10:22] [INFO ] [Real]Absence check using 22 positive and 1 generalized place invariants in 1 ms returned sat
[2026-06-10 19:10:22] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2026-06-10 19:10:22] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:10:22] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2026-06-10 19:10:22] [INFO ] [Nat]Absence check using 22 positive and 1 generalized place invariants in 14 ms returned sat
[2026-06-10 19:10:22] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2026-06-10 19:10:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-06-10 19:10:22] [INFO ] [Nat]Added 78 Read/Feed constraints in 15 ms returned sat
[2026-06-10 19:10:22] [INFO ] Computed and/alt/rep : 154/164/148 causal constraints (skipped 8 transitions) in 9 ms.
[2026-06-10 19:10:22] [INFO ] Added : 18 causal constraints over 4 iterations in 96 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1195 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 90 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 223/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-06-10 19:10:22] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:10:22] [INFO ] Invariant cache hit.
[2026-06-10 19:10:22] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-06-10 19:10:22] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:10:22] [INFO ] Invariant cache hit.
[2026-06-10 19:10:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-06-10 19:10:23] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2026-06-10 19:10:23] [INFO ] Redundant transitions in 1 ms returned []
Running 211 sub problems to find dead transitions.
[2026-06-10 19:10:23] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:10:23] [INFO ] Invariant cache hit.
[2026-06-10 19:10:23] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 168/348 variables, 180/277 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 78/355 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 12 (OVERLAPS) 0/348 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 355 constraints, problems are : Problem set: 0 solved, 211 unsolved in 28152 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 74/96 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 168/348 variables, 180/283 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 78/361 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 211/572 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 12 (OVERLAPS) 0/348 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 572 constraints, problems are : Problem set: 0 solved, 211 unsolved in 24899 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 180/180 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53065ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 53067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53395 ms. Remains : 180/180 places, 223/223 transitions.
Computed a total of 180 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 180 transition count 223
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 44 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 31 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2026-06-10 19:11:16] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:11:16] [INFO ] Invariant cache hit.
[2026-06-10 19:11:16] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2026-06-10 19:11:16] [INFO ] [Real]Absence check using 22 positive and 1 generalized place invariants in 4 ms returned sat
[2026-06-10 19:11:16] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-06-10 19:11:16] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:11:17] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2026-06-10 19:11:17] [INFO ] [Nat]Absence check using 22 positive and 1 generalized place invariants in 13 ms returned sat
[2026-06-10 19:11:17] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2026-06-10 19:11:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-06-10 19:11:17] [INFO ] [Nat]Added 78 Read/Feed constraints in 14 ms returned sat
[2026-06-10 19:11:17] [INFO ] Computed and/alt/rep : 154/164/148 causal constraints (skipped 8 transitions) in 9 ms.
[2026-06-10 19:11:17] [INFO ] Added : 18 causal constraints over 4 iterations in 97 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1153 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2702 reset in 432 ms.
Product exploration explored 100000 steps with 2702 reset in 452 ms.
Built C files in :
/tmp/ltsmin9683242457936520587
[2026-06-10 19:11:18] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2026-06-10 19:11:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:11:18] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2026-06-10 19:11:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:11:18] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2026-06-10 19:11:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:11:18] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9683242457936520587
Running compilation step : cd /tmp/ltsmin9683242457936520587;'/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 436 ms.
Running link step : cd /tmp/ltsmin9683242457936520587;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9683242457936520587;'/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/stateBased7827415148321116654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 90 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 180 /180 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-06-10 19:11:33] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:11:33] [INFO ] Invariant cache hit.
[2026-06-10 19:11:33] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-10 19:11:33] [INFO ] Flow matrix only has 168 transitions (discarded 55 similar events)
[2026-06-10 19:11:33] [INFO ] Invariant cache hit.
[2026-06-10 19:11:33] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-06-10 19:11:33] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2026-06-10 19:11:33] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 180/180 places, 223/223 transitions.
Built C files in :
/tmp/ltsmin12957204480524884181
[2026-06-10 19:11:33] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2026-06-10 19:11:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:11:33] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2026-06-10 19:11:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:11:33] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2026-06-10 19:11:33] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:11:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12957204480524884181
Running compilation step : cd /tmp/ltsmin12957204480524884181;'/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 428 ms.
Running link step : cd /tmp/ltsmin12957204480524884181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12957204480524884181;'/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/stateBased4117728396602187334.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-10 19:11:48] [INFO ] Flatten gal took : 11 ms
[2026-06-10 19:11:48] [INFO ] Flatten gal took : 10 ms
[2026-06-10 19:11:48] [INFO ] Time to serialize gal into /tmp/LTL15807911116705804214.gal : 2 ms
[2026-06-10 19:11:48] [INFO ] Time to serialize properties into /tmp/LTL949067659602614723.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15807911116705804214.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15955737495448338895.hoa' '-atoms' '/tmp/LTL949067659602614723.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL949067659602614723.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15955737495448338895.hoa
Reverse transition relation is NOT exact ! Due to transitions t78, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97...615
Computing Next relation with stutter on 1024 deadlock states
Detected timeout of ITS tools.
[2026-06-10 19:12:03] [INFO ] Flatten gal took : 9 ms
[2026-06-10 19:12:03] [INFO ] Flatten gal took : 9 ms
[2026-06-10 19:12:03] [INFO ] Time to serialize gal into /tmp/LTL7833022384062899024.gal : 2 ms
[2026-06-10 19:12:03] [INFO ] Time to serialize properties into /tmp/LTL7999015747731673831.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7833022384062899024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7999015747731673831.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(process_7+process_8)))+((process_9+process_10)+(proce...931
Formula 0 simplified : GF!"(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(process_7+process_8)))+((process_9+process_10)+(process...925
Reverse transition relation is NOT exact ! Due to transitions t78, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97...615
Computing Next relation with stutter on 1024 deadlock states
Detected timeout of ITS tools.
[2026-06-10 19:12:18] [INFO ] Flatten gal took : 9 ms
[2026-06-10 19:12:18] [INFO ] Applying decomposition
[2026-06-10 19:12:18] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9430134807569775850.txt' '-o' '/tmp/graph9430134807569775850.bin' '-w' '/tmp/graph9430134807569775850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9430134807569775850.bin' '-l' '-1' '-v' '-w' '/tmp/graph9430134807569775850.weights' '-q' '0' '-e' '0.001'
[2026-06-10 19:12:19] [INFO ] Decomposing Gal with order
[2026-06-10 19:12:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 19:12:19] [INFO ] Removed a total of 133 redundant transitions.
[2026-06-10 19:12:19] [INFO ] Flatten gal took : 100 ms
[2026-06-10 19:12:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 16 ms.
[2026-06-10 19:12:19] [INFO ] Time to serialize gal into /tmp/LTL2907972015095760772.gal : 6 ms
[2026-06-10 19:12:19] [INFO ] Time to serialize properties into /tmp/LTL3562940356235789290.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2907972015095760772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3562940356235789290.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((gu16.process_1+gu16.process_2)+(gu16.process_3+gu16.process_4))+((gu16.process_5+gu16.process_6)+(gu16.process_7+gu16.pro...1381
Formula 0 simplified : GF!"(((((gu16.process_1+gu16.process_2)+(gu16.process_3+gu16.process_4))+((gu16.process_5+gu16.process_6)+(gu16.process_7+gu16.proce...1375
Reverse transition relation is NOT exact ! Due to transitions t78, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97...549
Computing Next relation with stutter on 1024 deadlock states
Detected timeout of ITS tools.
Treatment of property LastZero-COL-N12-LTLCardinality-14 finished in 194159 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(G(p0)) U !p0)))'
Support contains 12 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 224/224 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 169 transition count 213
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 169 transition count 213
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 159 transition count 193
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 159 transition count 193
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 149 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 149 transition count 183
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 140 transition count 165
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 140 transition count 165
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 131 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 131 transition count 156
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 123 transition count 140
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 123 transition count 140
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 115 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 115 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 137 place count 108 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 144 place count 108 transition count 118
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 151 place count 101 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 158 place count 101 transition count 111
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 95 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 95 transition count 99
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 176 place count 89 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 182 place count 89 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 187 place count 84 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 192 place count 84 transition count 83
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 197 place count 79 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 202 place count 79 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 206 place count 75 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 210 place count 75 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 214 place count 71 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 218 place count 71 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 221 place count 68 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 224 place count 68 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 227 place count 65 transition count 57
Iterating global reduction 0 with 3 rules applied. Total rules applied 230 place count 65 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 232 place count 63 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 234 place count 63 transition count 53
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 236 place count 61 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 238 place count 61 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 239 place count 60 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 240 place count 60 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 241 place count 59 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 242 place count 59 transition count 48
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 244 place count 58 transition count 47
Applied a total of 244 rules in 34 ms. Remains 58 /180 variables (removed 122) and now considering 47/224 (removed 177) transitions.
[2026-06-10 19:12:34] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5656377900404125756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10551639187056891590.kers'
[2026-06-10 19:12:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5656377900404125756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10551639187056891590.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 36 rows 46 cols 69 entries
Finished phase 1 with 26 SingleSign rule and 10 generalized
[2026-06-10 19:12:34] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10551639187056891590.kers
Total runtime 3 ms.
[2026-06-10 19:12:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-06-10 19:12:34] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
[2026-06-10 19:12:34] [INFO ] Invariant cache hit.
[2026-06-10 19:12:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-06-10 19:12:34] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2026-06-10 19:12:34] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2026-06-10 19:12:34] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
[2026-06-10 19:12:34] [INFO ] Invariant cache hit.
[2026-06-10 19:12:34] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 36/93 variables, 57/79 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem TDEAD22 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 93 constraints, problems are : Problem set: 1 solved, 34 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 10/22 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 36/93 variables, 57/79 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 13/92 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 34/126 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/94 variables, 1/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 127 constraints, problems are : Problem set: 1 solved, 34 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 58/58 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 34/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1357ms problems are : Problem set: 1 solved, 34 unsolved
Search for dead transitions found 1 dead transitions in 1357ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/180 places, 46/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2026-06-10 19:12:35] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1511 ms. Remains : 58/180 places, 46/224 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(G(p0)) U !p0)))'
Stuttering acceptance computed with spot in 50 ms :[p0, true]
Running random walk in product with property : LastZero-COL-N12-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA LastZero-COL-N12-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N12-LTLCardinality-15 finished in 1597 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' '!(F(G(p0)))'
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-10 19:12:36] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9764319228809255934
[2026-06-10 19:12:36] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2026-06-10 19:12:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:12:36] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2026-06-10 19:12:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:12:36] [INFO ] Applying decomposition
[2026-06-10 19:12:36] [INFO ] Flatten gal took : 9 ms
[2026-06-10 19:12:36] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2026-06-10 19:12:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:12:36] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9764319228809255934
Running compilation step : cd /tmp/ltsmin9764319228809255934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7802263381521148333.txt' '-o' '/tmp/graph7802263381521148333.bin' '-w' '/tmp/graph7802263381521148333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7802263381521148333.bin' '-l' '-1' '-v' '-w' '/tmp/graph7802263381521148333.weights' '-q' '0' '-e' '0.001'
[2026-06-10 19:12:36] [INFO ] Decomposing Gal with order
[2026-06-10 19:12:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 19:12:36] [INFO ] Removed a total of 99 redundant transitions.
[2026-06-10 19:12:36] [INFO ] Flatten gal took : 42 ms
[2026-06-10 19:12:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 10 ms.
[2026-06-10 19:12:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality16272503967695851416.gal : 3 ms
[2026-06-10 19:12:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality12807924622026627199.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16272503967695851416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12807924622026627199.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((gu14.process_1+gu14.process_2)+(gu14.process_3+gu14.process_4))+((gu14.process_5+gu14.process_6)+(gu14.process_7+gu14.pro...1381
Formula 0 simplified : GF!"(((((gu14.process_1+gu14.process_2)+(gu14.process_3+gu14.process_4))+((gu14.process_5+gu14.process_6)+(gu14.process_7+gu14.proce...1375
Compilation finished in 502 ms.
Running link step : cd /tmp/ltsmin9764319228809255934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9764319228809255934;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t78, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97...549
Computing Next relation with stutter on 1024 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
2726 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,27.298,717260,1,0,770,2.88279e+06,393,438,58665,5.27865e+06,1064
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LastZero-COL-N12-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 491464 ms.

BK_STOP 1781118788809

--------------------
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-COL-N12"
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-COL-N12, 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-178024402700019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LastZero-COL-N12.tgz
mv LastZero-COL-N12 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 ;