Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500444.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CO4-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 152K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CO4-PT-09-LTLFireability-00
FORMULA_NAME CO4-PT-09-LTLFireability-01
FORMULA_NAME CO4-PT-09-LTLFireability-02
FORMULA_NAME CO4-PT-09-LTLFireability-03
FORMULA_NAME CO4-PT-09-LTLFireability-04
FORMULA_NAME CO4-PT-09-LTLFireability-05
FORMULA_NAME CO4-PT-09-LTLFireability-06
FORMULA_NAME CO4-PT-09-LTLFireability-07
FORMULA_NAME CO4-PT-09-LTLFireability-08
FORMULA_NAME CO4-PT-09-LTLFireability-09
FORMULA_NAME CO4-PT-09-LTLFireability-10
FORMULA_NAME CO4-PT-09-LTLFireability-11
FORMULA_NAME CO4-PT-09-LTLFireability-12
FORMULA_NAME CO4-PT-09-LTLFireability-13
FORMULA_NAME CO4-PT-09-LTLFireability-14
FORMULA_NAME CO4-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748606325771

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 11:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:58:47] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-05-30 11:58:47] [INFO ] Transformed 467 places.
[2025-05-30 11:58:47] [INFO ] Transformed 634 transitions.
[2025-05-30 11:58:47] [INFO ] Found NUPN structural information;
[2025-05-30 11:58:47] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 163 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 469
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 95 place count 266 transition count 387
Iterating global reduction 1 with 80 rules applied. Total rules applied 175 place count 266 transition count 387
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 179 place count 266 transition count 383
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 216 place count 229 transition count 326
Iterating global reduction 2 with 37 rules applied. Total rules applied 253 place count 229 transition count 326
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 325
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 261 place count 222 transition count 314
Iterating global reduction 3 with 7 rules applied. Total rules applied 268 place count 222 transition count 314
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 272 place count 218 transition count 310
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 218 transition count 310
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 279 place count 215 transition count 307
Iterating global reduction 3 with 3 rules applied. Total rules applied 282 place count 215 transition count 307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 285 place count 215 transition count 304
Applied a total of 285 rules in 93 ms. Remains 215 /359 variables (removed 144) and now considering 304/471 (removed 167) transitions.
// Phase 1: matrix 304 rows 215 cols
[2025-05-30 11:58:47] [INFO ] Computed 6 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:58:47] [INFO ] Implicit Places using invariants in 212 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/359 places, 304/471 transitions.
Applied a total of 0 rules in 6 ms. Remains 214 /214 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 358 ms. Remains : 214/359 places, 304/471 transitions.
Support contains 23 out of 214 places after structural reductions.
[2025-05-30 11:58:47] [INFO ] Flatten gal took : 52 ms
[2025-05-30 11:58:47] [INFO ] Flatten gal took : 18 ms
[2025-05-30 11:58:47] [INFO ] Input system was already deterministic with 304 transitions.
RANDOM walk for 40000 steps (321 resets) in 1243 ms. (32 steps per ms) remains 13/20 properties
BEST_FIRST walk for 40001 steps (168 resets) in 307 ms. (129 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (156 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (227 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (109 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (125 resets) in 170 ms. (233 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40001 steps (264 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (148 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (184 resets) in 165 ms. (240 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40001 steps (213 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (148 resets) in 126 ms. (314 steps per ms) remains 9/10 properties
// Phase 1: matrix 304 rows 214 cols
[2025-05-30 11:58:49] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10/518 variables, and 0 constraints, problems are : Problem set: 0 solved, 9 unsolved in 12514 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/214 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 16/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:01] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 8 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/36 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 102/138 variables, 36/42 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 199/337 variables, 72/115 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 7/122 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 152/489 variables, 86/208 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 24/513 variables, 17/225 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/513 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 5/518 variables, 3/228 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/518 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 228 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1600 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14157ms problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 813 steps, including 20 resets, run visited all 3 properties in 3 ms. (steps per millisecond=271 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 258 ms.
FORMULA CO4-PT-09-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA CO4-PT-09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 24 stable transitions
Graph (complete) has 491 edges and 214 vertex of which 210 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 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((G((p0||X(X(p0))))||((p0||X(X(p0)))&&G(F(p1))))))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 304/304 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 206 transition count 293
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 206 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 206 transition count 291
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 203 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 203 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 202 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 202 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 201 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 201 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 201 transition count 283
Applied a total of 29 rules in 18 ms. Remains 201 /214 variables (removed 13) and now considering 283/304 (removed 21) transitions.
// Phase 1: matrix 283 rows 201 cols
[2025-05-30 11:59:06] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:06] [INFO ] Implicit Places using invariants in 66 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/214 places, 283/304 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 200/214 places, 283/304 transitions.
Stuttering acceptance computed with spot in 495 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-01
Product exploration explored 100000 steps with 105 reset in 230 ms.
Product exploration explored 100000 steps with 17 reset in 116 ms.
Computed a total of 14 stabilizing places and 20 stable transitions
Graph (complete) has 443 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 20 stable transitions
Detected a total of 14/200 stabilizing places and 20/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (274 resets) in 290 ms. (137 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (118 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (177 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
// Phase 1: matrix 283 rows 200 cols
[2025-05-30 11:59:07] [INFO ] Computed 4 invariants in 2 ms
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/108 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 180/288 variables, 63/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 155/443 variables, 85/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 31/474 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/483 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Problem apf1 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/483 variables, 1/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/483 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/483 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 206 constraints, problems are : Problem set: 1 solved, 1 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/32 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/41 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/56 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 142/198 variables, 42/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 191/389 variables, 89/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/389 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 80/469 variables, 52/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/469 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/482 variables, 7/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/483 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/483 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/483 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 207 constraints, problems are : Problem set: 1 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 643ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 10 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-09-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-09-LTLFireability-01 finished in 4523 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||X(p1))) U X(p2)))'
Support contains 5 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 304/304 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 204 transition count 291
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 204 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 204 transition count 289
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 200 transition count 283
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 200 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 199 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 199 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 198 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 198 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 198 transition count 280
Applied a total of 35 rules in 19 ms. Remains 198 /214 variables (removed 16) and now considering 280/304 (removed 24) transitions.
// Phase 1: matrix 280 rows 198 cols
[2025-05-30 11:59:08] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:08] [INFO ] Implicit Places using invariants in 60 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/214 places, 280/304 transitions.
Applied a total of 0 rules in 3 ms. Remains 197 /197 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 197/214 places, 280/304 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-09-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-02 finished in 290 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(((X(!p0)&&F((G(F(p1))||(p2&&F(p1)))))||X((X(p3)||G(!p0))))))'
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 304/304 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 207 transition count 295
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 207 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 207 transition count 293
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 205 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 205 transition count 290
Applied a total of 20 rules in 12 ms. Remains 205 /214 variables (removed 9) and now considering 290/304 (removed 14) transitions.
// Phase 1: matrix 290 rows 205 cols
[2025-05-30 11:59:08] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:08] [INFO ] Implicit Places using invariants in 71 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 204/214 places, 290/304 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 204/214 places, 290/304 transitions.
Stuttering acceptance computed with spot in 526 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (AND p0 (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND p0 (NOT p1) p3)]
Running random walk in product with property : CO4-PT-09-LTLFireability-04
Product exploration explored 100000 steps with 33259 reset in 146 ms.
Product exploration explored 100000 steps with 33326 reset in 144 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 450 edges and 204 vertex of which 201 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 p1 p2 (NOT p0) (NOT p3)), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 162 ms. Reduced automaton from 14 states, 31 edges and 4 AP (stutter sensitive) to 14 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 560 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (AND p0 (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND p0 (NOT p1) p3)]
Reduction of identical properties reduced properties to check from 22 to 19
RANDOM walk for 40000 steps (169 resets) in 306 ms. (130 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (27 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (25 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (33 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (28 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (31 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 552542 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 18
Probabilistic random walk after 552542 steps, saw 87077 distinct states, run finished after 3006 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 290 rows 204 cols
[2025-05-30 11:59:13] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf15 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/46 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 140/186 variables, 26/38 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 10/196 variables, 2/40 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/43 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 10/206 variables, 2/45 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:13] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 1/46 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 198/404 variables, 103/149 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 81/485 variables, 54/203 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/485 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 9/494 variables, 6/209 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 0/494 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 209 constraints, problems are : Problem set: 2 solved, 16 unsolved in 1543 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/46 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 16/28 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 140/186 variables, 26/54 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 10/196 variables, 2/56 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 3/59 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/206 variables, 2/61 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 1/62 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 198/404 variables, 103/165 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 81/485 variables, 54/219 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/485 variables, 0/219 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 9/494 variables, 6/225 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/494 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 494/494 variables, and 225 constraints, problems are : Problem set: 2 solved, 16 unsolved in 1724 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 16/18 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3287ms problems are : Problem set: 2 solved, 16 unsolved
Fused 16 Parikh solutions to 9 different solutions.
Parikh walk visited 12 properties in 467 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 290/290 transitions.
Graph (trivial) has 210 edges and 204 vertex of which 2 / 204 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 448 edges and 203 vertex of which 187 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 187 transition count 195
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 149 place count 121 transition count 193
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 149 place count 121 transition count 170
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 195 place count 98 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 197 place count 96 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 96 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 201 place count 96 transition count 166
Performed 29 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 259 place count 67 transition count 130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 266 place count 67 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 268 place count 66 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 270 place count 64 transition count 118
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 64 transition count 118
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 5 with 2 rules applied. Total rules applied 274 place count 63 transition count 117
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 63 transition count 116
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 305 place count 48 transition count 132
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 326 place count 48 transition count 111
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 336 place count 38 transition count 81
Iterating global reduction 7 with 10 rules applied. Total rules applied 346 place count 38 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 352 place count 38 transition count 75
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 355 place count 35 transition count 60
Iterating global reduction 8 with 3 rules applied. Total rules applied 358 place count 35 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 360 place count 35 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 362 place count 34 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 365 place count 34 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 374 place count 34 transition count 63
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 382 place count 34 transition count 55
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 392 place count 26 transition count 53
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 394 place count 26 transition count 53
Graph (complete) has 93 edges and 26 vertex of which 25 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 11 with 1 rules applied. Total rules applied 395 place count 25 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 397 place count 25 transition count 51
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 399 place count 25 transition count 51
Graph (complete) has 87 edges and 25 vertex of which 24 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 13 with 1 rules applied. Total rules applied 400 place count 24 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 402 place count 24 transition count 49
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 404 place count 24 transition count 49
Graph (complete) has 81 edges and 24 vertex of which 23 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 15 with 1 rules applied. Total rules applied 405 place count 23 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 407 place count 23 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 408 place count 22 transition count 46
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t86.t251.t83 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 17 with 3 rules applied. Total rules applied 411 place count 19 transition count 43
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 16 vertex of which 6 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 18 with 5 rules applied. Total rules applied 416 place count 11 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 19 with 25 rules applied. Total rules applied 441 place count 11 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 442 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 443 place count 10 transition count 16
Applied a total of 443 rules in 51 ms. Remains 10 /204 variables (removed 194) and now considering 16/290 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 10/204 places, 16/290 transitions.
RANDOM walk for 33370 steps (8 resets) in 185 ms. (179 steps per ms) remains 0/4 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0) (NOT p3)), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR p0 p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p3))), (F p3), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR p0 p2))), (F p0)]
Knowledge based reduction with 23 factoid took 1008 ms. Reduced automaton from 14 states, 31 edges and 4 AP (stutter sensitive) to 14 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 594 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 602 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND (NOT p1) p3)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 290/290 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2025-05-30 11:59:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:19] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-30 11:59:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:59:19] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-05-30 11:59:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:22] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:59:22] [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:23] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/494 variables, 204/211 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 0/494 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 211 constraints, problems are : Problem set: 0 solved, 289 unsolved in 19728 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/494 variables, 204/211 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 289/500 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:04] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 501 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49839ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49841ms
Finished structural reductions in LTL mode , in 1 iterations and 50053 ms. Remains : 204/204 places, 290/290 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 450 edges and 204 vertex of which 201 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 p1 p2 (NOT p0) (NOT p3)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 172 ms. Reduced automaton from 14 states, 29 edges and 4 AP (stutter sensitive) to 14 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 512 ms :[(OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND (NOT p1) p3)]
RANDOM walk for 40000 steps (246 resets) in 383 ms. (104 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (30 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (31 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (31 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (31 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (31 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (30 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (29 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 783450 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 16
Probabilistic random walk after 783450 steps, saw 118863 distinct states, run finished after 3003 ms. (steps per millisecond=260 ) properties seen :0
[2025-05-30 12:00:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/46 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 140/186 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 10/196 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 10/206 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 198/404 variables, 103/148 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 81/485 variables, 54/202 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 9/494 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/494 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 0/494 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 208 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1542 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/46 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 140/186 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 10/196 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 10/206 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:15] [INFO ] Deduced a trap composed of 11 places in 38 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:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 198/404 variables, 103/166 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 81/485 variables, 54/220 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/485 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 9/494 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:16] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 0/494 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 494/494 variables, and 227 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2523 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4074ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 9 properties in 880 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 290/290 transitions.
Graph (trivial) has 210 edges and 204 vertex of which 2 / 204 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 448 edges and 203 vertex of which 187 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 187 transition count 195
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 149 place count 121 transition count 193
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 149 place count 121 transition count 170
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 195 place count 98 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 197 place count 96 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 96 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 201 place count 96 transition count 166
Performed 29 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 259 place count 67 transition count 130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 266 place count 67 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 268 place count 66 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 270 place count 64 transition count 118
Iterating global reduction 5 with 2 rules applied. Total rules applied 272 place count 64 transition count 118
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 5 with 2 rules applied. Total rules applied 274 place count 63 transition count 117
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 63 transition count 116
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 305 place count 48 transition count 132
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 326 place count 48 transition count 111
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 336 place count 38 transition count 81
Iterating global reduction 7 with 10 rules applied. Total rules applied 346 place count 38 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 352 place count 38 transition count 75
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 355 place count 35 transition count 60
Iterating global reduction 8 with 3 rules applied. Total rules applied 358 place count 35 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 360 place count 35 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 362 place count 34 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 365 place count 34 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 374 place count 34 transition count 63
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 382 place count 34 transition count 55
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 392 place count 26 transition count 53
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 394 place count 26 transition count 53
Graph (complete) has 93 edges and 26 vertex of which 25 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 11 with 1 rules applied. Total rules applied 395 place count 25 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 397 place count 25 transition count 51
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 399 place count 25 transition count 51
Graph (complete) has 87 edges and 25 vertex of which 24 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 13 with 1 rules applied. Total rules applied 400 place count 24 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 402 place count 24 transition count 49
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 404 place count 24 transition count 49
Graph (complete) has 81 edges and 24 vertex of which 23 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 15 with 1 rules applied. Total rules applied 405 place count 23 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 407 place count 23 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 408 place count 22 transition count 46
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t86.t251.t83 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 17 with 3 rules applied. Total rules applied 411 place count 19 transition count 43
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 16 vertex of which 6 / 16 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 18 with 5 rules applied. Total rules applied 416 place count 11 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 19 with 25 rules applied. Total rules applied 441 place count 11 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 442 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 443 place count 10 transition count 16
Applied a total of 443 rules in 39 ms. Remains 10 /204 variables (removed 194) and now considering 16/290 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 10/204 places, 16/290 transitions.
RANDOM walk for 40000 steps (8 resets) in 91 ms. (434 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p1 p2 (NOT p0) (NOT p3)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 p3))), (F p0), (F (NOT (OR (NOT p0) p2 p3))), (F p3), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (OR p1 (NOT p3)))), (F (NOT (OR p1 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 21 factoid took 826 ms. Reduced automaton from 14 states, 29 edges and 4 AP (stutter sensitive) to 14 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 591 ms :[(OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 591 ms :[(OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 620 ms :[(OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND (NOT p1) p3)]
Product exploration explored 100000 steps with 33268 reset in 96 ms.
Product exploration explored 100000 steps with 33405 reset in 106 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 601 ms :[(OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3) p0), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p2) (NOT p1) (NOT p0) p3) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0), (NOT p1), (NOT p1), (AND (NOT p1) p3)]
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 290/290 transitions.
Graph (trivial) has 210 edges and 204 vertex of which 2 / 204 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 449 edges and 203 vertex of which 200 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 200 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 200 transition count 284
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 71 place count 200 transition count 304
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 92 place count 200 transition count 304
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 109 place count 183 transition count 287
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 126 place count 183 transition count 287
Performed 25 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 151 place count 183 transition count 300
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 183 transition count 295
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 170 place count 169 transition count 279
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 3 with 14 rules applied. Total rules applied 184 place count 169 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 169 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 186 place count 169 transition count 278
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 188 place count 167 transition count 276
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 167 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 167 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 166 transition count 275
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 166 transition count 275
Performed 25 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 218 place count 166 transition count 395
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 233 place count 166 transition count 380
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 278 place count 121 transition count 256
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 5 with 45 rules applied. Total rules applied 323 place count 121 transition count 256
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 335 place count 121 transition count 244
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 360 place count 96 transition count 190
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 6 with 25 rules applied. Total rules applied 385 place count 96 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 388 place count 96 transition count 187
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 394 place count 90 transition count 175
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 400 place count 90 transition count 175
Deduced a syphon composed of 45 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 421 place count 90 transition count 154
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 422 place count 89 transition count 153
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 423 place count 89 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 425 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 427 place count 87 transition count 175
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 429 place count 87 transition count 175
Deduced a syphon composed of 44 places in 0 ms
Applied a total of 429 rules in 67 ms. Remains 87 /204 variables (removed 117) and now considering 175/290 (removed 115) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:00:22] [INFO ] Redundant transitions in 5 ms returned []
Running 174 sub problems to find dead transitions.
[2025-05-30 12:00:22] [INFO ] Flow matrix only has 168 transitions (discarded 7 similar events)
// Phase 1: matrix 168 rows 87 cols
[2025-05-30 12:00:22] [INFO ] Computed 4 invariants in 0 ms
[2025-05-30 12:00:22] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 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 4 places in 27 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:23] [INFO ] Deduced a trap composed of 6 places in 28 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:23] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
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 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 165 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 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 TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
At refinement iteration 4 (OVERLAPS) 167/254 variables, 87/95 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 39/134 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/134 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/255 variables, 1/135 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/135 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/255 variables, 0/135 constraints. Problems are: Problem set: 88 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 135 constraints, problems are : Problem set: 88 solved, 86 unsolved in 5106 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 88 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 10/52 variables, 4/4 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/8 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 164/216 variables, 52/60 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 39/99 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 86/185 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/185 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 38/254 variables, 35/220 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/220 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 1/255 variables, 1/221 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/221 constraints. Problems are: Problem set: 88 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 0/255 variables, 0/221 constraints. Problems are: Problem set: 88 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 221 constraints, problems are : Problem set: 88 solved, 86 unsolved in 7153 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 86/174 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12293ms problems are : Problem set: 88 solved, 86 unsolved
Search for dead transitions found 88 dead transitions in 12295ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/204 places, 87/290 transitions.
Graph (complete) has 173 edges and 87 vertex of which 43 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 43 /87 variables (removed 44) and now considering 87/87 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/204 places, 87/290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12379 ms. Remains : 43/204 places, 87/290 transitions.
Built C files in :
/tmp/ltsmin704103699285744105
[2025-05-30 12:00:34] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin704103699285744105
Running compilation step : cd /tmp/ltsmin704103699285744105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 525 ms.
Running link step : cd /tmp/ltsmin704103699285744105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin704103699285744105;'/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/stateBased13023982292060131811.hoa' '--buchi-type=spotba'
LTSmin run took 857 ms.
FORMULA CO4-PT-09-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLFireability-04 finished in 87577 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((p0&&F(G(p1))))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 304/304 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 204 transition count 291
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 204 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 204 transition count 289
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 200 transition count 283
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 200 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 199 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 199 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 198 transition count 281
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 198 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 198 transition count 280
Applied a total of 35 rules in 16 ms. Remains 198 /214 variables (removed 16) and now considering 280/304 (removed 24) transitions.
// Phase 1: matrix 280 rows 198 cols
[2025-05-30 12:00:36] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:36] [INFO ] Implicit Places using invariants in 71 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/214 places, 280/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 197 /197 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 197/214 places, 280/304 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 3 reset in 63 ms.
Product exploration explored 100000 steps with 229 reset in 180 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 440 edges and 197 vertex of which 194 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
RANDOM walk for 40000 steps (69 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (217 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1091127 steps, run visited all 1 properties in 1401 ms. (steps per millisecond=778 )
Probabilistic random walk after 1091127 steps, saw 174850 distinct states, run finished after 1406 ms. (steps per millisecond=776 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Support contains 1 out of 197 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 : 197/197 places, 280/280 transitions.
Graph (trivial) has 203 edges and 197 vertex of which 2 / 197 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 439 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 192 transition count 212
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 129 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 128 transition count 209
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 132 place count 128 transition count 185
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 180 place count 104 transition count 185
Performed 28 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 236 place count 76 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 242 place count 76 transition count 144
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 244 place count 75 transition count 143
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 246 place count 73 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 248 place count 73 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 252 place count 71 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 254 place count 71 transition count 135
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 288 place count 54 transition count 155
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 297 place count 54 transition count 146
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 307 place count 44 transition count 106
Iterating global reduction 7 with 10 rules applied. Total rules applied 317 place count 44 transition count 106
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 324 place count 44 transition count 99
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 327 place count 41 transition count 81
Iterating global reduction 8 with 3 rules applied. Total rules applied 330 place count 41 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 332 place count 41 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 334 place count 40 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 345 place count 40 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 347 place count 38 transition count 75
Applied a total of 347 rules in 26 ms. Remains 38 /197 variables (removed 159) and now considering 75/280 (removed 205) transitions.
[2025-05-30 12:00:38] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 38 cols
[2025-05-30 12:00:38] [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:38] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 12:00:38] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
[2025-05-30 12:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:00:38] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:00:38] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2025-05-30 12:00:38] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
[2025-05-30 12:00:38] [INFO ] Invariant cache hit.
[2025-05-30 12:00:38] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 59/97 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 44 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 59/97 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 60/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 104 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2754ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2754ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/197 places, 75/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2859 ms. Remains : 38/197 places, 75/280 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
RANDOM walk for 5523 steps (654 resets) in 71 ms. (76 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3 reset in 79 ms.
Product exploration explored 100000 steps with 38 reset in 67 ms.
Built C files in :
/tmp/ltsmin3282173797924153162
[2025-05-30 12:00:41] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2025-05-30 12:00:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:00:41] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2025-05-30 12:00:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:00:41] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2025-05-30 12:00:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:00:41] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3282173797924153162
Running compilation step : cd /tmp/ltsmin3282173797924153162;'/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 190 ms.
Running link step : cd /tmp/ltsmin3282173797924153162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3282173797924153162;'/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/stateBased18445048527041742744.hoa' '--buchi-type=spotba'
LTSmin run took 250 ms.
FORMULA CO4-PT-09-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLFireability-06 finished in 6140 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(G((p0||X(X(p1))||G(p2)))))))'
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 304/304 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 205 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 205 transition count 292
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 205 transition count 291
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 201 transition count 285
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 201 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 200 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 200 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 199 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 199 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 199 transition count 282
Applied a total of 32 rules in 13 ms. Remains 199 /214 variables (removed 15) and now considering 282/304 (removed 22) transitions.
// Phase 1: matrix 282 rows 199 cols
[2025-05-30 12:00:42] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:42] [INFO ] Implicit Places using invariants in 111 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/214 places, 282/304 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 198/214 places, 282/304 transitions.
Stuttering acceptance computed with spot in 397 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CO4-PT-09-LTLFireability-08
Product exploration explored 100000 steps with 194 reset in 69 ms.
Product exploration explored 100000 steps with 5 reset in 67 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 441 edges and 198 vertex of which 194 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (291 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (270 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (142 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (203 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (169 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (106 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (273 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (220 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 1052064 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :5 out of 7
Probabilistic random walk after 1052064 steps, saw 165865 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :5
// Phase 1: matrix 282 rows 198 cols
[2025-05-30 12:00:46] [INFO ] Computed 4 invariants in 1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/21 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/37 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 101/138 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/145 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/161 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 189/350 variables, 94/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/350 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 109/459 variables, 61/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 20/479 variables, 14/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/479 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
At refinement iteration 22 (OVERLAPS) 1/480 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/480 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/480 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 202 constraints, problems are : Problem set: 1 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/12 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/21 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/37 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 101/138 variables, 13/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/145 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/161 variables, 3/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/161 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 189/350 variables, 94/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 109/459 variables, 61/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/479 variables, 14/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/479 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 480/480 variables, and 203 constraints, problems are : Problem set: 2 solved, 0 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (G (OR p1 (NOT p2))), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT p1)), (F p2)]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-05-30 12:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:48] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-30 12:00:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:00:48] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-05-30 12:00:48] [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, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:50] [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 12:00:50] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:00:51] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/480 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 205 constraints, problems are : Problem set: 0 solved, 281 unsolved in 18492 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 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, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/480 variables, 198/205 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 281/486 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:18] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 487 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48560ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 48560ms
Finished structural reductions in LTL mode , in 1 iterations and 48740 ms. Remains : 198/198 places, 282/282 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 441 edges and 198 vertex of which 194 are kept as prefixes of interest. Removing 4 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 97 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (82 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (123 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (315 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1042788 steps, run visited all 2 properties in 1799 ms. (steps per millisecond=579 )
Probabilistic random walk after 1042788 steps, saw 163285 distinct states, run finished after 1799 ms. (steps per millisecond=579 ) properties seen :2
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20 reset in 67 ms.
Product exploration explored 100000 steps with 92 reset in 71 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 282/282 transitions.
Graph (trivial) has 207 edges and 198 vertex of which 2 / 198 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 440 edges and 197 vertex of which 196 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
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 280
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 278
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 69 place count 196 transition count 299
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 91 place count 196 transition count 299
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 106 place count 181 transition count 284
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 121 place count 181 transition count 284
Performed 26 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 147 place count 181 transition count 300
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 154 place count 181 transition count 293
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 170 place count 165 transition count 275
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 186 place count 165 transition count 275
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 188 place count 165 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 190 place count 165 transition count 273
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 194 place count 161 transition count 269
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 161 transition count 269
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 161 transition count 269
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 202 place count 159 transition count 267
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 159 transition count 267
Performed 25 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 229 place count 159 transition count 395
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 246 place count 159 transition count 378
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 292 place count 113 transition count 248
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 5 with 46 rules applied. Total rules applied 338 place count 113 transition count 248
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 355 place count 113 transition count 231
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 384 place count 84 transition count 168
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 413 place count 84 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 416 place count 84 transition count 165
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 422 place count 78 transition count 153
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 428 place count 78 transition count 153
Deduced a syphon composed of 40 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 448 place count 78 transition count 133
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 449 place count 77 transition count 132
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 450 place count 77 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 451 place count 77 transition count 156
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 453 place count 75 transition count 142
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 455 place count 75 transition count 142
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 455 rules in 41 ms. Remains 75 /198 variables (removed 123) and now considering 142/282 (removed 140) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:01:40] [INFO ] Redundant transitions in 4 ms returned []
Running 141 sub problems to find dead transitions.
[2025-05-30 12:01:40] [INFO ] Flow matrix only has 129 transitions (discarded 13 similar events)
// Phase 1: matrix 129 rows 75 cols
[2025-05-30 12:01:40] [INFO ] Computed 4 invariants in 1 ms
[2025-05-30 12:01:40] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:41] [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:01:41] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:01:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 132 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 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 TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 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 TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 4 (OVERLAPS) 128/203 variables, 75/83 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 14/97 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/97 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/98 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/98 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/98 constraints. Problems are: Problem set: 77 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 98 constraints, problems are : Problem set: 77 solved, 64 unsolved in 3479 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 77 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 10/46 variables, 4/4 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/8 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 123/169 variables, 46/54 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 14/68 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 64/132 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/132 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 34/203 variables, 29/161 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/161 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 1/204 variables, 1/162 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/162 constraints. Problems are: Problem set: 77 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/162 constraints. Problems are: Problem set: 77 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 162 constraints, problems are : Problem set: 77 solved, 64 unsolved in 4439 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 64/141 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7935ms problems are : Problem set: 77 solved, 64 unsolved
Search for dead transitions found 77 dead transitions in 7935ms
Found 77 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 77 transitions
Dead transitions reduction (with SMT) removed 77 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 75/198 places, 65/282 transitions.
Graph (complete) has 149 edges and 75 vertex of which 37 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 37 /75 variables (removed 38) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/198 places, 65/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7997 ms. Remains : 37/198 places, 65/282 transitions.
Built C files in :
/tmp/ltsmin11473117041127104431
[2025-05-30 12:01:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11473117041127104431
Running compilation step : cd /tmp/ltsmin11473117041127104431;'/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 374 ms.
Running link step : cd /tmp/ltsmin11473117041127104431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11473117041127104431;'/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/stateBased14178728811607404160.hoa' '--buchi-type=spotba'
LTSmin run took 4126 ms.
FORMULA CO4-PT-09-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLFireability-08 finished in 70578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 304/304 transitions.
Graph (trivial) has 224 edges and 214 vertex of which 2 / 214 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 490 edges and 213 vertex of which 209 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 208 transition count 224
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 152 place count 135 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 134 transition count 220
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 153 place count 134 transition count 198
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 197 place count 112 transition count 198
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 202 place count 107 transition count 190
Iterating global reduction 3 with 5 rules applied. Total rules applied 207 place count 107 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 107 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 208 place count 107 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 106 transition count 188
Performed 30 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 270 place count 76 transition count 151
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 279 place count 76 transition count 142
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 283 place count 74 transition count 140
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 285 place count 72 transition count 136
Iterating global reduction 6 with 2 rules applied. Total rules applied 287 place count 72 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 291 place count 70 transition count 134
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 327 place count 52 transition count 154
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 336 place count 52 transition count 145
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 347 place count 41 transition count 101
Iterating global reduction 7 with 11 rules applied. Total rules applied 358 place count 41 transition count 101
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 366 place count 41 transition count 93
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 369 place count 38 transition count 75
Iterating global reduction 8 with 3 rules applied. Total rules applied 372 place count 38 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 374 place count 38 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 382 place count 38 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 384 place count 36 transition count 63
Applied a total of 384 rules in 19 ms. Remains 36 /214 variables (removed 178) and now considering 63/304 (removed 241) transitions.
[2025-05-30 12:01:52] [INFO ] Flow matrix only has 50 transitions (discarded 13 similar events)
// Phase 1: matrix 50 rows 36 cols
[2025-05-30 12:01:52] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:52] [INFO ] Implicit Places using invariants in 33 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/214 places, 63/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 35/214 places, 63/304 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-09
Product exploration explored 100000 steps with 71 reset in 31 ms.
Product exploration explored 100000 steps with 54 reset in 27 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 6487 steps (780 resets) in 10 ms. (589 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 12:01:53] [INFO ] Flow matrix only has 50 transitions (discarded 13 similar events)
// Phase 1: matrix 50 rows 35 cols
[2025-05-30 12:01:53] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-30 12:01:53] [INFO ] Flow matrix only has 50 transitions (discarded 13 similar events)
[2025-05-30 12:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:01:53] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:01:53] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2025-05-30 12:01:53] [INFO ] Flow matrix only has 50 transitions (discarded 13 similar events)
[2025-05-30 12:01:53] [INFO ] Invariant cache hit.
[2025-05-30 12:01:53] [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/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 49/84 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/85 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 40 constraints, problems are : Problem set: 0 solved, 48 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 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/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 49/84 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 48/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/85 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 88 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1844ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1844ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1984 ms. Remains : 35/35 places, 63/63 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 17072 steps (2064 resets) in 27 ms. (609 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 47 reset in 39 ms.
Product exploration explored 100000 steps with 36 reset in 28 ms.
Built C files in :
/tmp/ltsmin10668962734895591157
[2025-05-30 12:01:55] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2025-05-30 12:01:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:01:55] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2025-05-30 12:01:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:01:55] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2025-05-30 12:01:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:01:55] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10668962734895591157
Running compilation step : cd /tmp/ltsmin10668962734895591157;'/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 153 ms.
Running link step : cd /tmp/ltsmin10668962734895591157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10668962734895591157;'/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/stateBased9111310022801052379.hoa' '--buchi-type=spotba'
LTSmin run took 145 ms.
FORMULA CO4-PT-09-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-09-LTLFireability-09 finished in 3167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 304/304 transitions.
Graph (trivial) has 224 edges and 214 vertex of which 2 / 214 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 490 edges and 213 vertex of which 209 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 208 transition count 224
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 152 place count 135 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 134 transition count 220
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 153 place count 134 transition count 198
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 197 place count 112 transition count 198
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 202 place count 107 transition count 190
Iterating global reduction 3 with 5 rules applied. Total rules applied 207 place count 107 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 107 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 208 place count 107 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 106 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 211 place count 105 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 105 transition count 186
Performed 29 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 270 place count 76 transition count 149
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 279 place count 76 transition count 140
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 283 place count 74 transition count 138
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 285 place count 72 transition count 134
Iterating global reduction 6 with 2 rules applied. Total rules applied 287 place count 72 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 291 place count 70 transition count 132
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 327 place count 52 transition count 152
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 336 place count 52 transition count 143
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 347 place count 41 transition count 99
Iterating global reduction 7 with 11 rules applied. Total rules applied 358 place count 41 transition count 99
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 366 place count 41 transition count 91
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 369 place count 38 transition count 73
Iterating global reduction 8 with 3 rules applied. Total rules applied 372 place count 38 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 374 place count 38 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 382 place count 38 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 384 place count 36 transition count 61
Applied a total of 384 rules in 26 ms. Remains 36 /214 variables (removed 178) and now considering 61/304 (removed 243) transitions.
[2025-05-30 12:01:56] [INFO ] Flow matrix only has 49 transitions (discarded 12 similar events)
// Phase 1: matrix 49 rows 36 cols
[2025-05-30 12:01:56] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:01:56] [INFO ] Implicit Places using invariants in 34 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/214 places, 61/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 35/214 places, 61/304 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-09-LTLFireability-12
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CO4-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-09-LTLFireability-12 finished in 101 ms.
All properties solved by simple procedures.
Total runtime 189218 ms.

BK_STOP 1748606521007

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-09, examination is LTLFireability"
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-174854028500444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-09.tgz
mv CO4-PT-09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;