Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860066900156.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 DLCround-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860066900156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 674K 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 DLCround-PT-05b-LTLFireability-00
FORMULA_NAME DLCround-PT-05b-LTLFireability-01
FORMULA_NAME DLCround-PT-05b-LTLFireability-02
FORMULA_NAME DLCround-PT-05b-LTLFireability-03
FORMULA_NAME DLCround-PT-05b-LTLFireability-04
FORMULA_NAME DLCround-PT-05b-LTLFireability-05
FORMULA_NAME DLCround-PT-05b-LTLFireability-06
FORMULA_NAME DLCround-PT-05b-LTLFireability-07
FORMULA_NAME DLCround-PT-05b-LTLFireability-08
FORMULA_NAME DLCround-PT-05b-LTLFireability-09
FORMULA_NAME DLCround-PT-05b-LTLFireability-10
FORMULA_NAME DLCround-PT-05b-LTLFireability-11
FORMULA_NAME DLCround-PT-05b-LTLFireability-12
FORMULA_NAME DLCround-PT-05b-LTLFireability-13
FORMULA_NAME DLCround-PT-05b-LTLFireability-14
FORMULA_NAME DLCround-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748667199195

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 04:53:21] [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-31 04:53:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 04:53:21] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-05-31 04:53:21] [INFO ] Transformed 1999 places.
[2025-05-31 04:53:21] [INFO ] Transformed 2887 transitions.
[2025-05-31 04:53:21] [INFO ] Found NUPN structural information;
[2025-05-31 04:53:21] [INFO ] Parsed PT model containing 1999 places and 2887 transitions and 7649 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DLCround-PT-05b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 1999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1999/1999 places, 2887/2887 transitions.
Discarding 338 places :
Symmetric choice reduction at 0 with 338 rule applications. Total rules 338 place count 1661 transition count 2549
Iterating global reduction 0 with 338 rules applied. Total rules applied 676 place count 1661 transition count 2549
Discarding 260 places :
Symmetric choice reduction at 0 with 260 rule applications. Total rules 936 place count 1401 transition count 2289
Iterating global reduction 0 with 260 rules applied. Total rules applied 1196 place count 1401 transition count 2289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1202 place count 1401 transition count 2283
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 1252 place count 1351 transition count 2181
Iterating global reduction 1 with 50 rules applied. Total rules applied 1302 place count 1351 transition count 2181
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 1335 place count 1318 transition count 2148
Iterating global reduction 1 with 33 rules applied. Total rules applied 1368 place count 1318 transition count 2148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1372 place count 1318 transition count 2144
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1389 place count 1301 transition count 2127
Iterating global reduction 2 with 17 rules applied. Total rules applied 1406 place count 1301 transition count 2127
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1423 place count 1284 transition count 2110
Iterating global reduction 2 with 17 rules applied. Total rules applied 1440 place count 1284 transition count 2110
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1457 place count 1267 transition count 2093
Iterating global reduction 2 with 17 rules applied. Total rules applied 1474 place count 1267 transition count 2093
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1485 place count 1256 transition count 2082
Iterating global reduction 2 with 11 rules applied. Total rules applied 1496 place count 1256 transition count 2082
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1503 place count 1249 transition count 2075
Iterating global reduction 2 with 7 rules applied. Total rules applied 1510 place count 1249 transition count 2075
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1516 place count 1243 transition count 2069
Iterating global reduction 2 with 6 rules applied. Total rules applied 1522 place count 1243 transition count 2069
Applied a total of 1522 rules in 997 ms. Remains 1243 /1999 variables (removed 756) and now considering 2069/2887 (removed 818) transitions.
// Phase 1: matrix 2069 rows 1243 cols
[2025-05-31 04:53:22] [INFO ] Computed 88 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:53:23] [INFO ] Implicit Places using invariants in 682 ms returned []
[2025-05-31 04:53:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:53:24] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
Running 2068 sub problems to find dead transitions.
[2025-05-31 04:53:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1242/3312 variables, and 0 constraints, problems are : Problem set: 0 solved, 2068 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 2068/2068 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2068 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1242/3312 variables, and 0 constraints, problems are : Problem set: 0 solved, 2068 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1243 constraints, PredecessorRefiner: 0/2068 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60808ms problems are : Problem set: 0 solved, 2068 unsolved
Search for dead transitions found 0 dead transitions in 62727ms
Starting structural reductions in LTL mode, iteration 1 : 1243/1999 places, 2069/2887 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65467 ms. Remains : 1243/1999 places, 2069/2887 transitions.
Support contains 39 out of 1243 places after structural reductions.
[2025-05-31 04:54:27] [INFO ] Flatten gal took : 133 ms
[2025-05-31 04:54:27] [INFO ] Flatten gal took : 84 ms
[2025-05-31 04:54:27] [INFO ] Input system was already deterministic with 2069 transitions.
RANDOM walk for 40000 steps (8 resets) in 1282 ms. (31 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
[2025-05-31 04:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 456/464 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 779/1243 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1243 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2069/3312 variables, 1243/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3312 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3312 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3312/3312 variables, and 1331 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1728 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 456/464 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 779/1243 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1243 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2069/3312 variables, 1243/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3312 variables, 3/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 04:54:30] [INFO ] Deduced a trap along path composed of 5 places in 44 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3312 variables, 1/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3312 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3312 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3312/3312 variables, and 1335 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2104 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3855ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 527 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=87 )
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 12 ms.
Computed a total of 174 stabilizing places and 174 stable transitions
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)||(X(p1)&&F(p2))) U p3))'
Support contains 5 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1226 transition count 2052
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1226 transition count 2052
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1221 transition count 2047
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1221 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1220 transition count 2046
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1220 transition count 2046
Applied a total of 46 rules in 106 ms. Remains 1220 /1243 variables (removed 23) and now considering 2046/2069 (removed 23) transitions.
// Phase 1: matrix 2046 rows 1220 cols
[2025-05-31 04:54:32] [INFO ] Computed 88 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:54:33] [INFO ] Implicit Places using invariants in 451 ms returned []
[2025-05-31 04:54:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:54:34] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
Running 2045 sub problems to find dead transitions.
[2025-05-31 04:54:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1219/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 2045 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1220 constraints, PredecessorRefiner: 2045/2045 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2045 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1219/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 2045 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1220 constraints, PredecessorRefiner: 0/2045 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60504ms problems are : Problem set: 0 solved, 2045 unsolved
Search for dead transitions found 0 dead transitions in 60509ms
Starting structural reductions in LTL mode, iteration 1 : 1220/1243 places, 2046/2069 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62056 ms. Remains : 1220/1243 places, 2046/2069 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-01
Product exploration explored 100000 steps with 45 reset in 388 ms.
Product exploration explored 100000 steps with 35 reset in 415 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 87 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 453 ms. (88 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
[2025-05-31 04:55:36] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/195 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1025/1220 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2046/3266 variables, 1220/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3266 variables, 0/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3266 variables, 0/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3266/3266 variables, and 1308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1220/1220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/195 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1025/1220 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2046/3266 variables, 1220/1308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3266 variables, 1/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3266 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3266 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3266/3266 variables, and 1309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 1220/1220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 361 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=120 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p3), (F p1)]
Knowledge based reduction with 17 factoid took 341 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
[2025-05-31 04:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p3), (F p1), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 17 factoid took 357 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05b-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-01 finished in 67111 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 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Graph (trivial) has 1140 edges and 1243 vertex of which 349 / 1243 are part of one of the 28 SCC in 8 ms
Free SCC test removed 321 places
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 921 transition count 1519
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 231 rules applied. Total rules applied 435 place count 718 transition count 1491
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 453 place count 700 transition count 1491
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 453 place count 700 transition count 1403
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 629 place count 612 transition count 1403
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 680 place count 561 transition count 1164
Iterating global reduction 3 with 51 rules applied. Total rules applied 731 place count 561 transition count 1164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 735 place count 561 transition count 1160
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 735 place count 561 transition count 1153
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 749 place count 554 transition count 1153
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 751 place count 552 transition count 1138
Iterating global reduction 4 with 2 rules applied. Total rules applied 753 place count 552 transition count 1138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 754 place count 552 transition count 1137
Performed 206 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 206 places in 0 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 5 with 412 rules applied. Total rules applied 1166 place count 346 transition count 926
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1172 place count 346 transition count 920
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1189 place count 329 transition count 776
Iterating global reduction 6 with 17 rules applied. Total rules applied 1206 place count 329 transition count 776
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1221 place count 329 transition count 761
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1255 place count 312 transition count 870
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1256 place count 312 transition count 869
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1260 place count 308 transition count 815
Iterating global reduction 8 with 4 rules applied. Total rules applied 1264 place count 308 transition count 815
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 1289 place count 308 transition count 790
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 1316 place count 308 transition count 763
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1328 place count 296 transition count 739
Iterating global reduction 9 with 12 rules applied. Total rules applied 1340 place count 296 transition count 739
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1352 place count 284 transition count 629
Iterating global reduction 9 with 12 rules applied. Total rules applied 1364 place count 284 transition count 629
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1376 place count 284 transition count 617
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1377 place count 283 transition count 616
Applied a total of 1377 rules in 393 ms. Remains 283 /1243 variables (removed 960) and now considering 616/2069 (removed 1453) transitions.
[2025-05-31 04:55:40] [INFO ] Flow matrix only has 596 transitions (discarded 20 similar events)
// Phase 1: matrix 596 rows 283 cols
[2025-05-31 04:55:40] [INFO ] Computed 88 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:55:40] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-05-31 04:55:40] [INFO ] Flow matrix only has 596 transitions (discarded 20 similar events)
[2025-05-31 04:55:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:55:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-31 04:55:40] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:55:40] [INFO ] Redundant transitions in 30 ms returned []
Running 559 sub problems to find dead transitions.
[2025-05-31 04:55:40] [INFO ] Flow matrix only has 596 transitions (discarded 20 similar events)
[2025-05-31 04:55:40] [INFO ] Invariant cache hit.
[2025-05-31 04:55:40] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (OVERLAPS) 595/878 variables, 283/371 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/878 variables, 36/407 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/878 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 878/879 variables, and 407 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 283/283 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 559 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (OVERLAPS) 595/878 variables, 283/371 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/878 variables, 36/407 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/878 variables, 559/966 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 878/879 variables, and 966 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 283/283 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 559 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Starting structural reductions in SI_LTL mode, iteration 1 : 283/1243 places, 616/2069 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61047 ms. Remains : 283/1243 places, 616/2069 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-03 finished in 61113 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 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Graph (trivial) has 1140 edges and 1243 vertex of which 349 / 1243 are part of one of the 28 SCC in 3 ms
Free SCC test removed 321 places
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 921 transition count 1519
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 234 rules applied. Total rules applied 438 place count 718 transition count 1488
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 458 place count 698 transition count 1488
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 458 place count 698 transition count 1401
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 632 place count 611 transition count 1401
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 683 place count 560 transition count 1162
Iterating global reduction 3 with 51 rules applied. Total rules applied 734 place count 560 transition count 1162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 738 place count 560 transition count 1158
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 738 place count 560 transition count 1151
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 752 place count 553 transition count 1151
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 754 place count 551 transition count 1136
Iterating global reduction 4 with 2 rules applied. Total rules applied 756 place count 551 transition count 1136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 757 place count 551 transition count 1135
Performed 206 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 206 places in 0 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 5 with 412 rules applied. Total rules applied 1169 place count 345 transition count 923
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1175 place count 345 transition count 917
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1192 place count 328 transition count 773
Iterating global reduction 6 with 17 rules applied. Total rules applied 1209 place count 328 transition count 773
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1224 place count 328 transition count 758
Performed 16 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1256 place count 312 transition count 874
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1259 place count 309 transition count 834
Iterating global reduction 7 with 3 rules applied. Total rules applied 1262 place count 309 transition count 834
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1280 place count 309 transition count 816
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 8 with 27 rules applied. Total rules applied 1307 place count 309 transition count 789
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1319 place count 297 transition count 765
Iterating global reduction 8 with 12 rules applied. Total rules applied 1331 place count 297 transition count 765
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1343 place count 285 transition count 655
Iterating global reduction 8 with 12 rules applied. Total rules applied 1355 place count 285 transition count 655
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1367 place count 285 transition count 643
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1368 place count 284 transition count 642
Applied a total of 1368 rules in 326 ms. Remains 284 /1243 variables (removed 959) and now considering 642/2069 (removed 1427) transitions.
[2025-05-31 04:56:41] [INFO ] Flow matrix only has 615 transitions (discarded 27 similar events)
// Phase 1: matrix 615 rows 284 cols
[2025-05-31 04:56:41] [INFO ] Computed 88 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:56:41] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-31 04:56:41] [INFO ] Flow matrix only has 615 transitions (discarded 27 similar events)
[2025-05-31 04:56:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:56:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 04:56:41] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:56:41] [INFO ] Redundant transitions in 6 ms returned []
Running 586 sub problems to find dead transitions.
[2025-05-31 04:56:41] [INFO ] Flow matrix only has 615 transitions (discarded 27 similar events)
[2025-05-31 04:56:41] [INFO ] Invariant cache hit.
[2025-05-31 04:56:41] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/284 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 614/898 variables, 284/372 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/898 variables, 39/411 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/899 variables, and 411 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 284/284 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/284 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 614/898 variables, 284/372 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/898 variables, 39/411 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 586/997 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/899 variables, and 997 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 284/284 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Starting structural reductions in SI_LTL mode, iteration 1 : 284/1243 places, 642/2069 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60994 ms. Remains : 284/1243 places, 642/2069 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-04
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 7 ms.
FORMULA DLCround-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-04 finished in 61107 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' '!(((p0 U X(G(p1))) U G(p2)))'
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1226 transition count 2052
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1226 transition count 2052
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 1221 transition count 2047
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 1221 transition count 2047
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1219 transition count 2045
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1215 transition count 2041
Applied a total of 56 rules in 220 ms. Remains 1215 /1243 variables (removed 28) and now considering 2041/2069 (removed 28) transitions.
// Phase 1: matrix 2041 rows 1215 cols
[2025-05-31 04:57:42] [INFO ] Computed 88 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:57:42] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-05-31 04:57:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:57:43] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
Running 2040 sub problems to find dead transitions.
[2025-05-31 04:57:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1214/3256 variables, and 0 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1215 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1214/3256 variables, and 0 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1215 constraints, PredecessorRefiner: 0/2040 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 60488ms
Starting structural reductions in LTL mode, iteration 1 : 1215/1243 places, 2041/2069 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62053 ms. Remains : 1215/1243 places, 2041/2069 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 85555 steps with 0 reset in 314 ms.
FORMULA DLCround-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-06 finished in 62628 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 G(p1)) U (p2 U (G(p2)||(p2&&(!p1 U (p3||G(!p1)))))))))'
Support contains 6 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1223 transition count 2049
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1223 transition count 2049
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1217 transition count 2043
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1217 transition count 2043
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1215 transition count 2041
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1212 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1211 transition count 2037
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1211 transition count 2037
Applied a total of 64 rules in 261 ms. Remains 1211 /1243 variables (removed 32) and now considering 2037/2069 (removed 32) transitions.
// Phase 1: matrix 2037 rows 1211 cols
[2025-05-31 04:58:44] [INFO ] Computed 88 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:58:45] [INFO ] Implicit Places using invariants in 419 ms returned []
[2025-05-31 04:58:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:58:46] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
Running 2036 sub problems to find dead transitions.
[2025-05-31 04:58:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1210/3248 variables, and 0 constraints, problems are : Problem set: 0 solved, 2036 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 2036/2036 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2036 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/3248 variables, and 0 constraints, problems are : Problem set: 0 solved, 2036 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1211 constraints, PredecessorRefiner: 0/2036 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 2036 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Starting structural reductions in LTL mode, iteration 1 : 1211/1243 places, 2037/2069 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62233 ms. Remains : 1211/1243 places, 2037/2069 transitions.
Stuttering acceptance computed with spot in 483 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p1), (AND (NOT p3) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p3) p1), (NOT p2), false]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 383 ms.
Product exploration explored 100000 steps with 50000 reset in 388 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) p2 (NOT p0)), (X p2), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p3) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p1 p2 (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p1) p2 p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 39 factoid took 160 ms. Reduced automaton from 11 states, 43 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-07 finished in 63719 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 U p1))))'
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Graph (trivial) has 1136 edges and 1243 vertex of which 349 / 1243 are part of one of the 28 SCC in 2 ms
Free SCC test removed 321 places
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 921 transition count 1519
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 234 rules applied. Total rules applied 438 place count 718 transition count 1488
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 458 place count 698 transition count 1488
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 458 place count 698 transition count 1401
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 632 place count 611 transition count 1401
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 681 place count 562 transition count 1164
Iterating global reduction 3 with 49 rules applied. Total rules applied 730 place count 562 transition count 1164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 734 place count 562 transition count 1160
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 734 place count 562 transition count 1155
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 744 place count 557 transition count 1155
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 746 place count 555 transition count 1140
Iterating global reduction 4 with 2 rules applied. Total rules applied 748 place count 555 transition count 1140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 749 place count 555 transition count 1139
Performed 207 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 207 places in 0 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 5 with 414 rules applied. Total rules applied 1163 place count 348 transition count 926
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1168 place count 348 transition count 921
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1184 place count 332 transition count 786
Iterating global reduction 6 with 16 rules applied. Total rules applied 1200 place count 332 transition count 786
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1215 place count 332 transition count 771
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1249 place count 315 transition count 887
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1253 place count 311 transition count 831
Iterating global reduction 7 with 4 rules applied. Total rules applied 1257 place count 311 transition count 831
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1282 place count 311 transition count 806
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1310 place count 311 transition count 778
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1320 place count 301 transition count 758
Iterating global reduction 8 with 10 rules applied. Total rules applied 1330 place count 301 transition count 758
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1340 place count 291 transition count 668
Iterating global reduction 8 with 10 rules applied. Total rules applied 1350 place count 291 transition count 668
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1360 place count 291 transition count 658
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1362 place count 291 transition count 658
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1363 place count 291 transition count 657
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1364 place count 290 transition count 655
Iterating global reduction 9 with 1 rules applied. Total rules applied 1365 place count 290 transition count 655
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1366 place count 289 transition count 645
Iterating global reduction 9 with 1 rules applied. Total rules applied 1367 place count 289 transition count 645
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1368 place count 289 transition count 644
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1369 place count 288 transition count 643
Applied a total of 1369 rules in 192 ms. Remains 288 /1243 variables (removed 955) and now considering 643/2069 (removed 1426) transitions.
[2025-05-31 04:59:48] [INFO ] Flow matrix only has 619 transitions (discarded 24 similar events)
// Phase 1: matrix 619 rows 288 cols
[2025-05-31 04:59:48] [INFO ] Computed 88 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:48] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-31 04:59:48] [INFO ] Flow matrix only has 619 transitions (discarded 24 similar events)
[2025-05-31 04:59:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-31 04:59:48] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:59:48] [INFO ] Redundant transitions in 5 ms returned []
Running 586 sub problems to find dead transitions.
[2025-05-31 04:59:48] [INFO ] Flow matrix only has 619 transitions (discarded 24 similar events)
[2025-05-31 04:59:48] [INFO ] Invariant cache hit.
[2025-05-31 04:59:48] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/288 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 618/906 variables, 288/376 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 39/415 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/907 variables, and 415 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 288/288 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/288 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 618/906 variables, 288/376 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 39/415 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 586/1001 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:00:41] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 906/907 variables, and 1002 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 288/288 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in SI_LTL mode, iteration 1 : 288/1243 places, 643/2069 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60817 ms. Remains : 288/1243 places, 643/2069 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-08 finished in 60920 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&&(!p1||X(X(F(p2))))))) U p3))'
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Graph (trivial) has 1136 edges and 1243 vertex of which 329 / 1243 are part of one of the 28 SCC in 2 ms
Free SCC test removed 301 places
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 323 transitions.
Reduce places removed 1 places and 1 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 209 rules applied. Total rules applied 210 place count 941 transition count 1536
Reduce places removed 209 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 240 rules applied. Total rules applied 450 place count 732 transition count 1505
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 470 place count 712 transition count 1505
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 470 place count 712 transition count 1415
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 650 place count 622 transition count 1415
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 698 place count 574 transition count 1187
Iterating global reduction 3 with 48 rules applied. Total rules applied 746 place count 574 transition count 1187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 750 place count 574 transition count 1183
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 750 place count 574 transition count 1176
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 764 place count 567 transition count 1176
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 766 place count 565 transition count 1161
Iterating global reduction 4 with 2 rules applied. Total rules applied 768 place count 565 transition count 1161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 769 place count 565 transition count 1160
Performed 212 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 212 places in 1 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 5 with 424 rules applied. Total rules applied 1193 place count 353 transition count 942
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1199 place count 353 transition count 936
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1213 place count 339 transition count 819
Iterating global reduction 6 with 14 rules applied. Total rules applied 1227 place count 339 transition count 819
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1239 place count 339 transition count 807
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 7 with 2 rules applied. Total rules applied 1241 place count 338 transition count 806
Performed 18 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1277 place count 320 transition count 945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1278 place count 320 transition count 944
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1282 place count 316 transition count 890
Iterating global reduction 8 with 4 rules applied. Total rules applied 1286 place count 316 transition count 890
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 1311 place count 316 transition count 865
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 1337 place count 316 transition count 839
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1346 place count 307 transition count 821
Iterating global reduction 9 with 9 rules applied. Total rules applied 1355 place count 307 transition count 821
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1364 place count 298 transition count 739
Iterating global reduction 9 with 9 rules applied. Total rules applied 1373 place count 298 transition count 739
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1382 place count 298 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1383 place count 297 transition count 729
Applied a total of 1383 rules in 145 ms. Remains 297 /1243 variables (removed 946) and now considering 729/2069 (removed 1340) transitions.
[2025-05-31 05:00:49] [INFO ] Flow matrix only has 706 transitions (discarded 23 similar events)
// Phase 1: matrix 706 rows 297 cols
[2025-05-31 05:00:49] [INFO ] Computed 88 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:00:49] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-31 05:00:49] [INFO ] Flow matrix only has 706 transitions (discarded 23 similar events)
[2025-05-31 05:00:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:00:49] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-31 05:00:49] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:00:49] [INFO ] Redundant transitions in 7 ms returned []
Running 672 sub problems to find dead transitions.
[2025-05-31 05:00:49] [INFO ] Flow matrix only has 706 transitions (discarded 23 similar events)
[2025-05-31 05:00:49] [INFO ] Invariant cache hit.
[2025-05-31 05:00:49] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (OVERLAPS) 2/297 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 705/1002 variables, 297/385 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1002 variables, 48/433 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1002/1003 variables, and 433 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 297/297 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 672 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (OVERLAPS) 2/297 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 4 (OVERLAPS) 705/1002 variables, 297/385 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1002 variables, 48/433 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 672/1105 constraints. Problems are: Problem set: 0 solved, 672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1003 variables, and 1105 constraints, problems are : Problem set: 0 solved, 672 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 297/297 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 672/672 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 60275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 297/1243 places, 729/2069 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60844 ms. Remains : 297/1243 places, 729/2069 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p3), (OR (NOT p0) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-09 finished in 61045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(((G(F(p1)) U p1) U (p0&&(G(F(p1)) U p1)))))) U p2))'
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1224 transition count 2050
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1224 transition count 2050
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 1218 transition count 2044
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 1218 transition count 2044
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1216 transition count 2042
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1212 transition count 2038
Applied a total of 62 rules in 254 ms. Remains 1212 /1243 variables (removed 31) and now considering 2038/2069 (removed 31) transitions.
// Phase 1: matrix 2038 rows 1212 cols
[2025-05-31 05:01:50] [INFO ] Computed 88 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:01:50] [INFO ] Implicit Places using invariants in 419 ms returned []
[2025-05-31 05:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:01:51] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Running 2037 sub problems to find dead transitions.
[2025-05-31 05:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3250 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 2037/2037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2037 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3250 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 0/2037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60506ms problems are : Problem set: 0 solved, 2037 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Starting structural reductions in LTL mode, iteration 1 : 1212/1243 places, 2038/2069 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62142 ms. Remains : 1212/1243 places, 2038/2069 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-10
Product exploration explored 100000 steps with 360 reset in 213 ms.
Product exploration explored 100000 steps with 354 reset in 291 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Detected a total of 171/1212 stabilizing places and 171/2038 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 169 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2025-05-31 05:02: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, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 409/3250 variables, and 55 constraints, problems are : Problem set: 1 solved, 0 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 55/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 367 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
[2025-05-31 05:02:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:02:55] [INFO ] [Real]Absence check using 88 positive place invariants in 339 ms returned sat
[2025-05-31 05:03:04] [INFO ] [Real]Absence check using state equation in 9040 ms returned sat
[2025-05-31 05:03:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:03:05] [INFO ] [Nat]Absence check using 88 positive place invariants in 282 ms returned sat
[2025-05-31 05:03:13] [INFO ] [Nat]Absence check using state equation in 8450 ms returned sat
[2025-05-31 05:03:14] [INFO ] Computed and/alt/rep : 1924/3403/1924 causal constraints (skipped 113 transitions) in 85 ms.
Could not prove EG (NOT p2)
Support contains 3 out of 1212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1212/1212 places, 2038/2038 transitions.
Graph (trivial) has 1107 edges and 1212 vertex of which 342 / 1212 are part of one of the 28 SCC in 1 ms
Free SCC test removed 314 places
Ensure Unique test removed 340 transitions
Reduce isomorphic transitions removed 340 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 195 place count 897 transition count 1503
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 224 rules applied. Total rules applied 419 place count 703 transition count 1473
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 439 place count 683 transition count 1473
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 439 place count 683 transition count 1383
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 619 place count 593 transition count 1383
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 663 place count 549 transition count 1127
Iterating global reduction 3 with 44 rules applied. Total rules applied 707 place count 549 transition count 1127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 711 place count 549 transition count 1123
Performed 203 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 203 places in 0 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 4 with 406 rules applied. Total rules applied 1117 place count 346 transition count 914
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1123 place count 346 transition count 908
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1139 place count 330 transition count 776
Iterating global reduction 5 with 16 rules applied. Total rules applied 1155 place count 330 transition count 776
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1171 place count 330 transition count 760
Performed 21 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1213 place count 309 transition count 905
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1217 place count 305 transition count 851
Iterating global reduction 6 with 4 rules applied. Total rules applied 1221 place count 305 transition count 851
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1246 place count 305 transition count 826
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 7 with 37 rules applied. Total rules applied 1283 place count 305 transition count 789
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1295 place count 293 transition count 765
Iterating global reduction 7 with 12 rules applied. Total rules applied 1307 place count 293 transition count 765
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1319 place count 281 transition count 645
Iterating global reduction 7 with 12 rules applied. Total rules applied 1331 place count 281 transition count 645
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1343 place count 281 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1344 place count 280 transition count 632
Applied a total of 1344 rules in 102 ms. Remains 280 /1212 variables (removed 932) and now considering 632/2038 (removed 1406) transitions.
[2025-05-31 05:03:19] [INFO ] Flow matrix only has 605 transitions (discarded 27 similar events)
// Phase 1: matrix 605 rows 280 cols
[2025-05-31 05:03:19] [INFO ] Computed 88 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:03:19] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-31 05:03:19] [INFO ] Flow matrix only has 605 transitions (discarded 27 similar events)
[2025-05-31 05:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:03:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-31 05:03:20] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:03:20] [INFO ] Redundant transitions in 6 ms returned []
Running 576 sub problems to find dead transitions.
[2025-05-31 05:03:20] [INFO ] Flow matrix only has 605 transitions (discarded 27 similar events)
[2025-05-31 05:03:20] [INFO ] Invariant cache hit.
[2025-05-31 05:03:20] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:03:30] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:03:30] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (OVERLAPS) 604/884 variables, 280/370 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 44/414 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 884/885 variables, and 414 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 280/280 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/280 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (OVERLAPS) 604/884 variables, 280/370 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 44/414 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 576/990 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/885 variables, and 990 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 280/280 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 280/1212 places, 632/2038 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60704 ms. Remains : 280/1212 places, 632/2038 transitions.
Computed a total of 3 stabilizing places and 34 stable transitions
Computed a total of 3 stabilizing places and 34 stable transitions
Detected a total of 3/280 stabilizing places and 34/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 375 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (11 resets) in 697 ms. (57 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2025-05-31 05:04:21] [INFO ] Flow matrix only has 605 transitions (discarded 27 similar events)
[2025-05-31 05:04:21] [INFO ] Invariant cache hit.
[2025-05-31 05:04:21] [INFO ] State equation strengthened by 44 read => feed constraints.
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
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 166/885 variables, and 55 constraints, problems are : Problem set: 2 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 55/88 constraints, State Equation: 0/280 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 14 factoid took 500 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
[2025-05-31 05:04:22] [INFO ] Flow matrix only has 605 transitions (discarded 27 similar events)
[2025-05-31 05:04:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:04:22] [INFO ] [Real]Absence check using 88 positive place invariants in 22 ms returned sat
[2025-05-31 05:04:22] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-05-31 05:04:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:04:22] [INFO ] [Nat]Absence check using 88 positive place invariants in 22 ms returned sat
[2025-05-31 05:04:22] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2025-05-31 05:04:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-31 05:04:22] [INFO ] [Nat]Added 44 Read/Feed constraints in 7 ms returned sat
[2025-05-31 05:04:23] [INFO ] Computed and/alt/rep : 369/913/369 causal constraints (skipped 189 transitions) in 33 ms.
[2025-05-31 05:04:23] [INFO ] Added : 4 causal constraints over 3 iterations in 147 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-10 finished in 153164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||G(p1)))) U (p2||(p3 U X(X(X(p2)))))))'
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1225 transition count 2051
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1225 transition count 2051
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1219 transition count 2045
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1219 transition count 2045
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1217 transition count 2043
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1213 transition count 2039
Applied a total of 60 rules in 246 ms. Remains 1213 /1243 variables (removed 30) and now considering 2039/2069 (removed 30) transitions.
// Phase 1: matrix 2039 rows 1213 cols
[2025-05-31 05:04:23] [INFO ] Computed 88 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:24] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-05-31 05:04:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:25] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
Running 2038 sub problems to find dead transitions.
[2025-05-31 05:04:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/3252 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1213 constraints, PredecessorRefiner: 2038/2038 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2038 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/3252 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1213 constraints, PredecessorRefiner: 0/2038 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60498ms problems are : Problem set: 0 solved, 2038 unsolved
Search for dead transitions found 0 dead transitions in 60502ms
Starting structural reductions in LTL mode, iteration 1 : 1213/1243 places, 2039/2069 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62183 ms. Remains : 1213/1243 places, 2039/2069 transitions.
Stuttering acceptance computed with spot in 1054 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-11 finished in 63278 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' '!(((p0 U X(p0)) U p1))'
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1224 transition count 2050
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1224 transition count 2050
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 1218 transition count 2044
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 1218 transition count 2044
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1216 transition count 2042
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1215 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1214 transition count 2040
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1214 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1213 transition count 2039
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1213 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1212 transition count 2038
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1212 transition count 2038
Applied a total of 62 rules in 238 ms. Remains 1212 /1243 variables (removed 31) and now considering 2038/2069 (removed 31) transitions.
// Phase 1: matrix 2038 rows 1212 cols
[2025-05-31 05:05:26] [INFO ] Computed 88 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:05:27] [INFO ] Implicit Places using invariants in 446 ms returned []
[2025-05-31 05:05:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:05:28] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
Running 2037 sub problems to find dead transitions.
[2025-05-31 05:05:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3250 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 2037/2037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2037 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3250 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 0/2037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60499ms problems are : Problem set: 0 solved, 2037 unsolved
Search for dead transitions found 0 dead transitions in 60503ms
Starting structural reductions in LTL mode, iteration 1 : 1212/1243 places, 2038/2069 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62160 ms. Remains : 1212/1243 places, 2038/2069 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1), true]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-13 finished in 62318 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)||G(p1))))'
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Graph (trivial) has 1139 edges and 1243 vertex of which 349 / 1243 are part of one of the 28 SCC in 0 ms
Free SCC test removed 321 places
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 205 place count 921 transition count 1518
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 235 rules applied. Total rules applied 440 place count 717 transition count 1487
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 460 place count 697 transition count 1487
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 460 place count 697 transition count 1400
Deduced a syphon composed of 87 places in 3 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 634 place count 610 transition count 1400
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 684 place count 560 transition count 1162
Iterating global reduction 3 with 50 rules applied. Total rules applied 734 place count 560 transition count 1162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 738 place count 560 transition count 1158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 738 place count 560 transition count 1152
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 750 place count 554 transition count 1152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 752 place count 552 transition count 1137
Iterating global reduction 4 with 2 rules applied. Total rules applied 754 place count 552 transition count 1137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 755 place count 552 transition count 1136
Performed 206 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 206 places in 0 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 5 with 412 rules applied. Total rules applied 1167 place count 346 transition count 924
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1173 place count 346 transition count 918
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1189 place count 330 transition count 783
Iterating global reduction 6 with 16 rules applied. Total rules applied 1205 place count 330 transition count 783
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1220 place count 330 transition count 768
Performed 16 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1252 place count 314 transition count 878
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1256 place count 310 transition count 824
Iterating global reduction 7 with 4 rules applied. Total rules applied 1260 place count 310 transition count 824
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1285 place count 310 transition count 799
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1311 place count 310 transition count 773
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1322 place count 299 transition count 751
Iterating global reduction 8 with 11 rules applied. Total rules applied 1333 place count 299 transition count 751
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1344 place count 288 transition count 651
Iterating global reduction 8 with 11 rules applied. Total rules applied 1355 place count 288 transition count 651
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1366 place count 288 transition count 640
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1367 place count 287 transition count 639
Applied a total of 1367 rules in 114 ms. Remains 287 /1243 variables (removed 956) and now considering 639/2069 (removed 1430) transitions.
[2025-05-31 05:06:29] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
// Phase 1: matrix 618 rows 287 cols
[2025-05-31 05:06:29] [INFO ] Computed 88 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:06:29] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-31 05:06:29] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
[2025-05-31 05:06:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:06:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 05:06:29] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:06:29] [INFO ] Redundant transitions in 5 ms returned []
Running 582 sub problems to find dead transitions.
[2025-05-31 05:06:29] [INFO ] Flow matrix only has 618 transitions (discarded 21 similar events)
[2025-05-31 05:06:29] [INFO ] Invariant cache hit.
[2025-05-31 05:06:29] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 617/904 variables, 287/375 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/904 variables, 38/413 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/905 variables, and 413 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 287/287 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 78/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 617/904 variables, 287/375 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/904 variables, 38/413 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 582/995 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/905 variables, and 995 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 287/287 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 287/1243 places, 639/2069 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60729 ms. Remains : 287/1243 places, 639/2069 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-14 finished in 60788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0&&X(p1)) U p2)))'
Support contains 4 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 2069/2069 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1225 transition count 2051
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1225 transition count 2051
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1220 transition count 2046
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1220 transition count 2046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1219 transition count 2045
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1219 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1218 transition count 2044
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1218 transition count 2044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1217 transition count 2043
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1217 transition count 2043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1216 transition count 2042
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1216 transition count 2042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1215 transition count 2041
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1215 transition count 2041
Applied a total of 56 rules in 245 ms. Remains 1215 /1243 variables (removed 28) and now considering 2041/2069 (removed 28) transitions.
// Phase 1: matrix 2041 rows 1215 cols
[2025-05-31 05:07:30] [INFO ] Computed 88 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:07:30] [INFO ] Implicit Places using invariants in 431 ms returned []
[2025-05-31 05:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:07:31] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
Running 2040 sub problems to find dead transitions.
[2025-05-31 05:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1214/3256 variables, and 0 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1215 constraints, PredecessorRefiner: 2040/2040 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2040 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)timeout

(s1151 1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1214/3256 variables, and 0 constraints, problems are : Problem set: 0 solved, 2040 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/88 constraints, State Equation: 0/1215 constraints, PredecessorRefiner: 0/2040 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 2040 unsolved
Search for dead transitions found 0 dead transitions in 60486ms
Starting structural reductions in LTL mode, iteration 1 : 1215/1243 places, 2041/2069 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62117 ms. Remains : 1215/1243 places, 2041/2069 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 6482 steps with 0 reset in 31 ms.
FORMULA DLCround-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-15 finished in 62280 ms.
All properties solved by simple procedures.
Total runtime 910864 ms.

BK_STOP 1748668112071

--------------------
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="DLCround-PT-05b"
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 DLCround-PT-05b, 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 r072-tall-174860066900156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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