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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.0K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 27 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 27 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 15K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:51 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 28K 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-N08-LTLCardinality-00
FORMULA_NAME LastZero-COL-N08-LTLCardinality-01
FORMULA_NAME LastZero-COL-N08-LTLCardinality-02
FORMULA_NAME LastZero-COL-N08-LTLCardinality-03
FORMULA_NAME LastZero-COL-N08-LTLCardinality-04
FORMULA_NAME LastZero-COL-N08-LTLCardinality-05
FORMULA_NAME LastZero-COL-N08-LTLCardinality-06
FORMULA_NAME LastZero-COL-N08-LTLCardinality-07
FORMULA_NAME LastZero-COL-N08-LTLCardinality-08
FORMULA_NAME LastZero-COL-N08-LTLCardinality-09
FORMULA_NAME LastZero-COL-N08-LTLCardinality-10
FORMULA_NAME LastZero-COL-N08-LTLCardinality-11
FORMULA_NAME LastZero-COL-N08-LTLCardinality-12
FORMULA_NAME LastZero-COL-N08-LTLCardinality-13
FORMULA_NAME LastZero-COL-N08-LTLCardinality-14
FORMULA_NAME LastZero-COL-N08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781118170105

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-N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-06-10 19:02:51] [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:02:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 19:02:51] [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:02:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-06-10 19:02:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 562 ms
[2026-06-10 19:02:52] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 180 PT places and 891.0 transition bindings in 18 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:02:52] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 11 arcs in 5 ms.
[2026-06-10 19:02:52] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-COL-N08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 2 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA LastZero-COL-N08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40013 steps (2104 resets) in 330 ms. (120 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40000 steps (1248 resets) in 294 ms. (135 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1288 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7927846791869435413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14285053464988732078.kers'
[2026-06-10 19:02:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7927846791869435413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14285053464988732078.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:02:52] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14285053464988732078.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 157 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 219ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA LastZero-COL-N08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 19:02:52] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2026-06-10 19:02:52] [INFO ] Flatten gal took : 14 ms
FORMULA LastZero-COL-N08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 19:02:52] [INFO ] Flatten gal took : 1 ms
Domain [ID(9), ID(9)] of place array breaks symmetries in sort ID
[2026-06-10 19:02:52] [INFO ] Unfolded HLPN to a Petri net with 180 places and 857 transitions 2699 arcs in 29 ms.
[2026-06-10 19:02:52] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 82 places in 4 ms
Reduce places removed 82 places and 545 transitions.
Reduce places removed 1 places and 0 transitions.
Support contains 44 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 312/312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 312
Applied a total of 1 rules in 13 ms. Remains 96 /97 variables (removed 1) and now considering 312/312 (removed 0) transitions.
[2026-06-10 19:02:52] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4950805755686686794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7097988995793451188.kers'
[2026-06-10 19:02:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4950805755686686794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7097988995793451188.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 284 rows 95 cols 734 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-06-10 19:02:52] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7097988995793451188.kers
Total runtime 1 ms.
[2026-06-10 19:02:53] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-06-10 19:02:53] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 19:02:53] [INFO ] Invariant cache hit.
[2026-06-10 19:02:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-06-10 19:02:53] [INFO ] Implicit Places using invariants and state equation in 363 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 504 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/97 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 527 ms. Remains : 95/97 places, 312/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 312/312 transitions.
Applied a total of 0 rules in 5 ms. Remains 95 /95 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2026-06-10 19:02:53] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16091047133205206697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8365240395714083819.kers'
[2026-06-10 19:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16091047133205206697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8365240395714083819.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 284 rows 94 cols 726 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-06-10 19:02:53] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8365240395714083819.kers
Total runtime 1 ms.
[2026-06-10 19:02:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-06-10 19:02:53] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 19:02:53] [INFO ] Invariant cache hit.
[2026-06-10 19:02:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-06-10 19:02:53] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2026-06-10 19:02:53] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 19:02:53] [INFO ] Invariant cache hit.
[2026-06-10 19:02:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 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 TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 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 TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem 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 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 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 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 TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem 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 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 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 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 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 TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem 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 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
At refinement iteration 2 (OVERLAPS) 284/378 variables, 94/101 constraints. Problems are: Problem set: 203 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 72/173 constraints. Problems are: Problem set: 203 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/173 constraints. Problems are: Problem set: 203 solved, 101 unsolved
Problem TDEAD37 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/379 variables, 1/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 174 constraints, problems are : Problem set: 204 solved, 100 unsolved in 10152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 204 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 284/378 variables, 94/101 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 72/173 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 100/273 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/273 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/379 variables, 1/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/379 variables, 0/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 274 constraints, problems are : Problem set: 204 solved, 100 unsolved in 7417 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 100/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17709ms problems are : Problem set: 204 solved, 100 unsolved
Search for dead transitions found 204 dead transitions in 17715ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 95/95 places, 108/312 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 88 transition count 101
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 88 transition count 101
Applied a total of 14 rules in 4 ms. Remains 88 /95 variables (removed 7) and now considering 101/108 (removed 7) transitions.
[2026-06-10 19:03:11] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2451358315461431738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5056129435766257299.kers'
[2026-06-10 19:03:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2451358315461431738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5056129435766257299.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 87 cols 186 entries
Finished phase 1 with 72 SingleSign rule and 1 generalized
[2026-06-10 19:03:11] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5056129435766257299.kers
Total runtime 1 ms.
[2026-06-10 19:03:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-06-10 19:03:11] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:11] [INFO ] Invariant cache hit.
[2026-06-10 19:03:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:11] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/95 places, 101/312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18342 ms. Remains : 88/95 places, 101/312 transitions.
Support contains 44 out of 88 places after structural reductions.
[2026-06-10 19:03:11] [INFO ] Flatten gal took : 13 ms
[2026-06-10 19:03:11] [INFO ] Flatten gal took : 13 ms
[2026-06-10 19:03:11] [INFO ] Input system was already deterministic with 101 transitions.
RANDOM walk for 61 steps (0 resets) in 9 ms. (6 steps per ms) remains 0/10 properties
Computed a total of 88 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 101
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(G(p0)))'
Support contains 44 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:12] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:12] [INFO ] Invariant cache hit.
[2026-06-10 19:03:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-06-10 19:03:12] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:12] [INFO ] Invariant cache hit.
[2026-06-10 19:03:12] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:12] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-06-10 19:03:12] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
[2026-06-10 19:03:12] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:12] [INFO ] Invariant cache hit.
[2026-06-10 19:03:12] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 80/168 variables, 88/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 171 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5120 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 80/168 variables, 88/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 93/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3488 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8618ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 8619ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8764 ms. Remains : 88/88 places, 101/101 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 163 ms :[(NOT p0)]
Running random walk in product with property : LastZero-COL-N08-LTLCardinality-00
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 3 ms.
FORMULA LastZero-COL-N08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N08-LTLCardinality-00 finished in 9003 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(G(p0))&&(X(p1)||G(p2))))'
Support contains 44 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:21] [INFO ] Invariant cache hit.
[2026-06-10 19:03:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:21] [INFO ] Invariant cache hit.
[2026-06-10 19:03:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:21] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 88/88 places, 101/101 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(X(p1)||G(p2))))'
Stuttering acceptance computed with spot in 244 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : LastZero-COL-N08-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LastZero-COL-N08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N08-LTLCardinality-02 finished in 432 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(p0)&&X(X(F(p1)))))'
Support contains 44 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:21] [INFO ] Invariant cache hit.
[2026-06-10 19:03:21] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:21] [INFO ] Invariant cache hit.
[2026-06-10 19:03:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:21] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 88/88 places, 101/101 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)&&X(X(F(p1)))))'
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : LastZero-COL-N08-LTLCardinality-04
Product exploration explored 100000 steps with 30208 reset in 284 ms.
Stuttering criterion allowed to conclude after 26258 steps with 8018 reset in 52 ms.
FORMULA LastZero-COL-N08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N08-LTLCardinality-04 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 8 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 69 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 69 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 64 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 64 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 59 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 59 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 55 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 55 transition count 53
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 51 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 51 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 48 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 48 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 45 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 45 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 43 transition count 36
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 43 transition count 36
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 41 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 41 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 40 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 40 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 39 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 39 transition count 31
Applied a total of 98 rules in 14 ms. Remains 39 /88 variables (removed 49) and now considering 31/101 (removed 70) transitions.
[2026-06-10 19:03:22] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-767515566366251647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11823648743308544864.kers'
[2026-06-10 19:03:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-767515566366251647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11823648743308544864.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 24 rows 32 cols 47 entries
Finished phase 1 with 17 SingleSign rule and 7 generalized
[2026-06-10 19:03:22] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11823648743308544864.kers
Total runtime 0 ms.
[2026-06-10 19:03:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-06-10 19:03:22] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:22] [INFO ] Invariant cache hit.
[2026-06-10 19:03:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2026-06-10 19:03:22] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:22] [INFO ] Invariant cache hit.
[2026-06-10 19:03:22] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/63 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 62 constraints, problems are : Problem set: 0 solved, 23 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/63 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/63 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 85 constraints, problems are : Problem set: 0 solved, 23 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 657ms
Starting structural reductions in LTL mode, iteration 1 : 39/88 places, 31/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 743 ms. Remains : 39/88 places, 31/101 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : LastZero-COL-N08-LTLCardinality-05
Product exploration explored 100000 steps with 17438 reset in 180 ms.
Product exploration explored 100000 steps with 17521 reset in 164 ms.
Computed a total of 39 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 39 transition count 31
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 6 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge based reduction with 6 factoid took 78 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 85 ms :[(NOT p1), (NOT p1)]
[2026-06-10 19:03:23] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:23] [INFO ] Invariant cache hit.
[2026-06-10 19:03:23] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-06-10 19:03:23] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2026-06-10 19:03:23] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-06-10 19:03:23] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:03:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-06-10 19:03:23] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2026-06-10 19:03:23] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-06-10 19:03:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2026-06-10 19:03:23] [INFO ] Computed and/alt/rep : 16/23/16 causal constraints (skipped 0 transitions) in 1 ms.
[2026-06-10 19:03:23] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 409 ms.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
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 2 place count 38 transition count 30
Applied a total of 2 rules in 8 ms. Remains 38 /39 variables (removed 1) and now considering 30/31 (removed 1) transitions.
[2026-06-10 19:03:23] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4044438022409951830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18259850231470380760.kers'
[2026-06-10 19:03:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4044438022409951830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18259850231470380760.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 23 rows 30 cols 44 entries
Finished phase 1 with 16 SingleSign rule and 7 generalized
[2026-06-10 19:03:23] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18259850231470380760.kers
Total runtime 0 ms.
[2026-06-10 19:03:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-06-10 19:03:24] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2026-06-10 19:03:24] [INFO ] Invariant cache hit.
[2026-06-10 19:03:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-06-10 19:03:24] [INFO ] Redundant transitions in 1 ms returned []
Running 22 sub problems to find dead transitions.
[2026-06-10 19:03:24] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2026-06-10 19:03:24] [INFO ] Invariant cache hit.
[2026-06-10 19:03:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 23/61 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 61 constraints, problems are : Problem set: 0 solved, 22 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 23/61 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 83 constraints, problems are : Problem set: 0 solved, 22 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 616ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 617ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/39 places, 30/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 700 ms. Remains : 38/39 places, 30/31 transitions.
Computed a total of 38 stabilizing places and 30 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 30
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 60 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 34 steps (0 resets) in 10 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 65 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 75 ms :[(NOT p1), (NOT p1)]
[2026-06-10 19:03:24] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2026-06-10 19:03:24] [INFO ] Invariant cache hit.
[2026-06-10 19:03:24] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-06-10 19:03:24] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2026-06-10 19:03:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-06-10 19:03:24] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:03:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-06-10 19:03:24] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2026-06-10 19:03:24] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-06-10 19:03:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2026-06-10 19:03:25] [INFO ] Computed and/alt/rep : 15/22/15 causal constraints (skipped 0 transitions) in 1 ms.
[2026-06-10 19:03:25] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 350 ms.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10648 reset in 194 ms.
Product exploration explored 100000 steps with 10673 reset in 225 ms.
Built C files in :
/tmp/ltsmin17669435239156111214
[2026-06-10 19:03:25] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2026-06-10 19:03:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:25] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2026-06-10 19:03:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:25] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2026-06-10 19:03:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17669435239156111214
Running compilation step : cd /tmp/ltsmin17669435239156111214;'/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 216 ms.
Running link step : cd /tmp/ltsmin17669435239156111214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17669435239156111214;'/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/stateBased12369695865425449284.hoa' '--buchi-type=spotba'
LTSmin run took 50 ms.
FORMULA LastZero-COL-N08-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LastZero-COL-N08-LTLCardinality-05 finished in 3811 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 44 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:25] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1199100162455223214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11752535061756292427.kers'
[2026-06-10 19:03:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1199100162455223214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11752535061756292427.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 87 cols 186 entries
Finished phase 1 with 72 SingleSign rule and 1 generalized
[2026-06-10 19:03:25] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11752535061756292427.kers
Total runtime 1 ms.
[2026-06-10 19:03:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-06-10 19:03:26] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:26] [INFO ] Invariant cache hit.
[2026-06-10 19:03:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:26] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2026-06-10 19:03:26] [INFO ] Redundant transitions in 3 ms returned []
Running 93 sub problems to find dead transitions.
[2026-06-10 19:03:26] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:26] [INFO ] Invariant cache hit.
[2026-06-10 19:03:26] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 80/168 variables, 88/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 171 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4994 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 80/168 variables, 88/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 93/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3405 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8407ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 8408ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8567 ms. Remains : 88/88 places, 101/101 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 42 ms :[(NOT p0)]
Running random walk in product with property : LastZero-COL-N08-LTLCardinality-07
Product exploration explored 100000 steps with 4000 reset in 231 ms.
Product exploration explored 100000 steps with 4000 reset in 241 ms.
Computed a total of 88 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 101
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 69 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 59 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 67 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 38 ms :[(NOT p0)]
[2026-06-10 19:03:35] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:35] [INFO ] Invariant cache hit.
[2026-06-10 19:03:35] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2026-06-10 19:03:35] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 2 ms returned sat
[2026-06-10 19:03:35] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-06-10 19:03:35] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:03:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-06-10 19:03:35] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2026-06-10 19:03:35] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-06-10 19:03:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:35] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2026-06-10 19:03:35] [INFO ] Computed and/alt/rep : 75/92/69 causal constraints (skipped 3 transitions) in 4 ms.
[2026-06-10 19:03:35] [INFO ] Added : 9 causal constraints over 2 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 648 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 44 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:35] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:35] [INFO ] Invariant cache hit.
[2026-06-10 19:03:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-06-10 19:03:35] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:35] [INFO ] Invariant cache hit.
[2026-06-10 19:03:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:35] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2026-06-10 19:03:35] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 88/88 places, 101/101 transitions.
Computed a total of 88 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 101
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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 57 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 49 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 35 ms :[(NOT p0)]
[2026-06-10 19:03:36] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:36] [INFO ] Invariant cache hit.
[2026-06-10 19:03:36] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2026-06-10 19:03:36] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 2 ms returned sat
[2026-06-10 19:03:36] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-06-10 19:03:36] [INFO ] Solution in real domain found non-integer solution.
[2026-06-10 19:03:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2026-06-10 19:03:36] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2026-06-10 19:03:36] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-06-10 19:03:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:36] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2026-06-10 19:03:36] [INFO ] Computed and/alt/rep : 75/92/69 causal constraints (skipped 3 transitions) in 4 ms.
[2026-06-10 19:03:36] [INFO ] Added : 9 causal constraints over 2 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 578 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4000 reset in 213 ms.
Product exploration explored 100000 steps with 4000 reset in 234 ms.
Built C files in :
/tmp/ltsmin2808491642476101991
[2026-06-10 19:03:37] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2026-06-10 19:03:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:37] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2026-06-10 19:03:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:37] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2026-06-10 19:03:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2808491642476101991
Running compilation step : cd /tmp/ltsmin2808491642476101991;'/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 210 ms.
Running link step : cd /tmp/ltsmin2808491642476101991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2808491642476101991;'/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/stateBased5113727994449887363.hoa' '--buchi-type=spotba'
LTSmin run took 735 ms.
FORMULA LastZero-COL-N08-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LastZero-COL-N08-LTLCardinality-07 finished in 12080 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((G(p0) U G((p1&&X(X(G(p2))))))))'
Support contains 44 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:38] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:38] [INFO ] Invariant cache hit.
[2026-06-10 19:03:38] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-06-10 19:03:38] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:38] [INFO ] Invariant cache hit.
[2026-06-10 19:03:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:38] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 88/88 places, 101/101 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G((p1&&X(X(G(p2))))))))'
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : LastZero-COL-N08-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA LastZero-COL-N08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-COL-N08-LTLCardinality-08 finished in 628 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 36 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:38] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:38] [INFO ] Invariant cache hit.
[2026-06-10 19:03:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-06-10 19:03:38] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:38] [INFO ] Invariant cache hit.
[2026-06-10 19:03:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:38] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2026-06-10 19:03:38] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 88/88 places, 101/101 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-N08-LTLCardinality-12
Product exploration explored 100000 steps with 4000 reset in 193 ms.
Product exploration explored 100000 steps with 4000 reset in 215 ms.
Computed a total of 88 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 101
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 3 factoid took 84 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 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 100 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 33 ms :[(NOT p0)]
Knowledge-based reduction took 266 ms.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 36 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 11 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:39] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:39] [INFO ] Invariant cache hit.
[2026-06-10 19:03:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-06-10 19:03:39] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:39] [INFO ] Invariant cache hit.
[2026-06-10 19:03:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:39] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2026-06-10 19:03:39] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 88/88 places, 101/101 transitions.
Computed a total of 88 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 101
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 3 factoid took 84 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 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 91 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)]
Knowledge-based reduction took 259 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4000 reset in 199 ms.
Product exploration explored 100000 steps with 4000 reset in 226 ms.
Built C files in :
/tmp/ltsmin6078547326157514205
[2026-06-10 19:03:40] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2026-06-10 19:03:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:40] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2026-06-10 19:03:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:40] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2026-06-10 19:03:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-10 19:03:40] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6078547326157514205
Running compilation step : cd /tmp/ltsmin6078547326157514205;'/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 203 ms.
Running link step : cd /tmp/ltsmin6078547326157514205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6078547326157514205;'/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/stateBased7685930753921663054.hoa' '--buchi-type=spotba'
LTSmin run took 769 ms.
FORMULA LastZero-COL-N08-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LastZero-COL-N08-LTLCardinality-12 finished in 2946 ms.
All properties solved by simple procedures.
Total runtime 50282 ms.

BK_STOP 1781118222008

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

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