Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 336K 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-20-LTLFireability-00
FORMULA_NAME CO4-PT-20-LTLFireability-01
FORMULA_NAME CO4-PT-20-LTLFireability-02
FORMULA_NAME CO4-PT-20-LTLFireability-03
FORMULA_NAME CO4-PT-20-LTLFireability-04
FORMULA_NAME CO4-PT-20-LTLFireability-05
FORMULA_NAME CO4-PT-20-LTLFireability-06
FORMULA_NAME CO4-PT-20-LTLFireability-07
FORMULA_NAME CO4-PT-20-LTLFireability-08
FORMULA_NAME CO4-PT-20-LTLFireability-09
FORMULA_NAME CO4-PT-20-LTLFireability-10
FORMULA_NAME CO4-PT-20-LTLFireability-11
FORMULA_NAME CO4-PT-20-LTLFireability-12
FORMULA_NAME CO4-PT-20-LTLFireability-13
FORMULA_NAME CO4-PT-20-LTLFireability-14
FORMULA_NAME CO4-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748611481145

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 13:24:42] [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 13:24:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:24:42] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2025-05-30 13:24:42] [INFO ] Transformed 1178 places.
[2025-05-30 13:24:42] [INFO ] Transformed 1463 transitions.
[2025-05-30 13:24:42] [INFO ] Found NUPN structural information;
[2025-05-30 13:24:42] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 208 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 3 formulas.
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 969 transition count 1207
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 195 place count 801 transition count 1037
Iterating global reduction 1 with 168 rules applied. Total rules applied 363 place count 801 transition count 1037
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 507 place count 657 transition count 880
Iterating global reduction 1 with 144 rules applied. Total rules applied 651 place count 657 transition count 880
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 660 place count 657 transition count 871
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 730 place count 587 transition count 795
Iterating global reduction 2 with 70 rules applied. Total rules applied 800 place count 587 transition count 795
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 802 place count 587 transition count 793
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 848 place count 541 transition count 747
Iterating global reduction 3 with 46 rules applied. Total rules applied 894 place count 541 transition count 747
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 902 place count 541 transition count 739
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 920 place count 523 transition count 721
Iterating global reduction 4 with 18 rules applied. Total rules applied 938 place count 523 transition count 721
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 940 place count 523 transition count 719
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 945 place count 518 transition count 714
Iterating global reduction 5 with 5 rules applied. Total rules applied 950 place count 518 transition count 714
Applied a total of 950 rules in 257 ms. Remains 518 /991 variables (removed 473) and now considering 714/1212 (removed 498) transitions.
// Phase 1: matrix 714 rows 518 cols
[2025-05-30 13:24:43] [INFO ] Computed 7 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:24:43] [INFO ] Implicit Places using invariants in 313 ms returned [6, 444]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 346 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/991 places, 714/1212 transitions.
Applied a total of 0 rules in 7 ms. Remains 516 /516 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 625 ms. Remains : 516/991 places, 714/1212 transitions.
Support contains 23 out of 516 places after structural reductions.
[2025-05-30 13:24:43] [INFO ] Flatten gal took : 75 ms
[2025-05-30 13:24:43] [INFO ] Flatten gal took : 37 ms
[2025-05-30 13:24:43] [INFO ] Input system was already deterministic with 714 transitions.
RANDOM walk for 40000 steps (837 resets) in 2207 ms. (18 steps per ms) remains 16/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
// Phase 1: matrix 714 rows 516 cols
[2025-05-30 13:24:44] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 22/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 19/58 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 191/249 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 439/688 variables, 164/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 371/1059 variables, 189/416 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 127/1186 variables, 78/494 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1186 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 30/1216 variables, 18/512 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1216 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 13/1229 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1229 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 1/1230 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1230 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 0/1230 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Real declared 1230/1230 variables, and 521 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 22/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 19/58 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 191/249 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 439/688 variables, 164/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 15/242 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 371/1059 variables, 189/431 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1059 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 127/1186 variables, 78/509 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1186 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 30/1216 variables, 18/527 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1216 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 13/1229 variables, 8/535 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1229 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 1/1230 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1230 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 536 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10063ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 714/714 transitions.
Graph (trivial) has 516 edges and 516 vertex of which 3 / 516 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1033 edges and 514 vertex of which 508 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 508 transition count 481
Reduce places removed 209 places and 0 transitions.
Ensure Unique test 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 1 with 211 rules applied. Total rules applied 432 place count 299 transition count 479
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 443 place count 298 transition count 469
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 453 place count 288 transition count 469
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 453 place count 288 transition count 423
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 545 place count 242 transition count 423
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 547 place count 240 transition count 421
Iterating global reduction 4 with 2 rules applied. Total rules applied 549 place count 240 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 551 place count 240 transition count 419
Performed 75 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 701 place count 165 transition count 322
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 711 place count 165 transition count 312
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 719 place count 157 transition count 299
Iterating global reduction 6 with 8 rules applied. Total rules applied 727 place count 157 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 733 place count 154 transition count 296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 734 place count 153 transition count 294
Iterating global reduction 6 with 1 rules applied. Total rules applied 735 place count 153 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 736 place count 153 transition count 293
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 806 place count 118 transition count 330
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 821 place count 118 transition count 315
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 841 place count 98 transition count 235
Iterating global reduction 8 with 20 rules applied. Total rules applied 861 place count 98 transition count 235
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 874 place count 98 transition count 222
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 878 place count 94 transition count 198
Iterating global reduction 9 with 4 rules applied. Total rules applied 882 place count 94 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 883 place count 94 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 894 place count 94 transition count 186
Free-agglomeration rule applied 18 times.
Iterating global reduction 10 with 18 rules applied. Total rules applied 912 place count 94 transition count 168
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 931 place count 76 transition count 167
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 936 place count 76 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 937 place count 75 transition count 166
Applied a total of 937 rules in 122 ms. Remains 75 /516 variables (removed 441) and now considering 166/714 (removed 548) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 75/516 places, 166/714 transitions.
RANDOM walk for 40000 steps (8 resets) in 957 ms. (41 steps per ms) remains 0/15 properties
FORMULA CO4-PT-20-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1036 edges and 516 vertex of which 511 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 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((X((p0&&F(p1)))&&F(p2)))||G(p3)))'
Support contains 5 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 508 transition count 706
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 508 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 508 transition count 705
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 501 transition count 698
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 501 transition count 698
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 497 transition count 694
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 497 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 497 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 495 transition count 691
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 495 transition count 691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 494 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 494 transition count 690
Applied a total of 46 rules in 45 ms. Remains 494 /516 variables (removed 22) and now considering 690/714 (removed 24) transitions.
// Phase 1: matrix 690 rows 494 cols
[2025-05-30 13:24:55] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:24:55] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-30 13:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:24:55] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 689 sub problems to find dead transitions.
[2025-05-30 13:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (OVERLAPS) 1/494 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:25:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:25:14] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 689 unsolved
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 689 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Starting structural reductions in LTL mode, iteration 1 : 494/516 places, 690/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30627 ms. Remains : 494/516 places, 690/714 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CO4-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 2 ms.
FORMULA CO4-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-00 finished in 31124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Graph (trivial) has 549 edges and 516 vertex of which 3 / 516 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1034 edges and 514 vertex of which 509 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 508 transition count 486
Reduce places removed 219 places and 0 transitions.
Ensure Unique test 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 1 with 221 rules applied. Total rules applied 442 place count 289 transition count 484
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 445 place count 288 transition count 482
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 447 place count 286 transition count 482
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 447 place count 286 transition count 436
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 539 place count 240 transition count 436
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 541 place count 238 transition count 434
Iterating global reduction 4 with 2 rules applied. Total rules applied 543 place count 238 transition count 434
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 543 place count 238 transition count 433
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 545 place count 237 transition count 433
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 546 place count 236 transition count 432
Iterating global reduction 4 with 1 rules applied. Total rules applied 547 place count 236 transition count 432
Performed 86 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 719 place count 150 transition count 319
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 731 place count 150 transition count 307
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 740 place count 141 transition count 293
Iterating global reduction 5 with 9 rules applied. Total rules applied 749 place count 141 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 750 place count 141 transition count 292
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 6 with 2 rules applied. Total rules applied 752 place count 140 transition count 291
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 753 place count 139 transition count 289
Iterating global reduction 6 with 1 rules applied. Total rules applied 754 place count 139 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 755 place count 139 transition count 288
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 837 place count 98 transition count 334
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 858 place count 98 transition count 313
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 885 place count 71 transition count 205
Iterating global reduction 8 with 27 rules applied. Total rules applied 912 place count 71 transition count 205
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 930 place count 71 transition count 187
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 937 place count 64 transition count 149
Iterating global reduction 9 with 7 rules applied. Total rules applied 944 place count 64 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 949 place count 64 transition count 144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 955 place count 61 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 10 with 32 rules applied. Total rules applied 987 place count 61 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 989 place count 59 transition count 136
Applied a total of 989 rules in 79 ms. Remains 59 /516 variables (removed 457) and now considering 136/714 (removed 578) transitions.
[2025-05-30 13:25:26] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
// Phase 1: matrix 120 rows 59 cols
[2025-05-30 13:25:26] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:26] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-30 13:25:26] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
[2025-05-30 13:25:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:25:26] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:25:26] [INFO ] Redundant transitions in 16 ms returned []
Running 117 sub problems to find dead transitions.
[2025-05-30 13:25:26] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
[2025-05-30 13:25:26] [INFO ] Invariant cache hit.
[2025-05-30 13:25:26] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 119/177 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 1/179 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 67 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4338 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 119/177 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 68/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 1/178 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 49/183 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 1/179 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 184 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6490 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10893ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 10894ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/516 places, 136/714 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11144 ms. Remains : 59/516 places, 136/714 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-01
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-01 finished in 11204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Graph (trivial) has 551 edges and 516 vertex of which 3 / 516 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1034 edges and 514 vertex of which 509 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 508 transition count 484
Reduce places removed 221 places and 0 transitions.
Ensure Unique test 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 1 with 223 rules applied. Total rules applied 446 place count 287 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 447 place count 286 transition count 482
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 447 place count 286 transition count 435
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 541 place count 239 transition count 435
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 543 place count 237 transition count 433
Iterating global reduction 3 with 2 rules applied. Total rules applied 545 place count 237 transition count 433
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 545 place count 237 transition count 432
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 236 transition count 432
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 548 place count 235 transition count 431
Iterating global reduction 3 with 1 rules applied. Total rules applied 549 place count 235 transition count 431
Performed 84 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 717 place count 151 transition count 322
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 728 place count 151 transition count 311
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 737 place count 142 transition count 297
Iterating global reduction 4 with 9 rules applied. Total rules applied 746 place count 142 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 747 place count 142 transition count 296
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 749 place count 141 transition count 295
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 750 place count 140 transition count 293
Iterating global reduction 5 with 1 rules applied. Total rules applied 751 place count 140 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 752 place count 140 transition count 292
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 834 place count 99 transition count 338
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 854 place count 99 transition count 318
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 882 place count 71 transition count 206
Iterating global reduction 7 with 28 rules applied. Total rules applied 910 place count 71 transition count 206
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 927 place count 71 transition count 189
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 934 place count 64 transition count 151
Iterating global reduction 8 with 7 rules applied. Total rules applied 941 place count 64 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 944 place count 64 transition count 148
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 950 place count 61 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 9 with 38 rules applied. Total rules applied 988 place count 61 transition count 143
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 992 place count 61 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 994 place count 59 transition count 141
Applied a total of 994 rules in 66 ms. Remains 59 /516 variables (removed 457) and now considering 141/714 (removed 573) transitions.
[2025-05-30 13:25:37] [INFO ] Flow matrix only has 120 transitions (discarded 21 similar events)
// Phase 1: matrix 120 rows 59 cols
[2025-05-30 13:25:37] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:37] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-30 13:25:37] [INFO ] Flow matrix only has 120 transitions (discarded 21 similar events)
[2025-05-30 13:25:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 13:25:37] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:25:37] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2025-05-30 13:25:37] [INFO ] Flow matrix only has 120 transitions (discarded 21 similar events)
[2025-05-30 13:25:37] [INFO ] Invariant cache hit.
[2025-05-30 13:25:37] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 119/178 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2847 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 119/178 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/179 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7916ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/516 places, 141/714 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8108 ms. Remains : 59/516 places, 141/714 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-20-LTLFireability-02
Product exploration explored 100000 steps with 369 reset in 144 ms.
Product exploration explored 100000 steps with 263 reset in 78 ms.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5737 steps (473 resets) in 64 ms. (88 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2025-05-30 13:25:46] [INFO ] Flow matrix only has 120 transitions (discarded 21 similar events)
[2025-05-30 13:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 13:25:46] [INFO ] Flow matrix only has 120 transitions (discarded 21 similar events)
[2025-05-30 13:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 13:25:46] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:25:46] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2025-05-30 13:25:46] [INFO ] Flow matrix only has 120 transitions (discarded 21 similar events)
[2025-05-30 13:25:46] [INFO ] Invariant cache hit.
[2025-05-30 13:25:46] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 119/178 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 68 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2861 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 119/178 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/179 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 186 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4917 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7794ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7795ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7904 ms. Remains : 59/59 places, 141/141 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6509 steps (526 resets) in 34 ms. (185 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 43 reset in 37 ms.
Product exploration explored 100000 steps with 49 reset in 122 ms.
Built C files in :
/tmp/ltsmin2758527082826440027
[2025-05-30 13:25:55] [INFO ] Computing symmetric may disable matrix : 141 transitions.
[2025-05-30 13:25:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:25:55] [INFO ] Computing symmetric may enable matrix : 141 transitions.
[2025-05-30 13:25:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:25:55] [INFO ] Computing Do-Not-Accords matrix : 141 transitions.
[2025-05-30 13:25:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:25:55] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2758527082826440027
Running compilation step : cd /tmp/ltsmin2758527082826440027;'/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 395 ms.
Running link step : cd /tmp/ltsmin2758527082826440027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2758527082826440027;'/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/stateBased18369188522739178657.hoa' '--buchi-type=spotba'
LTSmin run took 219 ms.
FORMULA CO4-PT-20-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-20-LTLFireability-02 finished in 18379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Graph (trivial) has 554 edges and 516 vertex of which 3 / 516 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1034 edges and 514 vertex of which 509 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 222 place count 508 transition count 485
Reduce places removed 220 places and 0 transitions.
Ensure Unique test 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 1 with 222 rules applied. Total rules applied 444 place count 288 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 445 place count 287 transition count 483
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 445 place count 287 transition count 436
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 539 place count 240 transition count 436
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 541 place count 238 transition count 434
Iterating global reduction 3 with 2 rules applied. Total rules applied 543 place count 238 transition count 434
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 543 place count 238 transition count 433
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 545 place count 237 transition count 433
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 546 place count 236 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 547 place count 236 transition count 432
Performed 86 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 719 place count 150 transition count 319
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 731 place count 150 transition count 307
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 740 place count 141 transition count 293
Iterating global reduction 4 with 9 rules applied. Total rules applied 749 place count 141 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 750 place count 141 transition count 292
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 752 place count 140 transition count 291
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 753 place count 139 transition count 289
Iterating global reduction 5 with 1 rules applied. Total rules applied 754 place count 139 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 755 place count 139 transition count 288
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 837 place count 98 transition count 334
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 858 place count 98 transition count 313
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 885 place count 71 transition count 205
Iterating global reduction 7 with 27 rules applied. Total rules applied 912 place count 71 transition count 205
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 931 place count 71 transition count 186
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 937 place count 65 transition count 154
Iterating global reduction 8 with 6 rules applied. Total rules applied 943 place count 65 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 947 place count 65 transition count 150
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 955 place count 61 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 9 with 56 rules applied. Total rules applied 1011 place count 61 transition count 145
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1013 place count 59 transition count 143
Applied a total of 1013 rules in 50 ms. Remains 59 /516 variables (removed 457) and now considering 143/714 (removed 571) transitions.
[2025-05-30 13:25:55] [INFO ] Flow matrix only has 109 transitions (discarded 34 similar events)
// Phase 1: matrix 109 rows 59 cols
[2025-05-30 13:25:55] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-30 13:25:56] [INFO ] Flow matrix only has 109 transitions (discarded 34 similar events)
[2025-05-30 13:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:25:56] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:25:56] [INFO ] Redundant transitions in 3 ms returned []
Running 120 sub problems to find dead transitions.
[2025-05-30 13:25:56] [INFO ] Flow matrix only has 109 transitions (discarded 34 similar events)
[2025-05-30 13:25:56] [INFO ] Invariant cache hit.
[2025-05-30 13:25:56] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 108/167 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 1/168 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 67 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 108/167 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 120/186 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 187 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5253 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8286ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/516 places, 143/714 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8463 ms. Remains : 59/516 places, 143/714 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-04
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-04 finished in 8562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U X(X(X(G(p1)))))&&F(p2)))))'
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 508 transition count 706
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 508 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 508 transition count 705
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 502 transition count 699
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 502 transition count 699
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 499 transition count 696
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 499 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 499 transition count 695
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 497 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 497 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 496 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 496 transition count 692
Applied a total of 42 rules in 46 ms. Remains 496 /516 variables (removed 20) and now considering 692/714 (removed 22) transitions.
// Phase 1: matrix 692 rows 496 cols
[2025-05-30 13:26:04] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:26:04] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-05-30 13:26:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:26:04] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2025-05-30 13:26:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 692/1188 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 501 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 692/1188 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1188 variables, 691/1192 constraints. Problems are: Problem set: 0 solved, 691 unsolved
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 Int declared 1188/1188 variables, and 1192 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 496/516 places, 692/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60632 ms. Remains : 496/516 places, 692/714 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-05
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-05 finished in 61057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(p0))))))'
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 508 transition count 706
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 508 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 508 transition count 705
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 502 transition count 699
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 502 transition count 699
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 499 transition count 696
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 499 transition count 696
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 497 transition count 694
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 497 transition count 694
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 496 transition count 693
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 496 transition count 693
Applied a total of 41 rules in 46 ms. Remains 496 /516 variables (removed 20) and now considering 693/714 (removed 21) transitions.
// Phase 1: matrix 693 rows 496 cols
[2025-05-30 13:27:05] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:27:05] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-05-30 13:27:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:27:05] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 692 sub problems to find dead transitions.
[2025-05-30 13:27:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:27:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:27:24] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)timeout

(s238 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 692 unsolved
SMT process timed out in 30120ms, After SMT, problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 30121ms
Starting structural reductions in LTL mode, iteration 1 : 496/516 places, 693/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30561 ms. Remains : 496/516 places, 693/714 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-20-LTLFireability-08
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-08 finished in 30810 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)||((p1&&F(p0)) U X(X(!p0))))))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 508 transition count 706
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 508 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 508 transition count 705
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 502 transition count 699
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 502 transition count 699
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 498 transition count 695
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 498 transition count 695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 498 transition count 694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 496 transition count 692
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 495 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 495 transition count 691
Applied a total of 44 rules in 49 ms. Remains 495 /516 variables (removed 21) and now considering 691/714 (removed 23) transitions.
// Phase 1: matrix 691 rows 495 cols
[2025-05-30 13:27:36] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:27:36] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 13:27:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:27:36] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-05-30 13:27:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:28:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:28:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1186 variables, 495/502 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1186 variables, 690/1192 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1192 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 495/516 places, 691/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60599 ms. Remains : 495/516 places, 691/714 transitions.
Stuttering acceptance computed with spot in 207 ms :[false, false, false, p0, true, p0, p0]
Running random walk in product with property : CO4-PT-20-LTLFireability-09
Product exploration explored 100000 steps with 25042 reset in 186 ms.
Product exploration explored 100000 steps with 24973 reset in 223 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[false, false, false, p0, true, p0, p0]
RANDOM walk for 40000 steps (835 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (124 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (130 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (140 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (143 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (138 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (145 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 679669 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 6
Probabilistic random walk after 679669 steps, saw 129235 distinct states, run finished after 3007 ms. (steps per millisecond=226 ) properties seen :0
[2025-05-30 13:28:41] [INFO ] Invariant cache hit.
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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 24/31 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 170/201 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 17/218 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 20/238 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 337/575 variables, 152/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 322/897 variables, 147/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/897 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 202/1099 variables, 105/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1099 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 18 (OVERLAPS) 70/1169 variables, 44/489 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1169 variables, 0/489 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 11/1180 variables, 7/496 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1180 variables, 0/496 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 5/1185 variables, 3/499 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1185 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 1/1186 variables, 1/500 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/31 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 170/201 variables, 25/37 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 17/218 variables, 2/39 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 4/43 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 20/238 variables, 3/46 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 337/575 variables, 152/198 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 322/897 variables, 147/345 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/897 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 202/1099 variables, 105/450 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1099 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 70/1169 variables, 44/494 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1169 variables, 0/494 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 11/1180 variables, 7/501 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1180 variables, 0/501 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 5/1185 variables, 3/504 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1185 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 1/1186 variables, 1/505 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1186 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/1186 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 505 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3665ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 68 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 5 properties in 46 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 260 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND p1 p0), false, (AND p1 p0), p0, true, p0, p0]
Stuttering acceptance computed with spot in 208 ms :[(AND p1 p0), false, (AND p1 p0), p0, true, p0, p0]
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Applied a total of 0 rules in 10 ms. Remains 495 /495 variables (removed 0) and now considering 691/691 (removed 0) transitions.
[2025-05-30 13:28:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:28:45] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-30 13:28:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:28:46] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-05-30 13:28:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:29] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1186 variables, 495/502 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1186 variables, 690/1192 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:46] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 12 ms to minimize.
SMT process timed out in 60269ms, After SMT, problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 495/495 places, 691/691 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND p1 p0), false, (AND p1 p0), p0, true, p0, p0]
RANDOM walk for 40000 steps (826 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (112 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (142 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (114 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 938524 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 3
Probabilistic random walk after 938524 steps, saw 177849 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
[2025-05-30 13:29:49] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/31 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 170/201 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 17/218 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/238 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 337/575 variables, 152/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/575 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 322/897 variables, 147/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/897 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 202/1099 variables, 105/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1099 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 70/1169 variables, 44/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:50] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1169 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1169 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 11/1180 variables, 7/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1180 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 5/1185 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1185 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1/1186 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1186 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1186 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 501 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1365 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/31 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 170/201 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 17/218 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/238 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 337/575 variables, 152/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 322/897 variables, 147/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/897 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/897 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 202/1099 variables, 105/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1099 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 70/1169 variables, 44/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1169 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 11/1180 variables, 7/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1180 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 5/1185 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1185 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 1/1186 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1186 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1186 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 504 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2422ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1549 steps, including 91 resets, run visited all 1 properties in 4 ms. (steps per millisecond=387 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 30 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND p1 p0), false, (AND p1 p0), p0, true, p0, p0]
Stuttering acceptance computed with spot in 223 ms :[(AND p1 p0), false, (AND p1 p0), p0, true, p0, p0]
Stuttering acceptance computed with spot in 224 ms :[(AND p1 p0), false, (AND p1 p0), p0, true, p0, p0]
Product exploration explored 100000 steps with 25041 reset in 135 ms.
Product exploration explored 100000 steps with 25005 reset in 135 ms.
Applying partial POR strategy [false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND p1 p0), false, (AND p1 p0), p0, true, p0, p0]
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Graph (trivial) has 531 edges and 495 vertex of which 3 / 495 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1001 edges and 493 vertex of which 488 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 488 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 488 transition count 682
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 205 place count 488 transition count 685
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 211 place count 488 transition count 685
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 271 place count 428 transition count 625
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 331 place count 428 transition count 625
Performed 106 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 1 ms
Iterating global reduction 2 with 106 rules applied. Total rules applied 437 place count 428 transition count 681
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 454 place count 428 transition count 664
Discarding 95 places :
Symmetric choice reduction at 3 with 95 rule applications. Total rules 549 place count 333 transition count 564
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 3 with 95 rules applied. Total rules applied 644 place count 333 transition count 564
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 645 place count 332 transition count 563
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 646 place count 332 transition count 563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 332 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 648 place count 332 transition count 562
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 650 place count 330 transition count 560
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 652 place count 330 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 653 place count 330 transition count 560
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 655 place count 328 transition count 557
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 657 place count 328 transition count 557
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 659 place count 326 transition count 554
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 661 place count 326 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 662 place count 326 transition count 553
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 663 place count 325 transition count 552
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 664 place count 325 transition count 552
Performed 61 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 61 rules applied. Total rules applied 725 place count 325 transition count 855
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 5 with 58 rules applied. Total rules applied 783 place count 325 transition count 797
Discarding 101 places :
Symmetric choice reduction at 6 with 101 rule applications. Total rules 884 place count 224 transition count 521
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 6 with 101 rules applied. Total rules applied 985 place count 224 transition count 521
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 1019 place count 224 transition count 487
Discarding 62 places :
Symmetric choice reduction at 7 with 62 rule applications. Total rules 1081 place count 162 transition count 361
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 7 with 62 rules applied. Total rules applied 1143 place count 162 transition count 361
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1150 place count 162 transition count 354
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1162 place count 150 transition count 330
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 1174 place count 150 transition count 330
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1176 place count 150 transition count 368
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1186 place count 150 transition count 358
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1190 place count 146 transition count 338
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 1194 place count 146 transition count 338
Deduced a syphon composed of 79 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 9 with 32 rules applied. Total rules applied 1226 place count 146 transition count 306
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1227 place count 145 transition count 305
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1228 place count 145 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1229 place count 145 transition count 329
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1230 place count 144 transition count 320
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1231 place count 144 transition count 320
Deduced a syphon composed of 78 places in 0 ms
Applied a total of 1231 rules in 209 ms. Remains 144 /495 variables (removed 351) and now considering 320/691 (removed 371) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:29:54] [INFO ] Redundant transitions in 4 ms returned []
Running 319 sub problems to find dead transitions.
[2025-05-30 13:29:54] [INFO ] Flow matrix only has 309 transitions (discarded 11 similar events)
// Phase 1: matrix 309 rows 144 cols
[2025-05-30 13:29:54] [INFO ] Computed 5 invariants in 1 ms
[2025-05-30 13:29:54] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:56] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:56] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:56] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:56] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:29:56] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 304 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 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 TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 4 (OVERLAPS) 308/452 variables, 144/154 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 51/205 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/205 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 1/453 variables, 1/206 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/206 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/453 variables, 0/206 constraints. Problems are: Problem set: 180 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 206 constraints, problems are : Problem set: 180 solved, 139 unsolved in 14429 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 144/144 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 180 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 16/81 variables, 5/5 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 5/10 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 291/372 variables, 81/91 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 51/142 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 139/281 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/281 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 80/452 variables, 63/344 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/344 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 10 (OVERLAPS) 1/453 variables, 1/345 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/345 constraints. Problems are: Problem set: 180 solved, 139 unsolved
At refinement iteration 12 (OVERLAPS) 0/453 variables, 0/345 constraints. Problems are: Problem set: 180 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 345 constraints, problems are : Problem set: 180 solved, 139 unsolved in 19330 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 144/144 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 139/319 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33825ms problems are : Problem set: 180 solved, 139 unsolved
Search for dead transitions found 180 dead transitions in 33827ms
Found 180 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 180 transitions
Dead transitions reduction (with SMT) removed 180 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 144/495 places, 140/691 transitions.
Graph (complete) has 291 edges and 144 vertex of which 66 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.1 ms
Discarding 78 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 166
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 66 transition count 150
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 19 rules in 13 ms. Remains 66 /144 variables (removed 78) and now considering 150/140 (removed -10) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/495 places, 150/691 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34073 ms. Remains : 66/495 places, 150/691 transitions.
Built C files in :
/tmp/ltsmin5299238305764956497
[2025-05-30 13:30:27] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5299238305764956497
Running compilation step : cd /tmp/ltsmin5299238305764956497;'/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 983 ms.
Running link step : cd /tmp/ltsmin5299238305764956497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5299238305764956497;'/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/stateBased272772661695759720.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Applied a total of 0 rules in 15 ms. Remains 495 /495 variables (removed 0) and now considering 691/691 (removed 0) transitions.
// Phase 1: matrix 691 rows 495 cols
[2025-05-30 13:30:43] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 13:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:43] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-05-30 13:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)timeout

(s454 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:31:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:31:27] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1186 variables, 495/502 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1186 variables, 690/1192 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:31:43] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1193 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in LTL mode , in 1 iterations and 60545 ms. Remains : 495/495 places, 691/691 transitions.
Built C files in :
/tmp/ltsmin2416705882755513892
[2025-05-30 13:31:43] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2416705882755513892
Running compilation step : cd /tmp/ltsmin2416705882755513892;'/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 945 ms.
Running link step : cd /tmp/ltsmin2416705882755513892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2416705882755513892;'/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/stateBased15822634221716433942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 13:31:58] [INFO ] Flatten gal took : 31 ms
[2025-05-30 13:31:58] [INFO ] Flatten gal took : 25 ms
[2025-05-30 13:31:58] [INFO ] Time to serialize gal into /tmp/LTL11025184567978862344.gal : 5 ms
[2025-05-30 13:31:58] [INFO ] Time to serialize properties into /tmp/LTL2944840380684704269.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11025184567978862344.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13351326262705219683.hoa' '-atoms' '/tmp/LTL2944840380684704269.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2944840380684704269.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13351326262705219683.hoa
Detected timeout of ITS tools.
[2025-05-30 13:32:13] [INFO ] Flatten gal took : 23 ms
[2025-05-30 13:32:13] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:32:13] [INFO ] Time to serialize gal into /tmp/LTL15309939782421988013.gal : 4 ms
[2025-05-30 13:32:13] [INFO ] Time to serialize properties into /tmp/LTL7030694596734099043.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15309939782421988013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7030694596734099043.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("(p696==1)"))||((("(p567==1)")&&(F("(p696==1)")))U(X(X("(p696!=1)")))))))
Formula 0 simplified : F(X!"(p696==1)" & ((!"(p567==1)" | G!"(p696==1)") R XX!"(p696!=1)"))
Detected timeout of ITS tools.
[2025-05-30 13:32:29] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:32:29] [INFO ] Applying decomposition
[2025-05-30 13:32:29] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6114960987695662982.txt' '-o' '/tmp/graph6114960987695662982.bin' '-w' '/tmp/graph6114960987695662982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6114960987695662982.bin' '-l' '-1' '-v' '-w' '/tmp/graph6114960987695662982.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:32:29] [INFO ] Decomposing Gal with order
[2025-05-30 13:32:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:32:29] [INFO ] Removed a total of 421 redundant transitions.
[2025-05-30 13:32:29] [INFO ] Flatten gal took : 74 ms
[2025-05-30 13:32:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 18 ms.
[2025-05-30 13:32:29] [INFO ] Time to serialize gal into /tmp/LTL11457111047543425205.gal : 9 ms
[2025-05-30 13:32:29] [INFO ] Time to serialize properties into /tmp/LTL13653439160828017618.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11457111047543425205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13653439160828017618.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((X("(i12.u111.p696==1)"))||((("(i9.u83.p567==1)")&&(F("(i12.u111.p696==1)")))U(X(X("(i12.u111.p696!=1)")))))))
Formula 0 simplified : F(X!"(i12.u111.p696==1)" & ((!"(i9.u83.p567==1)" | G!"(i12.u111.p696==1)") R XX!"(i12.u111.p696!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t20, t31, t55, t92, t101, t102, t146, t192, t232, t240, t276, t317, t329, t365, t374, t568, t...1121
Computing Next relation with stutter on 1.0584e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property CO4-PT-20-LTLFireability-09 finished in 308041 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(p0))'
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Graph (trivial) has 553 edges and 516 vertex of which 3 / 516 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1034 edges and 514 vertex of which 509 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 222 place count 508 transition count 485
Reduce places removed 220 places and 0 transitions.
Ensure Unique test 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 1 with 222 rules applied. Total rules applied 444 place count 288 transition count 483
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 446 place count 287 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 447 place count 286 transition count 482
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 447 place count 286 transition count 435
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 541 place count 239 transition count 435
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 543 place count 237 transition count 433
Iterating global reduction 4 with 2 rules applied. Total rules applied 545 place count 237 transition count 433
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 545 place count 237 transition count 432
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 547 place count 236 transition count 432
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 548 place count 235 transition count 431
Iterating global reduction 4 with 1 rules applied. Total rules applied 549 place count 235 transition count 431
Performed 86 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 721 place count 149 transition count 318
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 733 place count 149 transition count 306
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 742 place count 140 transition count 292
Iterating global reduction 5 with 9 rules applied. Total rules applied 751 place count 140 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 752 place count 140 transition count 291
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 754 place count 139 transition count 290
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 755 place count 138 transition count 288
Iterating global reduction 6 with 1 rules applied. Total rules applied 756 place count 138 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 757 place count 138 transition count 287
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 837 place count 98 transition count 332
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 857 place count 98 transition count 312
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 884 place count 71 transition count 204
Iterating global reduction 8 with 27 rules applied. Total rules applied 911 place count 71 transition count 204
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 929 place count 71 transition count 186
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 936 place count 64 transition count 148
Iterating global reduction 9 with 7 rules applied. Total rules applied 943 place count 64 transition count 148
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 948 place count 64 transition count 143
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 956 place count 60 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 10 with 48 rules applied. Total rules applied 1004 place count 60 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1006 place count 58 transition count 136
Applied a total of 1006 rules in 53 ms. Remains 58 /516 variables (removed 458) and now considering 136/714 (removed 578) transitions.
[2025-05-30 13:32:44] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
// Phase 1: matrix 107 rows 58 cols
[2025-05-30 13:32:44] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 13:32:44] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2025-05-30 13:32:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:32:44] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:32:44] [INFO ] Redundant transitions in 1 ms returned []
Running 113 sub problems to find dead transitions.
[2025-05-30 13:32:44] [INFO ] Flow matrix only has 107 transitions (discarded 29 similar events)
[2025-05-30 13:32:44] [INFO ] Invariant cache hit.
[2025-05-30 13:32:44] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 106/164 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/165 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 66 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2625 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 106/164 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 113/178 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/165 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/165 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4594 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7267ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/516 places, 136/714 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7532 ms. Remains : 58/516 places, 136/714 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-12
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-12 finished in 7591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(p0))||(F(p0)&&G(p1)))))))))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 508 transition count 706
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 508 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 508 transition count 705
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 502 transition count 699
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 502 transition count 699
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 498 transition count 695
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 498 transition count 695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 498 transition count 694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 496 transition count 692
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 495 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 495 transition count 691
Applied a total of 44 rules in 46 ms. Remains 495 /516 variables (removed 21) and now considering 691/714 (removed 23) transitions.
// Phase 1: matrix 691 rows 495 cols
[2025-05-30 13:32:52] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:52] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-05-30 13:32:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:52] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-05-30 13:32:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1186 variables, 690/1190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1190 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 495/516 places, 691/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60626 ms. Remains : 495/516 places, 691/714 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 325 reset in 97 ms.
Product exploration explored 100000 steps with 553 reset in 97 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1008 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (749 resets) in 189 ms. (210 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (137 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (141 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
[2025-05-30 13:33:53] [INFO ] Invariant cache hit.
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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/122 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/142 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 333/475 variables, 117/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 398/873 variables, 186/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 235/1108 variables, 128/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 69/1177 variables, 44/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1177 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/1186 variables, 7/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/122 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 20/142 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/475 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 398/873 variables, 186/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 235/1108 variables, 128/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 69/1177 variables, 44/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1177 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 9/1186 variables, 7/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1248ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Applied a total of 0 rules in 6 ms. Remains 495 /495 variables (removed 0) and now considering 691/691 (removed 0) transitions.
[2025-05-30 13:33:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:33:55] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 13:33:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:33:55] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-05-30 13:33:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1186 variables, 690/1190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1190 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 60570 ms. Remains : 495/495 places, 691/691 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1008 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (522 resets) in 95 ms. (416 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (136 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
[2025-05-30 13:34:56] [INFO ] Invariant cache hit.
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) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/122 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 20/142 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 333/475 variables, 117/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 398/873 variables, 186/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 235/1108 variables, 128/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 69/1177 variables, 44/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1177 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 9/1186 variables, 7/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1186 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 2 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/104 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/122 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 20/142 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 333/475 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 398/873 variables, 186/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/873 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 235/1108 variables, 128/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 69/1177 variables, 44/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1177 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 9/1186 variables, 7/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1186 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1229ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 56 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 429 reset in 90 ms.
Product exploration explored 100000 steps with 1147 reset in 109 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Graph (trivial) has 529 edges and 495 vertex of which 3 / 495 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1006 edges and 493 vertex of which 488 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 203 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 488 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 206 place count 488 transition count 682
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 206 place count 488 transition count 685
Deduced a syphon composed of 208 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 488 transition count 685
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 271 place count 428 transition count 625
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 331 place count 428 transition count 625
Performed 105 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 436 place count 428 transition count 670
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 451 place count 428 transition count 655
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 548 place count 331 transition count 553
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 3 with 97 rules applied. Total rules applied 645 place count 331 transition count 553
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 646 place count 330 transition count 552
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 647 place count 330 transition count 552
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 648 place count 330 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 649 place count 330 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 651 place count 328 transition count 549
Deduced a syphon composed of 162 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 653 place count 328 transition count 549
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 328 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 656 place count 326 transition count 546
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 658 place count 326 transition count 546
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 660 place count 324 transition count 543
Deduced a syphon composed of 161 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 662 place count 324 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 324 transition count 542
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 664 place count 323 transition count 541
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 665 place count 323 transition count 541
Performed 62 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 62 rules applied. Total rules applied 727 place count 323 transition count 847
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 782 place count 323 transition count 792
Discarding 106 places :
Symmetric choice reduction at 6 with 106 rule applications. Total rules 888 place count 217 transition count 493
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 6 with 106 rules applied. Total rules applied 994 place count 217 transition count 493
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 1024 place count 217 transition count 463
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 1091 place count 150 transition count 329
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 1158 place count 150 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1164 place count 150 transition count 323
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1177 place count 137 transition count 298
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 1190 place count 137 transition count 298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1194 place count 137 transition count 349
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1197 place count 134 transition count 343
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1200 place count 134 transition count 343
Deduced a syphon composed of 72 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 8 with 70 rules applied. Total rules applied 1270 place count 134 transition count 273
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1271 place count 133 transition count 272
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1272 place count 133 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1273 place count 133 transition count 293
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1275 place count 131 transition count 277
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1277 place count 131 transition count 277
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 1277 rules in 89 ms. Remains 131 /495 variables (removed 364) and now considering 277/691 (removed 414) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:34:59] [INFO ] Redundant transitions in 5 ms returned []
Running 276 sub problems to find dead transitions.
[2025-05-30 13:34:59] [INFO ] Flow matrix only has 259 transitions (discarded 18 similar events)
// Phase 1: matrix 259 rows 131 cols
[2025-05-30 13:34:59] [INFO ] Computed 5 invariants in 1 ms
[2025-05-30 13:34:59] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:35:01] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:35:01] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:35:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:35:01] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:35:01] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 261 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 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 TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 4 (OVERLAPS) 258/389 variables, 131/141 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 32/173 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/173 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/174 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/174 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/174 constraints. Problems are: Problem set: 148 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 174 constraints, problems are : Problem set: 148 solved, 128 unsolved in 11143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 131/131 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 148 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 16/76 variables, 5/5 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 5/10 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 244/320 variables, 76/86 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 32/118 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 128/246 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/246 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 69/389 variables, 55/301 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/301 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/302 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/302 constraints. Problems are: Problem set: 148 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/302 constraints. Problems are: Problem set: 148 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 302 constraints, problems are : Problem set: 148 solved, 128 unsolved in 14822 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 131/131 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 128/276 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26024ms problems are : Problem set: 148 solved, 128 unsolved
Search for dead transitions found 148 dead transitions in 26026ms
Found 148 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 148 transitions
Dead transitions reduction (with SMT) removed 148 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 131/495 places, 129/691 transitions.
Graph (complete) has 268 edges and 131 vertex of which 61 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 149
Deduced a syphon composed of 1 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 61 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 9 ms. Remains 61 /131 variables (removed 70) and now considering 142/129 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/495 places, 142/691 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26149 ms. Remains : 61/495 places, 142/691 transitions.
Built C files in :
/tmp/ltsmin7051916429791029888
[2025-05-30 13:35:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7051916429791029888
Running compilation step : cd /tmp/ltsmin7051916429791029888;'/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 1050 ms.
Running link step : cd /tmp/ltsmin7051916429791029888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7051916429791029888;'/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/stateBased16622369153808381924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 495/495 places, 691/691 transitions.
Applied a total of 0 rules in 13 ms. Remains 495 /495 variables (removed 0) and now considering 691/691 (removed 0) transitions.
// Phase 1: matrix 691 rows 495 cols
[2025-05-30 13:35:40] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:35:40] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-05-30 13:35:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:35:40] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-05-30 13:35:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1186 variables, 690/1190 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1190 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in LTL mode , in 1 iterations and 60579 ms. Remains : 495/495 places, 691/691 transitions.
Built C files in :
/tmp/ltsmin15786520007046075866
[2025-05-30 13:36:41] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15786520007046075866
Running compilation step : cd /tmp/ltsmin15786520007046075866;'/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 1015 ms.
Running link step : cd /tmp/ltsmin15786520007046075866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15786520007046075866;'/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/stateBased5309980787957207662.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 13:36:56] [INFO ] Flatten gal took : 17 ms
[2025-05-30 13:36:56] [INFO ] Flatten gal took : 17 ms
[2025-05-30 13:36:56] [INFO ] Time to serialize gal into /tmp/LTL6905445889805981325.gal : 4 ms
[2025-05-30 13:36:56] [INFO ] Time to serialize properties into /tmp/LTL1260366808419465342.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6905445889805981325.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18187702310386065257.hoa' '-atoms' '/tmp/LTL1260366808419465342.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1260366808419465342.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18187702310386065257.hoa
Detected timeout of ITS tools.
[2025-05-30 13:37:11] [INFO ] Flatten gal took : 16 ms
[2025-05-30 13:37:11] [INFO ] Flatten gal took : 17 ms
[2025-05-30 13:37:11] [INFO ] Time to serialize gal into /tmp/LTL4716501117705235730.gal : 4 ms
[2025-05-30 13:37:11] [INFO ] Time to serialize properties into /tmp/LTL11078172616221283649.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4716501117705235730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11078172616221283649.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F((G(F("(p1043!=1)")))||((F("(p1043!=1)"))&&(G("(p332!=1)"))))))))))
Formula 0 simplified : XXXXG(FG!"(p1043!=1)" & (G!"(p1043!=1)" | F!"(p332!=1)"))
Detected timeout of ITS tools.
[2025-05-30 13:37:26] [INFO ] Flatten gal took : 14 ms
[2025-05-30 13:37:26] [INFO ] Applying decomposition
[2025-05-30 13:37:26] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2801989011132969645.txt' '-o' '/tmp/graph2801989011132969645.bin' '-w' '/tmp/graph2801989011132969645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2801989011132969645.bin' '-l' '-1' '-v' '-w' '/tmp/graph2801989011132969645.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:37:26] [INFO ] Decomposing Gal with order
[2025-05-30 13:37:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:37:26] [INFO ] Removed a total of 414 redundant transitions.
[2025-05-30 13:37:26] [INFO ] Flatten gal took : 30 ms
[2025-05-30 13:37:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 7 ms.
[2025-05-30 13:37:26] [INFO ] Time to serialize gal into /tmp/LTL7907464999118087557.gal : 5 ms
[2025-05-30 13:37:26] [INFO ] Time to serialize properties into /tmp/LTL12184259642904981778.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7907464999118087557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12184259642904981778.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F((G(F("(i20.u167.p1043!=1)")))||((F("(i20.u167.p1043!=1)"))&&(G("(i1.i0.i2.u43.p332!=1)"))))))))))
Formula 0 simplified : XXXXG(FG!"(i20.u167.p1043!=1)" & (G!"(i20.u167.p1043!=1)" | F!"(i1.i0.i2.u43.p332!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t20, t31, t55, t92, t101, t102, t146, t192, t240, t276, t316, t329, t365, t374, t454, t466, t...1127
Computing Next relation with stutter on 1.176e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property CO4-PT-20-LTLFireability-14 finished in 289627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(p1) U G((p0 U p2))))))'
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 508 transition count 706
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 508 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 508 transition count 705
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 502 transition count 699
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 502 transition count 699
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 499 transition count 696
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 499 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 499 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 498 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 498 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 497 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 497 transition count 693
Applied a total of 40 rules in 40 ms. Remains 497 /516 variables (removed 19) and now considering 693/714 (removed 21) transitions.
// Phase 1: matrix 693 rows 497 cols
[2025-05-30 13:37:41] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:37:41] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-30 13:37:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:37:42] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 692 sub problems to find dead transitions.
[2025-05-30 13:37:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (OVERLAPS) 693/1190 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 502 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (OVERLAPS) 693/1190 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1190 variables, 692/1194 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:38:35] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 1195 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 497/516 places, 693/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 497/516 places, 693/714 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : CO4-PT-20-LTLFireability-15
Product exploration explored 100000 steps with 24988 reset in 140 ms.
Product exploration explored 100000 steps with 25003 reset in 186 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1005 edges and 497 vertex of which 492 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p2 p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 155 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (770 resets) in 155 ms. (256 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40001 steps (139 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (138 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
[2025-05-30 13:38:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 237/279 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 17/296 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/316 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 447/763 variables, 203/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 308/1071 variables, 172/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1071 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 97/1168 variables, 61/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1168 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 20/1188 variables, 13/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1188 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1190 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1190 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1190 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 502 constraints, problems are : Problem set: 0 solved, 2 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 237/279 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 17/296 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 20/316 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 447/763 variables, 203/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/763 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 308/1071 variables, 172/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1071 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 97/1168 variables, 61/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1168 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 20/1188 variables, 13/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1188 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/1190 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1190 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1190 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 504 constraints, problems are : Problem set: 0 solved, 2 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1388ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 693/693 transitions.
Graph (trivial) has 530 edges and 497 vertex of which 3 / 497 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1002 edges and 495 vertex of which 478 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 478 transition count 440
Reduce places removed 211 places and 0 transitions.
Ensure Unique test 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 1 with 213 rules applied. Total rules applied 451 place count 267 transition count 438
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 454 place count 266 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 456 place count 264 transition count 436
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 456 place count 264 transition count 387
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 554 place count 215 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 557 place count 212 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 560 place count 212 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 563 place count 212 transition count 381
Performed 76 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 715 place count 136 transition count 283
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 725 place count 136 transition count 273
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 733 place count 128 transition count 260
Iterating global reduction 6 with 8 rules applied. Total rules applied 741 place count 128 transition count 260
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 749 place count 124 transition count 256
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 750 place count 124 transition count 255
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 751 place count 123 transition count 253
Iterating global reduction 7 with 1 rules applied. Total rules applied 752 place count 123 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 753 place count 123 transition count 252
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 829 place count 85 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 8 with 79 rules applied. Total rules applied 908 place count 85 transition count 213
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 935 place count 58 transition count 150
Iterating global reduction 9 with 27 rules applied. Total rules applied 962 place count 58 transition count 150
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 980 place count 58 transition count 132
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 987 place count 51 transition count 103
Iterating global reduction 10 with 7 rules applied. Total rules applied 994 place count 51 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 999 place count 51 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1004 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1005 place count 50 transition count 91
Iterating global reduction 11 with 1 rules applied. Total rules applied 1006 place count 50 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1007 place count 50 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1009 place count 49 transition count 100
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 1020 place count 49 transition count 89
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1033 place count 38 transition count 87
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1036 place count 38 transition count 87
Graph (complete) has 155 edges and 38 vertex of which 37 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 1037 place count 37 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1040 place count 37 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1043 place count 37 transition count 84
Graph (complete) has 147 edges and 37 vertex of which 36 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 1044 place count 36 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1047 place count 36 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1050 place count 36 transition count 81
Graph (complete) has 139 edges and 36 vertex of which 35 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 17 with 1 rules applied. Total rules applied 1051 place count 35 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1054 place count 35 transition count 78
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1057 place count 35 transition count 78
Graph (complete) has 131 edges and 35 vertex of which 34 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 19 with 1 rules applied. Total rules applied 1058 place count 34 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1061 place count 34 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 1064 place count 34 transition count 75
Graph (complete) has 123 edges and 34 vertex of which 33 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 21 with 1 rules applied. Total rules applied 1065 place count 33 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1068 place count 33 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1069 place count 32 transition count 71
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 t375.t379.t568.t601 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.
Graph (trivial) has 18 edges and 28 vertex of which 3 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 23 with 5 rules applied. Total rules applied 1074 place count 26 transition count 67
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 24 edges and 20 vertex of which 11 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 24 with 18 rules applied. Total rules applied 1092 place count 11 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 25 with 36 rules applied. Total rules applied 1128 place count 11 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 26 with 4 rules applied. Total rules applied 1132 place count 11 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1133 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1134 place count 10 transition count 15
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 1136 place count 10 transition count 15
Applied a total of 1136 rules in 51 ms. Remains 10 /497 variables (removed 487) and now considering 15/693 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 10/497 places, 15/693 transitions.
RANDOM walk for 20032 steps (5 resets) in 35 ms. (556 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR p2 p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p2) (NOT p1))))), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2 p1))), (F p0)]
Knowledge based reduction with 16 factoid took 492 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 435 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
[2025-05-30 13:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:38:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-30 13:38:46] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-05-30 13:38:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:38:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-30 13:38:47] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-05-30 13:38:47] [INFO ] Computed and/alt/rep : 674/1230/674 causal constraints (skipped 18 transitions) in 36 ms.
[2025-05-30 13:38:53] [INFO ] Added : 602 causal constraints over 121 iterations in 5664 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 497/497 places, 693/693 transitions.
Applied a total of 0 rules in 9 ms. Remains 497 /497 variables (removed 0) and now considering 693/693 (removed 0) transitions.
[2025-05-30 13:38:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:38:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-30 13:38:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:38:53] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 692 sub problems to find dead transitions.
[2025-05-30 13:38:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (OVERLAPS) 693/1190 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 502 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (OVERLAPS) 693/1190 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1190 variables, 692/1194 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:46] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 1195 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 692/692 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in LTL mode , in 1 iterations and 60589 ms. Remains : 497/497 places, 693/693 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1005 edges and 497 vertex of which 492 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (OR p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (651 resets) in 128 ms. (310 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (140 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (142 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (138 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (140 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
[2025-05-30 13:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 237/279 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 17/296 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 20/316 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 447/763 variables, 203/254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/763 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 308/1071 variables, 172/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1071 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 97/1168 variables, 61/487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1168 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 20/1188 variables, 13/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1188 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2/1190 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1190 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1190 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 502 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/42 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 237/279 variables, 31/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 17/296 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 20/316 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 447/763 variables, 203/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/763 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 308/1071 variables, 172/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1071 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 97/1168 variables, 61/492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1168 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 20/1188 variables, 13/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1188 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/1190 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1190 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1190 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 507 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2463ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 126 ms.
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 693/693 transitions.
Graph (trivial) has 530 edges and 497 vertex of which 3 / 497 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1002 edges and 495 vertex of which 478 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 478 transition count 440
Reduce places removed 211 places and 0 transitions.
Ensure Unique test 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 1 with 213 rules applied. Total rules applied 451 place count 267 transition count 438
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 454 place count 266 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 456 place count 264 transition count 436
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 456 place count 264 transition count 387
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 554 place count 215 transition count 387
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 557 place count 212 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 560 place count 212 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 563 place count 212 transition count 381
Performed 76 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 715 place count 136 transition count 283
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 725 place count 136 transition count 273
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 733 place count 128 transition count 260
Iterating global reduction 6 with 8 rules applied. Total rules applied 741 place count 128 transition count 260
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 749 place count 124 transition count 256
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 750 place count 124 transition count 255
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 751 place count 123 transition count 253
Iterating global reduction 7 with 1 rules applied. Total rules applied 752 place count 123 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 753 place count 123 transition count 252
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 829 place count 85 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 8 with 79 rules applied. Total rules applied 908 place count 85 transition count 213
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 935 place count 58 transition count 150
Iterating global reduction 9 with 27 rules applied. Total rules applied 962 place count 58 transition count 150
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 980 place count 58 transition count 132
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 987 place count 51 transition count 103
Iterating global reduction 10 with 7 rules applied. Total rules applied 994 place count 51 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 999 place count 51 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1004 place count 51 transition count 93
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1005 place count 50 transition count 91
Iterating global reduction 11 with 1 rules applied. Total rules applied 1006 place count 50 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1007 place count 50 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1009 place count 49 transition count 100
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 1020 place count 49 transition count 89
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1033 place count 38 transition count 87
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1036 place count 38 transition count 87
Graph (complete) has 155 edges and 38 vertex of which 37 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 1037 place count 37 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1040 place count 37 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1043 place count 37 transition count 84
Graph (complete) has 147 edges and 37 vertex of which 36 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 1044 place count 36 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1047 place count 36 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1050 place count 36 transition count 81
Graph (complete) has 139 edges and 36 vertex of which 35 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 17 with 1 rules applied. Total rules applied 1051 place count 35 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1054 place count 35 transition count 78
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1057 place count 35 transition count 78
Graph (complete) has 131 edges and 35 vertex of which 34 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 19 with 1 rules applied. Total rules applied 1058 place count 34 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1061 place count 34 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 1064 place count 34 transition count 75
Graph (complete) has 123 edges and 34 vertex of which 33 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 21 with 1 rules applied. Total rules applied 1065 place count 33 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1068 place count 33 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1069 place count 32 transition count 71
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 t375.t379.t568.t601 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.
Graph (trivial) has 18 edges and 28 vertex of which 3 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 23 with 5 rules applied. Total rules applied 1074 place count 26 transition count 67
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 24 edges and 20 vertex of which 11 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 24 with 18 rules applied. Total rules applied 1092 place count 11 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 25 with 36 rules applied. Total rules applied 1128 place count 11 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 26 with 4 rules applied. Total rules applied 1132 place count 11 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1133 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1134 place count 10 transition count 15
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 1136 place count 10 transition count 15
Applied a total of 1136 rules in 32 ms. Remains 10 /497 variables (removed 487) and now considering 15/693 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 10/497 places, 15/693 transitions.
RANDOM walk for 16694 steps (4 resets) in 23 ms. (695 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (OR p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT p1)), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p2) (NOT p1))))), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 465 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
[2025-05-30 13:39:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:39:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-30 13:39:58] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-05-30 13:39:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:39:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-30 13:39:58] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2025-05-30 13:39:58] [INFO ] Computed and/alt/rep : 674/1230/674 causal constraints (skipped 18 transitions) in 31 ms.
[2025-05-30 13:40:04] [INFO ] Added : 602 causal constraints over 121 iterations in 5506 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 410 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 20043 reset in 126 ms.
Product exploration explored 100000 steps with 19999 reset in 140 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 383 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 497/497 places, 693/693 transitions.
Graph (trivial) has 530 edges and 497 vertex of which 3 / 497 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1003 edges and 495 vertex of which 490 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 204 rules applied. Total rules applied 206 place count 490 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 207 place count 490 transition count 684
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 207 place count 490 transition count 687
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 490 transition count 687
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 274 place count 429 transition count 626
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 335 place count 429 transition count 626
Performed 105 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 440 place count 429 transition count 681
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 456 place count 429 transition count 665
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 552 place count 333 transition count 564
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 96 rules applied. Total rules applied 648 place count 333 transition count 564
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 649 place count 332 transition count 563
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 650 place count 332 transition count 563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 651 place count 332 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 652 place count 332 transition count 562
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 654 place count 330 transition count 560
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 656 place count 330 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 657 place count 330 transition count 560
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 659 place count 328 transition count 557
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 661 place count 328 transition count 557
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 663 place count 326 transition count 554
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 665 place count 326 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 666 place count 326 transition count 553
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 667 place count 325 transition count 552
Deduced a syphon composed of 162 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 668 place count 325 transition count 552
Performed 60 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 60 rules applied. Total rules applied 728 place count 325 transition count 853
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 784 place count 325 transition count 797
Discarding 99 places :
Symmetric choice reduction at 6 with 99 rule applications. Total rules 883 place count 226 transition count 526
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 6 with 99 rules applied. Total rules applied 982 place count 226 transition count 526
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 1010 place count 226 transition count 498
Discarding 63 places :
Symmetric choice reduction at 7 with 63 rule applications. Total rules 1073 place count 163 transition count 370
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 7 with 63 rules applied. Total rules applied 1136 place count 163 transition count 370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1144 place count 163 transition count 362
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1157 place count 150 transition count 337
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 1170 place count 150 transition count 337
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1173 place count 150 transition count 388
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1183 place count 150 transition count 378
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1188 place count 145 transition count 356
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 1193 place count 145 transition count 356
Deduced a syphon composed of 78 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 9 with 48 rules applied. Total rules applied 1241 place count 145 transition count 308
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1242 place count 144 transition count 307
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1243 place count 144 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1244 place count 144 transition count 328
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1246 place count 142 transition count 312
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1248 place count 142 transition count 312
Deduced a syphon composed of 76 places in 0 ms
Applied a total of 1248 rules in 77 ms. Remains 142 /497 variables (removed 355) and now considering 312/693 (removed 381) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:40:05] [INFO ] Redundant transitions in 2 ms returned []
Running 311 sub problems to find dead transitions.
[2025-05-30 13:40:05] [INFO ] Flow matrix only has 293 transitions (discarded 19 similar events)
// Phase 1: matrix 293 rows 142 cols
[2025-05-30 13:40:05] [INFO ] Computed 5 invariants in 0 ms
[2025-05-30 13:40:05] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:07] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 5/10 constraints. Problems are: Problem set: 15 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 296 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 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 TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 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 TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 4 (OVERLAPS) 292/434 variables, 142/152 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 26/178 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/178 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/435 variables, 1/179 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/179 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/179 constraints. Problems are: Problem set: 171 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 179 constraints, problems are : Problem set: 171 solved, 140 unsolved in 13079 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 142/142 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 171 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 16/81 variables, 5/5 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 5/10 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 276/357 variables, 81/91 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 26/117 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 140/257 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/257 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 77/434 variables, 61/318 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/318 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 1/435 variables, 1/319 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/319 constraints. Problems are: Problem set: 171 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 0/435 variables, 0/319 constraints. Problems are: Problem set: 171 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 319 constraints, problems are : Problem set: 171 solved, 140 unsolved in 17271 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 142/142 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 140/311 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30391ms problems are : Problem set: 171 solved, 140 unsolved
Search for dead transitions found 171 dead transitions in 30391ms
Found 171 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 171 transitions
Dead transitions reduction (with SMT) removed 171 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 142/497 places, 141/693 transitions.
Graph (complete) has 287 edges and 142 vertex of which 66 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 66 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 10 rules in 11 ms. Remains 66 /142 variables (removed 76) and now considering 146/141 (removed -5) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/497 places, 146/693 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30490 ms. Remains : 66/497 places, 146/693 transitions.
Built C files in :
/tmp/ltsmin18061018374749850383
[2025-05-30 13:40:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18061018374749850383
Running compilation step : cd /tmp/ltsmin18061018374749850383;'/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 999 ms.
Running link step : cd /tmp/ltsmin18061018374749850383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18061018374749850383;'/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/stateBased5871999418819698142.hoa' '--buchi-type=spotba'
LTSmin run took 203 ms.
FORMULA CO4-PT-20-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-20-LTLFireability-15 finished in 175681 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)||((p1&&F(p0)) U X(X(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(p0))||(F(p0)&&G(p1)))))))))'
Found a Shortening insensitive property : CO4-PT-20-LTLFireability-14
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 516/516 places, 714/714 transitions.
Graph (trivial) has 550 edges and 516 vertex of which 3 / 516 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1034 edges and 514 vertex of which 509 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 508 transition count 484
Reduce places removed 221 places and 0 transitions.
Ensure Unique test 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 1 with 223 rules applied. Total rules applied 446 place count 287 transition count 482
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 448 place count 286 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 449 place count 285 transition count 481
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 449 place count 285 transition count 434
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 543 place count 238 transition count 434
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 544 place count 237 transition count 433
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 237 transition count 433
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 545 place count 237 transition count 432
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 547 place count 236 transition count 432
Performed 84 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 715 place count 152 transition count 324
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 727 place count 152 transition count 312
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 736 place count 143 transition count 298
Iterating global reduction 5 with 9 rules applied. Total rules applied 745 place count 143 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 746 place count 143 transition count 297
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 6 with 2 rules applied. Total rules applied 748 place count 142 transition count 296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 749 place count 141 transition count 294
Iterating global reduction 6 with 1 rules applied. Total rules applied 750 place count 141 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 751 place count 141 transition count 293
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 833 place count 100 transition count 339
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 853 place count 100 transition count 319
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 881 place count 72 transition count 207
Iterating global reduction 8 with 28 rules applied. Total rules applied 909 place count 72 transition count 207
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 927 place count 72 transition count 189
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 934 place count 65 transition count 151
Iterating global reduction 9 with 7 rules applied. Total rules applied 941 place count 65 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 945 place count 65 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 953 place count 61 transition count 188
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 962 place count 61 transition count 179
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 964 place count 61 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 966 place count 61 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 968 place count 59 transition count 175
Applied a total of 968 rules in 37 ms. Remains 59 /516 variables (removed 457) and now considering 175/714 (removed 539) transitions.
[2025-05-30 13:40:37] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
// Phase 1: matrix 145 rows 59 cols
[2025-05-30 13:40:37] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 13:40:37] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2025-05-30 13:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:40:37] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-05-30 13:40:37] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2025-05-30 13:40:37] [INFO ] Invariant cache hit.
[2025-05-30 13:40:37] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/204 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 67 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4188 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 149/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 216 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7940 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12156ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 12157ms
Starting structural reductions in LI_LTL mode, iteration 1 : 59/516 places, 175/714 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12313 ms. Remains : 59/516 places, 175/714 transitions.
Running random walk in product with property : CO4-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 1016 reset in 61 ms.
Product exploration explored 100000 steps with 2564 reset in 74 ms.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 29066 steps (2405 resets) in 62 ms. (461 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-05-30 13:40:51] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2025-05-30 13:40:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 13:40:51] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2025-05-30 13:40:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:40:51] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-05-30 13:40:51] [INFO ] Flow matrix only has 145 transitions (discarded 30 similar events)
[2025-05-30 13:40:51] [INFO ] Invariant cache hit.
[2025-05-30 13:40:51] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/204 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 67 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4172 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 144/203 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 149/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 1/204 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 216 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7824 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12024ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 12024ms
Finished structural reductions in LTL mode , in 1 iterations and 12131 ms. Remains : 59/59 places, 175/175 transitions.
Computed a total of 9 stabilizing places and 28 stable transitions
Computed a total of 9 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 37319 steps (3103 resets) in 87 ms. (424 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 882 reset in 45 ms.
Product exploration explored 100000 steps with 748 reset in 48 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 175/175 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 59 transition count 138
Applied a total of 37 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 138/175 (removed 37) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:41:05] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2025-05-30 13:41:05] [INFO ] Flow matrix only has 110 transitions (discarded 28 similar events)
// Phase 1: matrix 110 rows 59 cols
[2025-05-30 13:41:05] [INFO ] Computed 5 invariants in 0 ms
[2025-05-30 13:41:05] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 109/168 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 1/169 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 67 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2737 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 109/168 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 115/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 182 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4798 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7565ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 7566ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/59 places, 138/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7582 ms. Remains : 59/59 places, 138/175 transitions.
Built C files in :
/tmp/ltsmin14069066324899830665
[2025-05-30 13:41:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14069066324899830665
Running compilation step : cd /tmp/ltsmin14069066324899830665;'/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 261 ms.
Running link step : cd /tmp/ltsmin14069066324899830665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14069066324899830665;'/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/stateBased16927746024561264295.hoa' '--buchi-type=spotba'
LTSmin run took 1265 ms.
Treatment of property CO4-PT-20-LTLFireability-14 finished in 36960 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-05-30 13:41:14] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13522813836305722338
[2025-05-30 13:41:14] [INFO ] Computing symmetric may disable matrix : 714 transitions.
[2025-05-30 13:41:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:41:14] [INFO ] Applying decomposition
[2025-05-30 13:41:14] [INFO ] Computing symmetric may enable matrix : 714 transitions.
[2025-05-30 13:41:14] [INFO ] Flatten gal took : 14 ms
[2025-05-30 13:41:14] [INFO ] Computation of Complete enable matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12526163577538733269.txt' '-o' '/tmp/graph12526163577538733269.bin' '-w' '/tmp/graph12526163577538733269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12526163577538733269.bin' '-l' '-1' '-v' '-w' '/tmp/graph12526163577538733269.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:41:14] [INFO ] Decomposing Gal with order
[2025-05-30 13:41:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:41:14] [INFO ] Removed a total of 412 redundant transitions.
[2025-05-30 13:41:14] [INFO ] Computing Do-Not-Accords matrix : 714 transitions.
[2025-05-30 13:41:14] [INFO ] Flatten gal took : 50 ms
[2025-05-30 13:41:14] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:41:14] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13522813836305722338
Running compilation step : cd /tmp/ltsmin13522813836305722338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
[2025-05-30 13:41:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2025-05-30 13:41:14] [INFO ] Time to serialize gal into /tmp/LTLFireability14017648186240951212.gal : 4 ms
[2025-05-30 13:41:14] [INFO ] Time to serialize properties into /tmp/LTLFireability17048540405568029136.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14017648186240951212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17048540405568029136.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G((X("(i11.u112.p696==1)"))||((("(i16.i0.i0.u82.p567==1)")&&(F("(i11.u112.p696==1)")))U(X(X("(i11.u112.p696!=1)")))))))
Formula 0 simplified : F(X!"(i11.u112.p696==1)" & ((!"(i16.i0.i0.u82.p567==1)" | G!"(i11.u112.p696==1)") R XX!"(i11.u112.p696!=1)"))
Compilation finished in 1789 ms.
Running link step : cd /tmp/ltsmin13522813836305722338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13522813836305722338;'/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' '--ltl' '[]((X((LTLAPp0==true))||(((LTLAPp1==true)&&<>((LTLAPp0==true))) U X(X(!(LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t9, t20, t31, t55, t59, t92, t101, t102, t146, t255, t276, t365, t374, t497, t568, t569, t606...1154
Computing Next relation with stutter on 1.2936e+06 deadlock states
45 unique states visited
43 strongly connected components in search stack
46 transitions explored
43 items max in DFS search stack
3439 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,34.4618,787492,1,0,941969,13875,8446,6.63458e+06,703,120082,1449137
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-20-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(X(F((G(F("(i18.u177.p1043!=1)")))||((F("(i18.u177.p1043!=1)"))&&(G("(i2.i1.i0.u42.p332!=1)"))))))))))
Formula 1 simplified : XXXXG(FG!"(i18.u177.p1043!=1)" & (G!"(i18.u177.p1043!=1)" | F!"(i2.i1.i0.u42.p332!=1)"))
Computing Next relation with stutter on 1.2936e+06 deadlock states
94 unique states visited
94 strongly connected components in search stack
95 transitions explored
94 items max in DFS search stack
19500 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,229.47,4064060,1,0,6.64457e+06,15608,3984,3.09575e+07,346,145847,18531
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CO4-PT-20-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1508344 ms.

BK_STOP 1748612990736

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

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