Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500443.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CO4-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 152K May 29 14:32 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 CO4-PT-09-LTLCardinality-00
FORMULA_NAME CO4-PT-09-LTLCardinality-01
FORMULA_NAME CO4-PT-09-LTLCardinality-02
FORMULA_NAME CO4-PT-09-LTLCardinality-03
FORMULA_NAME CO4-PT-09-LTLCardinality-04
FORMULA_NAME CO4-PT-09-LTLCardinality-05
FORMULA_NAME CO4-PT-09-LTLCardinality-06
FORMULA_NAME CO4-PT-09-LTLCardinality-07
FORMULA_NAME CO4-PT-09-LTLCardinality-08
FORMULA_NAME CO4-PT-09-LTLCardinality-09
FORMULA_NAME CO4-PT-09-LTLCardinality-10
FORMULA_NAME CO4-PT-09-LTLCardinality-11
FORMULA_NAME CO4-PT-09-LTLCardinality-12
FORMULA_NAME CO4-PT-09-LTLCardinality-13
FORMULA_NAME CO4-PT-09-LTLCardinality-14
FORMULA_NAME CO4-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748606286733

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 11:58:07] [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]
[2025-05-30 11:58:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:58:08] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2025-05-30 11:58:08] [INFO ] Transformed 467 places.
[2025-05-30 11:58:08] [INFO ] Transformed 634 transitions.
[2025-05-30 11:58:08] [INFO ] Found NUPN structural information;
[2025-05-30 11:58:08] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 108 places in 7 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 469
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 92 place count 269 transition count 390
Iterating global reduction 1 with 77 rules applied. Total rules applied 169 place count 269 transition count 390
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 174 place count 269 transition count 385
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 213 place count 230 transition count 324
Iterating global reduction 2 with 39 rules applied. Total rules applied 252 place count 230 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 254 place count 230 transition count 322
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 262 place count 222 transition count 309
Iterating global reduction 3 with 8 rules applied. Total rules applied 270 place count 222 transition count 309
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 274 place count 218 transition count 305
Iterating global reduction 3 with 4 rules applied. Total rules applied 278 place count 218 transition count 305
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 280 place count 216 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 282 place count 216 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 284 place count 216 transition count 301
Applied a total of 284 rules in 96 ms. Remains 216 /359 variables (removed 143) and now considering 301/471 (removed 170) transitions.
// Phase 1: matrix 301 rows 216 cols
[2025-05-30 11:58:08] [INFO ] Computed 6 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:08] [INFO ] Implicit Places using invariants in 232 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 215/359 places, 301/471 transitions.
Applied a total of 0 rules in 3 ms. Remains 215 /215 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 215/359 places, 301/471 transitions.
Support contains 15 out of 215 places after structural reductions.
[2025-05-30 11:58:08] [INFO ] Flatten gal took : 43 ms
[2025-05-30 11:58:08] [INFO ] Flatten gal took : 26 ms
[2025-05-30 11:58:08] [INFO ] Input system was already deterministic with 301 transitions.
RANDOM walk for 40000 steps (139 resets) in 1218 ms. (32 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (316 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (149 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (233 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (235 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (73 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
// Phase 1: matrix 301 rows 215 cols
[2025-05-30 11:58:09] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/36 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 94/130 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 200/330 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 147/477 variables, 83/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 30/507 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 9/516 variables, 5/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/516 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 220 constraints, problems are : Problem set: 0 solved, 5 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/36 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 94/130 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 200/330 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 147/477 variables, 83/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 30/507 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 9/516 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/516 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 225 constraints, problems are : Problem set: 0 solved, 5 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1487ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 5 properties in 244 ms.
Computed a total of 14 stabilizing places and 21 stable transitions
Graph (complete) has 484 edges and 215 vertex of which 212 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 301/301 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 206 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 206 transition count 292
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 200 transition count 284
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 200 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 200 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 199 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 199 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 198 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 198 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 198 transition count 280
Applied a total of 36 rules in 17 ms. Remains 198 /215 variables (removed 17) and now considering 280/301 (removed 21) transitions.
// Phase 1: matrix 280 rows 198 cols
[2025-05-30 11:58:14] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:14] [INFO ] Implicit Places using invariants in 87 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/215 places, 280/301 transitions.
Applied a total of 0 rules in 3 ms. Remains 197 /197 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 197/215 places, 280/301 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 250 ms.
Product exploration explored 100000 steps with 33333 reset in 129 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 440 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-09-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-09-LTLCardinality-04 finished in 3459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0))))'
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 301/301 transitions.
Graph (trivial) has 226 edges and 215 vertex of which 2 / 215 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 483 edges and 214 vertex of which 211 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 210 transition count 220
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 158 place count 134 transition count 216
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 133 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 132 transition count 215
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 161 place count 132 transition count 195
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 201 place count 112 transition count 195
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 110 transition count 193
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 110 transition count 193
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 108 transition count 189
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 108 transition count 189
Performed 34 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 277 place count 74 transition count 147
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 10 rules applied. Total rules applied 287 place count 74 transition count 137
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 291 place count 72 transition count 135
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 292 place count 71 transition count 133
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 71 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 297 place count 69 transition count 131
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 331 place count 52 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 339 place count 52 transition count 142
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 349 place count 42 transition count 102
Iterating global reduction 7 with 10 rules applied. Total rules applied 359 place count 42 transition count 102
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 366 place count 42 transition count 95
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 369 place count 39 transition count 77
Iterating global reduction 8 with 3 rules applied. Total rules applied 372 place count 39 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 374 place count 39 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 382 place count 39 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 384 place count 37 transition count 65
Applied a total of 384 rules in 64 ms. Remains 37 /215 variables (removed 178) and now considering 65/301 (removed 236) transitions.
[2025-05-30 11:58:15] [INFO ] Flow matrix only has 52 transitions (discarded 13 similar events)
// Phase 1: matrix 52 rows 37 cols
[2025-05-30 11:58:15] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:15] [INFO ] Implicit Places using invariants in 34 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/215 places, 65/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 36/215 places, 65/301 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), p0]
Running random walk in product with property : CO4-PT-09-LTLCardinality-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA CO4-PT-09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-08 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 301/301 transitions.
Graph (trivial) has 225 edges and 215 vertex of which 2 / 215 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 483 edges and 214 vertex of which 211 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 210 transition count 220
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 158 place count 134 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 133 transition count 216
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 159 place count 133 transition count 196
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 199 place count 113 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 112 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 112 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 111 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 111 transition count 193
Performed 34 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 271 place count 77 transition count 151
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 281 place count 77 transition count 141
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 285 place count 75 transition count 139
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 286 place count 74 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 287 place count 74 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 291 place count 72 transition count 135
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 327 place count 54 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 336 place count 54 transition count 146
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 346 place count 44 transition count 106
Iterating global reduction 6 with 10 rules applied. Total rules applied 356 place count 44 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 364 place count 44 transition count 98
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 366 place count 42 transition count 86
Iterating global reduction 7 with 2 rules applied. Total rules applied 368 place count 42 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 369 place count 42 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 379 place count 42 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 381 place count 40 transition count 73
Applied a total of 381 rules in 42 ms. Remains 40 /215 variables (removed 175) and now considering 73/301 (removed 228) transitions.
[2025-05-30 11:58:15] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
// Phase 1: matrix 55 rows 40 cols
[2025-05-30 11:58:15] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:15] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 11:58:15] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
[2025-05-30 11:58:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:58:15] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:58:15] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2025-05-30 11:58:15] [INFO ] Flow matrix only has 55 transitions (discarded 18 similar events)
[2025-05-30 11:58:15] [INFO ] Invariant cache hit.
[2025-05-30 11:58:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 54/94 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 1/95 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 46 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 54/94 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 58/103 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 1/95 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 104 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2888ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2890ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/215 places, 73/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3033 ms. Remains : 40/215 places, 73/301 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-09
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA CO4-PT-09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-09 finished in 3356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(!((p0 U p1) U (X(X(X(!p0)))&&p2))))))'
Support contains 5 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 301/301 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 210 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 210 transition count 296
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 205 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 205 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 204 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 204 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 203 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 203 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 203 transition count 286
Applied a total of 25 rules in 14 ms. Remains 203 /215 variables (removed 12) and now considering 286/301 (removed 15) transitions.
// Phase 1: matrix 286 rows 203 cols
[2025-05-30 11:58:18] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:18] [INFO ] Implicit Places using invariants in 67 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/215 places, 286/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 202/215 places, 286/301 transitions.
Stuttering acceptance computed with spot in 848 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
Running random walk in product with property : CO4-PT-09-LTLCardinality-10
Product exploration explored 100000 steps with 19951 reset in 130 ms.
Product exploration explored 100000 steps with 19968 reset in 167 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 446 edges and 202 vertex of which 199 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 276 ms. Reduced automaton from 17 states, 47 edges and 3 AP (stutter sensitive) to 17 states, 47 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 796 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
RANDOM walk for 40000 steps (482 resets) in 512 ms. (77 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40000 steps (117 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (131 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (114 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (156 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (173 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
// Phase 1: matrix 286 rows 202 cols
[2025-05-30 11:58:21] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 111/128 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 7/135 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 16/151 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 189/340 variables, 97/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 108/448 variables, 58/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 30/478 variables, 18/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 10/488 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/488 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 206 constraints, problems are : Problem set: 0 solved, 5 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 111/128 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/135 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 16/151 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:21] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 189/340 variables, 97/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 108/448 variables, 58/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:21] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 30/478 variables, 18/207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 10/488 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/488 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 213 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1330ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 272 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 286/286 transitions.
Graph (trivial) has 207 edges and 202 vertex of which 2 / 202 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 444 edges and 201 vertex of which 185 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 185 transition count 193
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 145 place count 121 transition count 191
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 145 place count 121 transition count 171
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 185 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 187 place count 99 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 189 place count 99 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 99 transition count 168
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 250 place count 69 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 257 place count 69 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 259 place count 68 transition count 124
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 261 place count 66 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 66 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 267 place count 64 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 269 place count 64 transition count 116
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 301 place count 48 transition count 130
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 323 place count 48 transition count 108
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 332 place count 39 transition count 81
Iterating global reduction 7 with 9 rules applied. Total rules applied 341 place count 39 transition count 81
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 348 place count 39 transition count 74
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 349 place count 38 transition count 69
Iterating global reduction 8 with 1 rules applied. Total rules applied 350 place count 38 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 351 place count 38 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 352 place count 38 transition count 67
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 360 place count 38 transition count 59
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 369 place count 30 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 371 place count 30 transition count 56
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 373 place count 30 transition count 56
Graph (complete) has 107 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 374 place count 29 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 376 place count 29 transition count 54
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 378 place count 29 transition count 54
Graph (complete) has 101 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 379 place count 28 transition count 54
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 381 place count 28 transition count 52
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 383 place count 28 transition count 52
Graph (complete) has 94 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 384 place count 27 transition count 52
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 386 place count 27 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 387 place count 26 transition count 49
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t87.t276.t84 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 3 rules applied. Total rules applied 390 place count 23 transition count 46
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 17 with 3 rules applied. Total rules applied 393 place count 21 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 394 place count 20 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 19 with 5 rules applied. Total rules applied 399 place count 20 transition count 40
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 400 place count 19 transition count 38
Iterating global reduction 19 with 1 rules applied. Total rules applied 401 place count 19 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 402 place count 19 transition count 37
Free-agglomeration rule applied 4 times.
Iterating global reduction 20 with 4 rules applied. Total rules applied 406 place count 19 transition count 33
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 411 place count 15 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 414 place count 15 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 415 place count 15 transition count 28
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 417 place count 14 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 418 place count 14 transition count 26
Applied a total of 418 rules in 33 ms. Remains 14 /202 variables (removed 188) and now considering 26/286 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 14/202 places, 26/286 transitions.
RANDOM walk for 16785 steps (4 resets) in 104 ms. (159 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 724 ms. Reduced automaton from 17 states, 47 edges and 3 AP (stutter sensitive) to 17 states, 47 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 870 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
Stuttering acceptance computed with spot in 833 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2025-05-30 11:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-30 11:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:25] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2025-05-30 11:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:28] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:28] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:28] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/488 variables, 202/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/488 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 209 constraints, problems are : Problem set: 0 solved, 285 unsolved in 18884 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/488 variables, 202/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 285/494 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:54] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 495 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48979ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 48980ms
Finished structural reductions in LTL mode , in 1 iterations and 49167 ms. Remains : 202/202 places, 286/286 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 446 edges and 202 vertex of which 199 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 271 ms. Reduced automaton from 17 states, 47 edges and 3 AP (stutter sensitive) to 17 states, 47 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 814 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
RANDOM walk for 40000 steps (140 resets) in 145 ms. (273 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40001 steps (198 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (161 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (141 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (163 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (122 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
[2025-05-30 11:59:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 111/128 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 7/135 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 16/151 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 189/340 variables, 97/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 108/448 variables, 58/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 30/478 variables, 18/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 10/488 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/488 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 206 constraints, problems are : Problem set: 0 solved, 5 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 111/128 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/135 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 16/151 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:16] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 189/340 variables, 97/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 108/448 variables, 58/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/448 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 30/478 variables, 18/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/478 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 10/488 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/488 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 212 constraints, problems are : Problem set: 0 solved, 5 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1239ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 217 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 286/286 transitions.
Graph (trivial) has 207 edges and 202 vertex of which 2 / 202 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 444 edges and 201 vertex of which 185 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 185 transition count 193
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 145 place count 121 transition count 191
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 145 place count 121 transition count 171
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 185 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 187 place count 99 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 189 place count 99 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 99 transition count 168
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 250 place count 69 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 257 place count 69 transition count 125
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 259 place count 68 transition count 124
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 261 place count 66 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 66 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 267 place count 64 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 269 place count 64 transition count 116
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 301 place count 48 transition count 130
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 323 place count 48 transition count 108
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 332 place count 39 transition count 81
Iterating global reduction 7 with 9 rules applied. Total rules applied 341 place count 39 transition count 81
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 348 place count 39 transition count 74
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 349 place count 38 transition count 69
Iterating global reduction 8 with 1 rules applied. Total rules applied 350 place count 38 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 351 place count 38 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 352 place count 38 transition count 67
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 360 place count 38 transition count 59
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 369 place count 30 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 371 place count 30 transition count 56
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 373 place count 30 transition count 56
Graph (complete) has 107 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 374 place count 29 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 376 place count 29 transition count 54
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 378 place count 29 transition count 54
Graph (complete) has 101 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 379 place count 28 transition count 54
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 381 place count 28 transition count 52
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 383 place count 28 transition count 52
Graph (complete) has 94 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 384 place count 27 transition count 52
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 386 place count 27 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 387 place count 26 transition count 49
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t87.t276.t84 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 3 rules applied. Total rules applied 390 place count 23 transition count 46
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 17 with 3 rules applied. Total rules applied 393 place count 21 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 394 place count 20 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 19 with 5 rules applied. Total rules applied 399 place count 20 transition count 40
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 400 place count 19 transition count 38
Iterating global reduction 19 with 1 rules applied. Total rules applied 401 place count 19 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 402 place count 19 transition count 37
Free-agglomeration rule applied 4 times.
Iterating global reduction 20 with 4 rules applied. Total rules applied 406 place count 19 transition count 33
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 411 place count 15 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 414 place count 15 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 415 place count 15 transition count 28
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 417 place count 14 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 418 place count 14 transition count 26
Applied a total of 418 rules in 35 ms. Remains 14 /202 variables (removed 188) and now considering 26/286 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 14/202 places, 26/286 transitions.
RANDOM walk for 20020 steps (4 resets) in 40 ms. (488 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 726 ms. Reduced automaton from 17 states, 47 edges and 3 AP (stutter sensitive) to 17 states, 47 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 790 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
Stuttering acceptance computed with spot in 846 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
Stuttering acceptance computed with spot in 834 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
Product exploration explored 100000 steps with 20012 reset in 130 ms.
Product exploration explored 100000 steps with 20070 reset in 142 ms.
Built C files in :
/tmp/ltsmin8353237436208795213
[2025-05-30 11:59:21] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8353237436208795213
Running compilation step : cd /tmp/ltsmin8353237436208795213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 525 ms.
Running link step : cd /tmp/ltsmin8353237436208795213;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8353237436208795213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8597353817102037075.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 286/286 transitions.
Applied a total of 0 rules in 5 ms. Remains 202 /202 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2025-05-30 11:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:36] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 11:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:36] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2025-05-30 11:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:39] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:40] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/488 variables, 202/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/488 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 209 constraints, problems are : Problem set: 0 solved, 285 unsolved in 19080 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/488 variables, 202/209 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 285/494 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:05] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 495 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49167ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 49168ms
Finished structural reductions in LTL mode , in 1 iterations and 49400 ms. Remains : 202/202 places, 286/286 transitions.
Built C files in :
/tmp/ltsmin14783132247546552178
[2025-05-30 12:00:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14783132247546552178
Running compilation step : cd /tmp/ltsmin14783132247546552178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 398 ms.
Running link step : cd /tmp/ltsmin14783132247546552178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14783132247546552178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased214316430762181886.hoa' '--buchi-type=spotba'
LTSmin run took 13703 ms.
FORMULA CO4-PT-09-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLCardinality-10 finished in 141737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 301/301 transitions.
Graph (trivial) has 223 edges and 215 vertex of which 2 / 215 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 483 edges and 214 vertex of which 211 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 210 transition count 222
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 154 place count 136 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 135 transition count 218
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 155 place count 135 transition count 198
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 195 place count 115 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 114 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 114 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 113 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 113 transition count 195
Performed 34 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 267 place count 79 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 277 place count 79 transition count 143
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 281 place count 77 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 76 transition count 139
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 76 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 287 place count 74 transition count 137
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 323 place count 56 transition count 157
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 331 place count 56 transition count 149
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 340 place count 47 transition count 113
Iterating global reduction 6 with 9 rules applied. Total rules applied 349 place count 47 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 355 place count 47 transition count 107
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 358 place count 44 transition count 89
Iterating global reduction 7 with 3 rules applied. Total rules applied 361 place count 44 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 363 place count 44 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 371 place count 44 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 373 place count 42 transition count 77
Applied a total of 373 rules in 29 ms. Remains 42 /215 variables (removed 173) and now considering 77/301 (removed 224) transitions.
[2025-05-30 12:00:40] [INFO ] Flow matrix only has 59 transitions (discarded 18 similar events)
// Phase 1: matrix 59 rows 42 cols
[2025-05-30 12:00:40] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:40] [INFO ] Implicit Places using invariants in 39 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/215 places, 77/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71 ms. Remains : 41/215 places, 77/301 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-11
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLCardinality-11 finished in 124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 301/301 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 206 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 206 transition count 292
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 200 transition count 284
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 200 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 200 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 199 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 199 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 198 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 198 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 198 transition count 280
Applied a total of 36 rules in 16 ms. Remains 198 /215 variables (removed 17) and now considering 280/301 (removed 21) transitions.
// Phase 1: matrix 280 rows 198 cols
[2025-05-30 12:00:40] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:40] [INFO ] Implicit Places using invariants in 66 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/215 places, 280/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 197 /197 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 197/215 places, 280/301 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLCardinality-13
Product exploration explored 100000 steps with 20000 reset in 89 ms.
Product exploration explored 100000 steps with 20000 reset in 95 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 440 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 40000 steps (383 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (181 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1042714 steps, run visited all 1 properties in 1162 ms. (steps per millisecond=897 )
Probabilistic random walk after 1042714 steps, saw 163259 distinct states, run finished after 1165 ms. (steps per millisecond=895 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 280/280 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 280/280 (removed 0) transitions.
// Phase 1: matrix 280 rows 197 cols
[2025-05-30 12:00:42] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:43] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-30 12:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:43] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2025-05-30 12:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:45] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:45] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 204 constraints, problems are : Problem set: 0 solved, 279 unsolved in 17570 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 279/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:09] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 484 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47638ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 47639ms
Finished structural reductions in LTL mode , in 1 iterations and 47834 ms. Remains : 197/197 places, 280/280 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 440 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 40000 steps (177 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (316 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1042714 steps, run visited all 1 properties in 1222 ms. (steps per millisecond=853 )
Probabilistic random walk after 1042714 steps, saw 163259 distinct states, run finished after 1222 ms. (steps per millisecond=853 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 97 ms.
Product exploration explored 100000 steps with 20000 reset in 101 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 280/280 transitions.
Graph (trivial) has 208 edges and 197 vertex of which 2 / 197 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 439 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 193 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 193 transition count 274
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 68 place count 193 transition count 295
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 193 transition count 295
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 178 transition count 280
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 178 transition count 280
Performed 26 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 146 place count 178 transition count 296
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 178 transition count 289
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 169 place count 162 transition count 271
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 162 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 162 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 162 transition count 269
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 193 place count 158 transition count 265
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 197 place count 158 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 158 transition count 265
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 156 transition count 263
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 156 transition count 263
Performed 25 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 228 place count 156 transition count 391
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 249 place count 156 transition count 370
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 295 place count 110 transition count 241
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 5 with 46 rules applied. Total rules applied 341 place count 110 transition count 241
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 358 place count 110 transition count 224
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 387 place count 81 transition count 161
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 416 place count 81 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 419 place count 81 transition count 158
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 425 place count 75 transition count 146
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 431 place count 75 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 432 place count 75 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 439 place count 75 transition count 164
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 442 place count 72 transition count 146
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 445 place count 72 transition count 146
Deduced a syphon composed of 37 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 458 place count 72 transition count 133
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 458 rules in 90 ms. Remains 72 /197 variables (removed 125) and now considering 133/280 (removed 147) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:01:33] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2025-05-30 12:01:33] [INFO ] Flow matrix only has 121 transitions (discarded 12 similar events)
// Phase 1: matrix 121 rows 72 cols
[2025-05-30 12:01:33] [INFO ] Computed 4 invariants in 1 ms
[2025-05-30 12:01:33] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:34] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:34] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:34] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:34] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 123 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 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 TDEAD101 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 TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 4 (OVERLAPS) 120/192 variables, 72/80 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 15/95 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/96 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/96 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/96 constraints. Problems are: Problem set: 72 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 96 constraints, problems are : Problem set: 72 solved, 60 unsolved in 3259 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 72 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/44 variables, 4/4 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 4/8 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 114/158 variables, 44/52 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 15/67 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 60/127 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/127 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 34/192 variables, 28/155 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/155 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/193 variables, 1/156 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/156 constraints. Problems are: Problem set: 72 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/193 variables, 0/156 constraints. Problems are: Problem set: 72 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 156 constraints, problems are : Problem set: 72 solved, 60 unsolved in 3539 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/132 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6832ms problems are : Problem set: 72 solved, 60 unsolved
Search for dead transitions found 72 dead transitions in 6838ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 72/197 places, 61/280 transitions.
Graph (complete) has 142 edges and 72 vertex of which 35 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 35 /72 variables (removed 37) and now considering 61/61 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/197 places, 61/280 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6938 ms. Remains : 35/197 places, 61/280 transitions.
Built C files in :
/tmp/ltsmin7158570999020102644
[2025-05-30 12:01:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7158570999020102644
Running compilation step : cd /tmp/ltsmin7158570999020102644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 368 ms.
Running link step : cd /tmp/ltsmin7158570999020102644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7158570999020102644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12025407322503403815.hoa' '--buchi-type=spotba'
LTSmin run took 117 ms.
FORMULA CO4-PT-09-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLCardinality-13 finished in 60460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 301/301 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 207 transition count 293
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 207 transition count 293
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 202 transition count 287
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 202 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 202 transition count 286
Applied a total of 27 rules in 8 ms. Remains 202 /215 variables (removed 13) and now considering 286/301 (removed 15) transitions.
// Phase 1: matrix 286 rows 202 cols
[2025-05-30 12:01:40] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:40] [INFO ] Implicit Places using invariants in 63 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/215 places, 286/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 201/215 places, 286/301 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-09-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 446 edges and 201 vertex of which 198 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-09-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-09-LTLCardinality-14 finished in 402 ms.
All properties solved by simple procedures.
Total runtime 213377 ms.

BK_STOP 1748606501365

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="CO4-PT-09"
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-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-09, 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 r044-tall-174854028500443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-09.tgz
mv CO4-PT-09 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 ;