Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028400435.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-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028400435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 138K 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-08-LTLCardinality-00
FORMULA_NAME CO4-PT-08-LTLCardinality-01
FORMULA_NAME CO4-PT-08-LTLCardinality-02
FORMULA_NAME CO4-PT-08-LTLCardinality-03
FORMULA_NAME CO4-PT-08-LTLCardinality-04
FORMULA_NAME CO4-PT-08-LTLCardinality-05
FORMULA_NAME CO4-PT-08-LTLCardinality-06
FORMULA_NAME CO4-PT-08-LTLCardinality-07
FORMULA_NAME CO4-PT-08-LTLCardinality-08
FORMULA_NAME CO4-PT-08-LTLCardinality-09
FORMULA_NAME CO4-PT-08-LTLCardinality-10
FORMULA_NAME CO4-PT-08-LTLCardinality-11
FORMULA_NAME CO4-PT-08-LTLCardinality-12
FORMULA_NAME CO4-PT-08-LTLCardinality-13
FORMULA_NAME CO4-PT-08-LTLCardinality-14
FORMULA_NAME CO4-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748606122615

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 11:55:25] [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:55:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:55:25] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-05-30 11:55:25] [INFO ] Transformed 467 places.
[2025-05-30 11:55:25] [INFO ] Transformed 600 transitions.
[2025-05-30 11:55:25] [INFO ] Found NUPN structural information;
[2025-05-30 11:55:25] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 108 places in 8 ms
Reduce places removed 108 places and 155 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 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 443
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 92 place count 269 transition count 364
Iterating global reduction 1 with 77 rules applied. Total rules applied 169 place count 269 transition count 364
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 173 place count 269 transition count 360
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 213 place count 229 transition count 302
Iterating global reduction 2 with 40 rules applied. Total rules applied 253 place count 229 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 254 place count 229 transition count 301
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 258 place count 225 transition count 293
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 225 transition count 293
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 266 place count 221 transition count 289
Iterating global reduction 3 with 4 rules applied. Total rules applied 270 place count 221 transition count 289
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 273 place count 218 transition count 286
Iterating global reduction 3 with 3 rules applied. Total rules applied 276 place count 218 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 279 place count 218 transition count 283
Applied a total of 279 rules in 106 ms. Remains 218 /359 variables (removed 141) and now considering 283/445 (removed 162) transitions.
// Phase 1: matrix 283 rows 218 cols
[2025-05-30 11:55:26] [INFO ] Computed 6 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:26] [INFO ] Implicit Places using invariants in 264 ms returned [5, 148]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 311 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 216/359 places, 283/445 transitions.
Applied a total of 0 rules in 5 ms. Remains 216 /216 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 437 ms. Remains : 216/359 places, 283/445 transitions.
Support contains 20 out of 216 places after structural reductions.
[2025-05-30 11:55:26] [INFO ] Flatten gal took : 44 ms
[2025-05-30 11:55:26] [INFO ] Flatten gal took : 23 ms
[2025-05-30 11:55:26] [INFO ] Input system was already deterministic with 283 transitions.
RANDOM walk for 40000 steps (273 resets) in 1230 ms. (32 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40000 steps (105 resets) in 222 ms. (179 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (160 resets) in 202 ms. (197 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (253 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (158 resets) in 143 ms. (277 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (196 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (114 resets) in 109 ms. (363 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (237 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
// Phase 1: matrix 283 rows 216 cols
[2025-05-30 11:55:27] [INFO ] Computed 4 invariants in 3 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 120/150 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 10/160 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 10/170 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 212/382 variables, 106/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 97/479 variables, 59/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 16/495 variables, 12/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/495 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 4/499 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/499 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/499 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 220 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3159 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 216/216 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 120/150 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10/160 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/170 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 212/382 variables, 106/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 97/479 variables, 59/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 16/495 variables, 12/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 4/499 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/499 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 225 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1142 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4332ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 5 properties in 136 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 385 edges and 216 vertex of which 212 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 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((((F(p0) U p1)&&X(p2)) U (!p3&&(F(p0) U p1)&&X(p2)))))'
Support contains 7 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 283/283 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 210 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 210 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 210 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 208 transition count 273
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 208 transition count 273
Applied a total of 17 rules in 12 ms. Remains 208 /216 variables (removed 8) and now considering 273/283 (removed 10) transitions.
// Phase 1: matrix 273 rows 208 cols
[2025-05-30 11:55:32] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-30 11:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:32] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-05-30 11:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:35] [INFO ] Deduced a trap composed of 12 places in 466 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/481 variables, 208/214 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:39] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 215 constraints, problems are : Problem set: 0 solved, 272 unsolved in 21388 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/481 variables, 208/215 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 272/487 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:58] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:08] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 489 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51475ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 51479ms
Starting structural reductions in LTL mode, iteration 1 : 208/216 places, 273/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51695 ms. Remains : 208/216 places, 273/283 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p2) (NOT p1) p3), (OR (NOT p1) (NOT p2) p3), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : CO4-PT-08-LTLCardinality-00
Product exploration explored 100000 steps with 25009 reset in 187 ms.
Product exploration explored 100000 steps with 25065 reset in 133 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 376 edges and 208 vertex of which 205 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 p3 p1 p0 p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 98 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (NOT p1) p3), (OR (NOT p1) (NOT p2) p3), (NOT p0), (NOT p1), (NOT p2), true]
RANDOM walk for 40000 steps (399 resets) in 398 ms. (100 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (278 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (293 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (233 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (251 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (257 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
[2025-05-30 11:56:25] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 87/106 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 12/118 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 10/128 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 198/326 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 124/450 variables, 69/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 26/476 variables, 18/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 5/481 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/481 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/481 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 212 constraints, problems are : Problem set: 0 solved, 5 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 208/208 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 87/106 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 12/118 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/128 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 198/326 variables, 94/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 124/450 variables, 69/196 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 15 (OVERLAPS) 26/476 variables, 18/214 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 5/481 variables, 3/217 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/481 variables, 0/217 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/481 variables, 0/217 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 217 constraints, problems are : Problem set: 2 solved, 3 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1076ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 41 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 273/273 transitions.
Graph (trivial) has 217 edges and 208 vertex of which 2 / 208 are part of one of the 1 SCC in 2 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 374 edges and 207 vertex of which 191 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 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 191 transition count 174
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 157 place count 121 transition count 172
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 157 place count 121 transition count 151
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 100 transition count 151
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 224 edges and 100 vertex of which 99 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 2 with 2 rules applied. Total rules applied 201 place count 99 transition count 150
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 3 with 2 rules applied. Total rules applied 203 place count 99 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 98 transition count 148
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 207 place count 95 transition count 145
Iterating global reduction 5 with 3 rules applied. Total rules applied 210 place count 95 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 211 place count 95 transition count 144
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 212 place count 94 transition count 143
Iterating global reduction 6 with 1 rules applied. Total rules applied 213 place count 94 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 214 place count 94 transition count 142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 215 place count 93 transition count 141
Iterating global reduction 7 with 1 rules applied. Total rules applied 216 place count 93 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 217 place count 93 transition count 140
Performed 35 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 287 place count 58 transition count 94
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 293 place count 58 transition count 88
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 298 place count 53 transition count 83
Iterating global reduction 9 with 5 rules applied. Total rules applied 303 place count 53 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 304 place count 53 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 312 place count 49 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 316 place count 49 transition count 74
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 319 place count 46 transition count 71
Iterating global reduction 11 with 3 rules applied. Total rules applied 322 place count 46 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 323 place count 46 transition count 70
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 324 place count 45 transition count 69
Iterating global reduction 12 with 1 rules applied. Total rules applied 325 place count 45 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 326 place count 45 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 328 place count 44 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 329 place count 44 transition count 66
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 330 place count 43 transition count 65
Iterating global reduction 14 with 1 rules applied. Total rules applied 331 place count 43 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 332 place count 43 transition count 64
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 15 with 18 rules applied. Total rules applied 350 place count 34 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 15 with 16 rules applied. Total rules applied 366 place count 34 transition count 49
Discarding 7 places :
Symmetric choice reduction at 16 with 7 rule applications. Total rules 373 place count 27 transition count 42
Iterating global reduction 16 with 7 rules applied. Total rules applied 380 place count 27 transition count 42
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 387 place count 27 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 389 place count 26 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 390 place count 26 transition count 38
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 391 place count 25 transition count 37
Iterating global reduction 17 with 1 rules applied. Total rules applied 392 place count 25 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 394 place count 25 transition count 35
Free-agglomeration rule applied 7 times.
Iterating global reduction 18 with 7 rules applied. Total rules applied 401 place count 25 transition count 28
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 9 rules applied. Total rules applied 410 place count 18 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 411 place count 17 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 413 place count 15 transition count 25
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 20 with 4 rules applied. Total rules applied 417 place count 13 transition count 23
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 421 place count 13 transition count 19
Applied a total of 421 rules in 58 ms. Remains 13 /208 variables (removed 195) and now considering 19/273 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 13/208 places, 19/273 transitions.
RANDOM walk for 39 steps (0 resets) in 9 ms. (3 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 p1 p0 p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p1 p3))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 14 factoid took 181 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), true]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), true]
[2025-05-30 11:56:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 11:56:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-30 11:56:27] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-30 11:56:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 11:56:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-30 11:56:27] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-05-30 11:56:27] [INFO ] Computed and/alt/rep : 270/451/270 causal constraints (skipped 2 transitions) in 15 ms.
[2025-05-30 11:56:28] [INFO ] Added : 122 causal constraints over 25 iterations in 517 ms. Result :sat
Could not prove EG p3
Support contains 3 out of 208 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 273/273 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2025-05-30 11:56:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 11:56:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:28] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-05-30 11:56:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:31] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:31] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/481 variables, 208/214 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:35] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 215 constraints, problems are : Problem set: 0 solved, 272 unsolved in 20723 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/481 variables, 208/215 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 272/487 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:53] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:03] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 489 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50778ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 50780ms
Finished structural reductions in LTL mode , in 1 iterations and 50965 ms. Remains : 208/208 places, 273/273 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 376 edges and 208 vertex of which 205 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 p3 p2), (X p3), (X (X p3)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), true]
RANDOM walk for 40000 steps (256 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (258 resets) in 37 ms. (1052 steps per ms) remains 1/2 properties
[2025-05-30 11:57:19] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/43 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/67 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 130/197 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 191/388 variables, 90/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/460 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/475 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/475 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/481 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/481 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/481 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/43 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/51 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/67 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 130/197 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 191/388 variables, 90/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/460 variables, 47/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 15/475 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/481 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/481 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/481 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 86 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p3 p2), (X p3), (X (X p3)), (X (X p2))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), true]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), true]
[2025-05-30 11:57:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 11:57:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-30 11:57:20] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-05-30 11:57:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 11:57:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-30 11:57:20] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-05-30 11:57:20] [INFO ] Computed and/alt/rep : 270/451/270 causal constraints (skipped 2 transitions) in 18 ms.
[2025-05-30 11:57:20] [INFO ] Added : 122 causal constraints over 25 iterations in 467 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), true]
Product exploration explored 100000 steps with 24966 reset in 104 ms.
Product exploration explored 100000 steps with 24927 reset in 203 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), true]
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 273/273 transitions.
Graph (trivial) has 214 edges and 208 vertex of which 2 / 208 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 375 edges and 207 vertex of which 204 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
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 204 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 204 transition count 267
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 76 place count 204 transition count 285
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 95 place count 204 transition count 285
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 114 place count 185 transition count 266
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 133 place count 185 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 184 transition count 265
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 184 transition count 265
Performed 32 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 167 place count 184 transition count 287
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 174 place count 184 transition count 280
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 196 place count 162 transition count 255
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 218 place count 162 transition count 255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 220 place count 162 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 224 place count 162 transition count 251
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 229 place count 157 transition count 246
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 234 place count 157 transition count 246
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 4 with 20 rules applied. Total rules applied 254 place count 157 transition count 327
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 275 place count 157 transition count 306
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 315 place count 117 transition count 213
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 5 with 40 rules applied. Total rules applied 355 place count 117 transition count 213
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 366 place count 117 transition count 202
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 392 place count 91 transition count 154
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 6 with 26 rules applied. Total rules applied 418 place count 91 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 421 place count 91 transition count 151
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 425 place count 87 transition count 143
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 429 place count 87 transition count 143
Performed 2 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 431 place count 87 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 434 place count 87 transition count 176
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 437 place count 84 transition count 158
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 440 place count 84 transition count 158
Deduced a syphon composed of 42 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 451 place count 84 transition count 147
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 452 place count 83 transition count 146
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 453 place count 83 transition count 146
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 453 rules in 71 ms. Remains 83 /208 variables (removed 125) and now considering 146/273 (removed 127) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:57:21] [INFO ] Redundant transitions in 6 ms returned []
Running 145 sub problems to find dead transitions.
[2025-05-30 11:57:21] [INFO ] Flow matrix only has 142 transitions (discarded 4 similar events)
// Phase 1: matrix 142 rows 83 cols
[2025-05-30 11:57:21] [INFO ] Computed 4 invariants in 1 ms
[2025-05-30 11:57:21] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:22] [INFO ] Deduced a trap composed of 4 places in 28 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 11:57:22] [INFO ] Deduced a trap composed of 6 places in 23 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 11:57:22] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:22] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 136 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 4 (OVERLAPS) 141/224 variables, 83/91 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 18/109 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/109 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/225 variables, 1/110 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/110 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/110 constraints. Problems are: Problem set: 68 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 110 constraints, problems are : Problem set: 68 solved, 77 unsolved in 4549 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 68 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 4/4 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 4/8 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 135/186 variables, 51/59 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 18/77 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 77/154 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/154 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 38/224 variables, 32/186 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/186 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/225 variables, 1/187 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/187 constraints. Problems are: Problem set: 68 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/225 variables, 0/187 constraints. Problems are: Problem set: 68 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 187 constraints, problems are : Problem set: 68 solved, 77 unsolved in 5563 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 77/145 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10139ms problems are : Problem set: 68 solved, 77 unsolved
Search for dead transitions found 68 dead transitions in 10139ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 83/208 places, 78/273 transitions.
Graph (complete) has 156 edges and 83 vertex of which 42 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 42 /83 variables (removed 41) and now considering 78/78 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/208 places, 78/273 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10231 ms. Remains : 42/208 places, 78/273 transitions.
Built C files in :
/tmp/ltsmin17899253155023010817
[2025-05-30 11:57:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17899253155023010817
Running compilation step : cd /tmp/ltsmin17899253155023010817;'/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 701 ms.
Running link step : cd /tmp/ltsmin17899253155023010817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17899253155023010817;'/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/stateBased17949164875407414276.hoa' '--buchi-type=spotba'
LTSmin run took 131 ms.
FORMULA CO4-PT-08-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-00 finished in 120462 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||(X(X(X(p1))) U (p0&&X(X(X(p1)))))))))'
Support contains 1 out of 216 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 283/283 transitions.
Graph (complete) has 385 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 214 transition count 203
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 83 rules applied. Total rules applied 162 place count 136 transition count 198
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 167 place count 132 transition count 197
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 167 place count 132 transition count 178
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 205 place count 113 transition count 178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 208 place count 110 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 211 place count 110 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 109 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 109 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 109 transition count 172
Performed 37 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 288 place count 72 transition count 125
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 295 place count 72 transition count 118
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 297 place count 70 transition count 116
Iterating global reduction 5 with 2 rules applied. Total rules applied 299 place count 70 transition count 116
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 303 place count 68 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 304 place count 68 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 332 place count 54 transition count 116
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 340 place count 54 transition count 108
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 351 place count 43 transition count 86
Iterating global reduction 7 with 11 rules applied. Total rules applied 362 place count 43 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 370 place count 43 transition count 78
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 373 place count 40 transition count 69
Iterating global reduction 8 with 3 rules applied. Total rules applied 376 place count 40 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 378 place count 40 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 380 place count 39 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 389 place count 39 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 391 place count 37 transition count 63
Applied a total of 391 rules in 33 ms. Remains 37 /216 variables (removed 179) and now considering 63/283 (removed 220) transitions.
[2025-05-30 11:57:32] [INFO ] Flow matrix only has 61 transitions (discarded 2 similar events)
// Phase 1: matrix 61 rows 37 cols
[2025-05-30 11:57:32] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 11:57:32] [INFO ] Flow matrix only has 61 transitions (discarded 2 similar events)
[2025-05-30 11:57:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:57:32] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:57:32] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2025-05-30 11:57:32] [INFO ] Flow matrix only has 61 transitions (discarded 2 similar events)
[2025-05-30 11:57:32] [INFO ] Invariant cache hit.
[2025-05-30 11:57:32] [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/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 60/97 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 42 constraints, problems are : Problem set: 0 solved, 48 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 60/97 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 48/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:34] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 91 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1612 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2458ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2458ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/216 places, 63/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2573 ms. Remains : 37/216 places, 63/283 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA CO4-PT-08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-06 finished in 2675 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(p0)||F(G(p1))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 283/283 transitions.
Graph (trivial) has 224 edges and 216 vertex of which 2 / 216 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 384 edges and 215 vertex of which 211 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 210 transition count 197
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 131 transition count 195
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 162 place count 131 transition count 176
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 200 place count 112 transition count 176
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 203 place count 109 transition count 172
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 109 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 108 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 108 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 209 place count 108 transition count 170
Performed 37 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 283 place count 71 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 286 place count 71 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 69 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 69 transition count 115
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 4 with 4 rules applied. Total rules applied 294 place count 67 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 295 place count 67 transition count 112
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 323 place count 53 transition count 115
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 53 transition count 107
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 341 place count 43 transition count 87
Iterating global reduction 6 with 10 rules applied. Total rules applied 351 place count 43 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 357 place count 43 transition count 81
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 360 place count 40 transition count 72
Iterating global reduction 7 with 3 rules applied. Total rules applied 363 place count 40 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 365 place count 40 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 367 place count 39 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 374 place count 39 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 376 place count 37 transition count 69
Applied a total of 376 rules in 29 ms. Remains 37 /216 variables (removed 179) and now considering 69/283 (removed 214) transitions.
[2025-05-30 11:57:35] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
// Phase 1: matrix 65 rows 37 cols
[2025-05-30 11:57:35] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 11:57:35] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
[2025-05-30 11:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:57:35] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:57:35] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2025-05-30 11:57:35] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
[2025-05-30 11:57:35] [INFO ] Invariant cache hit.
[2025-05-30 11:57:35] [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/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 64/101 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 42 constraints, problems are : Problem set: 0 solved, 54 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 64/101 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 96 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2297ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2298ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/216 places, 69/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2411 ms. Remains : 37/216 places, 69/283 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-09
Product exploration explored 100000 steps with 2 reset in 84 ms.
Product exploration explored 100000 steps with 46 reset in 84 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 496 steps (57 resets) in 8 ms. (55 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2025-05-30 11:57:38] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
[2025-05-30 11:57:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:38] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 11:57:38] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
[2025-05-30 11:57:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:57:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:57:38] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2025-05-30 11:57:38] [INFO ] Flow matrix only has 65 transitions (discarded 4 similar events)
[2025-05-30 11:57:38] [INFO ] Invariant cache hit.
[2025-05-30 11:57:38] [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/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 64/101 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 42 constraints, problems are : Problem set: 0 solved, 54 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 64/101 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 96 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2387ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2388ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2479 ms. Remains : 37/37 places, 69/69 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 2085 steps (249 resets) in 16 ms. (122 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 37 ms.
Product exploration explored 100000 steps with 40 reset in 69 ms.
Built C files in :
/tmp/ltsmin14119020106544515512
[2025-05-30 11:57:42] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2025-05-30 11:57:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:57:42] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2025-05-30 11:57:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:57:42] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2025-05-30 11:57:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:57:42] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14119020106544515512
Running compilation step : cd /tmp/ltsmin14119020106544515512;'/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 159 ms.
Running link step : cd /tmp/ltsmin14119020106544515512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14119020106544515512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18376827535143517959.hoa' '--buchi-type=spotba'
LTSmin run took 73 ms.
FORMULA CO4-PT-08-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-09 finished in 6915 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 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 283/283 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 206 transition count 272
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 206 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 206 transition count 271
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 200 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 200 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 200 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 199 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 199 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 198 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 198 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 198 transition count 260
Applied a total of 39 rules in 13 ms. Remains 198 /216 variables (removed 18) and now considering 260/283 (removed 23) transitions.
// Phase 1: matrix 260 rows 198 cols
[2025-05-30 11:57:42] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 11:57:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:42] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2025-05-30 11:57:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57: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 11:57:45] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/458 variables, 198/204 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:48] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 205 constraints, problems are : Problem set: 0 solved, 259 unsolved in 18791 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/458 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 259/464 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:07] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 465 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48823ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 48824ms
Starting structural reductions in LTL mode, iteration 1 : 198/216 places, 260/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48981 ms. Remains : 198/216 places, 260/283 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 357 edges and 198 vertex of which 195 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 10 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-08-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-08-LTLCardinality-11 finished in 49298 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((F(p0)||G(p1))))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 283/283 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 207 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 207 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 202 transition count 267
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 202 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 202 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 201 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 201 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 200 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 200 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 200 transition count 263
Applied a total of 35 rules in 8 ms. Remains 200 /216 variables (removed 16) and now considering 263/283 (removed 20) transitions.
// Phase 1: matrix 263 rows 200 cols
[2025-05-30 11:58:31] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 11:58:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:31] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-05-30 11:58:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:34] [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:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/206 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:38] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 207 constraints, problems are : Problem set: 0 solved, 262 unsolved in 19277 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 262/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:58:57] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 470 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49311ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 49311ms
Starting structural reductions in LTL mode, iteration 1 : 200/216 places, 263/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49479 ms. Remains : 200/216 places, 263/283 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-08-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 360 edges and 200 vertex of which 197 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 p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (325 resets) in 144 ms. (275 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (316 resets) in 130 ms. (305 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (111 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
[2025-05-30 11:59:21] [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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/424 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/454 variables, 19/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/463 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/89 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 188/277 variables, 66/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 147/424 variables, 83/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/454 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/463 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2025-05-30 11:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:22] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-30 11:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:22] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-05-30 11:59:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:25] [INFO ] Deduced a trap composed of 11 places in 34 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:25] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/206 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:29] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 207 constraints, problems are : Problem set: 0 solved, 262 unsolved in 19149 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/463 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 262/469 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:48] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 470 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49185ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 49186ms
Finished structural reductions in LTL mode , in 1 iterations and 49345 ms. Remains : 200/200 places, 263/263 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 360 edges and 200 vertex of which 197 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 p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 31302 steps (168 resets) in 98 ms. (316 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Product exploration explored 100000 steps with 25000 reset in 86 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 263/263 transitions.
Graph (trivial) has 207 edges and 200 vertex of which 2 / 200 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 359 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 196 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 196 transition count 257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 69 place count 196 transition count 276
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 89 place count 196 transition count 276
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 105 place count 180 transition count 260
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 121 place count 180 transition count 260
Performed 31 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 152 place count 180 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 158 place count 180 transition count 275
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 174 place count 164 transition count 257
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 190 place count 164 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 164 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 164 transition count 255
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 196 place count 161 transition count 252
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 199 place count 161 transition count 252
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 222 place count 161 transition count 343
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 244 place count 161 transition count 321
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 289 place count 116 transition count 217
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 5 with 45 rules applied. Total rules applied 334 place count 116 transition count 217
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 344 place count 116 transition count 207
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 373 place count 87 transition count 153
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 402 place count 87 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 405 place count 87 transition count 150
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 411 place count 81 transition count 138
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 417 place count 81 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 418 place count 81 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 421 place count 81 transition count 150
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 424 place count 78 transition count 132
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 427 place count 78 transition count 132
Deduced a syphon composed of 39 places in 0 ms
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 437 place count 78 transition count 122
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 437 rules in 32 ms. Remains 78 /200 variables (removed 122) and now considering 122/263 (removed 141) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:00:13] [INFO ] Redundant transitions in 3 ms returned []
Running 121 sub problems to find dead transitions.
[2025-05-30 12:00:13] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 78 cols
[2025-05-30 12:00:13] [INFO ] Computed 4 invariants in 1 ms
[2025-05-30 12:00:13] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:14] [INFO ] Deduced a trap composed of 6 places in 21 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:00:14] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:14] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 112 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 TDEAD19 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 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 TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 4 (OVERLAPS) 117/195 variables, 78/86 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 13/99 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/99 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/100 constraints. Problems are: Problem set: 62 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 100 constraints, problems are : Problem set: 62 solved, 59 unsolved in 2913 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 62 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 10/48 variables, 4/4 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 4/8 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 112/160 variables, 48/56 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 13/69 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 59/128 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/128 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 35/195 variables, 30/158 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/158 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/159 constraints. Problems are: Problem set: 62 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 159 constraints, problems are : Problem set: 62 solved, 59 unsolved in 3520 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 59/121 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6444ms problems are : Problem set: 62 solved, 59 unsolved
Search for dead transitions found 62 dead transitions in 6444ms
Found 62 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 62 transitions
Dead transitions reduction (with SMT) removed 62 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/200 places, 60/263 transitions.
Graph (complete) has 127 edges and 78 vertex of which 39 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 39 /78 variables (removed 39) and now considering 76/60 (removed -16) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/200 places, 76/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6490 ms. Remains : 39/200 places, 76/263 transitions.
Built C files in :
/tmp/ltsmin2835446453257519120
[2025-05-30 12:00:20] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2835446453257519120
Running compilation step : cd /tmp/ltsmin2835446453257519120;'/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 363 ms.
Running link step : cd /tmp/ltsmin2835446453257519120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2835446453257519120;'/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/stateBased6560367387444816992.hoa' '--buchi-type=spotba'
LTSmin run took 146 ms.
FORMULA CO4-PT-08-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLCardinality-12 finished in 109132 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||F(p1))))'
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 283/283 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 207 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 207 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 202 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 202 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 202 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 201 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 201 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 200 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 200 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 200 transition count 262
Applied a total of 35 rules in 9 ms. Remains 200 /216 variables (removed 16) and now considering 262/283 (removed 21) transitions.
// Phase 1: matrix 262 rows 200 cols
[2025-05-30 12:00:20] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 12:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:21] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-05-30 12:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:23] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:23] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/462 variables, 200/206 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:27] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 207 constraints, problems are : Problem set: 0 solved, 261 unsolved in 19613 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/462 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 261/468 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:47] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 0/462 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 469 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49650ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 49651ms
Starting structural reductions in LTL mode, iteration 1 : 200/216 places, 262/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49828 ms. Remains : 200/216 places, 262/283 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-08-LTLCardinality-13
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLCardinality-13 finished in 49969 ms.
All properties solved by simple procedures.
Total runtime 345237 ms.

BK_STOP 1748606470853

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ 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-08"
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-08, 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-174854028400435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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