Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 660K 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 CloudReconfiguration-PT-308-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-308-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748589041017

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-308
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 07:10:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 07:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 07:10:42] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-05-30 07:10:42] [INFO ] Transformed 2585 places.
[2025-05-30 07:10:42] [INFO ] Transformed 3095 transitions.
[2025-05-30 07:10:42] [INFO ] Found NUPN structural information;
[2025-05-30 07:10:42] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudReconfiguration-PT-308-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 2068 transition count 2578
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 2068 transition count 2578
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1063 place count 2068 transition count 2549
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1302 place count 1829 transition count 2310
Iterating global reduction 1 with 239 rules applied. Total rules applied 1541 place count 1829 transition count 2310
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1629 place count 1741 transition count 2222
Iterating global reduction 1 with 88 rules applied. Total rules applied 1717 place count 1741 transition count 2222
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1734 place count 1741 transition count 2205
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1780 place count 1695 transition count 2159
Iterating global reduction 2 with 46 rules applied. Total rules applied 1826 place count 1695 transition count 2159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1834 place count 1695 transition count 2151
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1870 place count 1659 transition count 2111
Iterating global reduction 3 with 36 rules applied. Total rules applied 1906 place count 1659 transition count 2111
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1931 place count 1634 transition count 2086
Iterating global reduction 3 with 25 rules applied. Total rules applied 1956 place count 1634 transition count 2086
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1980 place count 1610 transition count 2062
Iterating global reduction 3 with 24 rules applied. Total rules applied 2004 place count 1610 transition count 2062
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2028 place count 1586 transition count 2038
Iterating global reduction 3 with 24 rules applied. Total rules applied 2052 place count 1586 transition count 2038
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2073 place count 1565 transition count 2004
Iterating global reduction 3 with 21 rules applied. Total rules applied 2094 place count 1565 transition count 2004
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2100 place count 1559 transition count 1995
Iterating global reduction 3 with 6 rules applied. Total rules applied 2106 place count 1559 transition count 1995
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2112 place count 1553 transition count 1987
Iterating global reduction 3 with 6 rules applied. Total rules applied 2118 place count 1553 transition count 1987
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2119 place count 1553 transition count 1986
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2121 place count 1551 transition count 1984
Iterating global reduction 4 with 2 rules applied. Total rules applied 2123 place count 1551 transition count 1984
Applied a total of 2123 rules in 1666 ms. Remains 1551 /2585 variables (removed 1034) and now considering 1984/3095 (removed 1111) transitions.
// Phase 1: matrix 1984 rows 1551 cols
[2025-05-30 07:10:44] [INFO ] Computed 4 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:10:44] [INFO ] Implicit Places using invariants in 489 ms returned []
[2025-05-30 07:10:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:10:45] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
Running 1983 sub problems to find dead transitions.
[2025-05-30 07:10: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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/3535 variables, and 4 constraints, problems are : Problem set: 0 solved, 1983 unsolved in 30080 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 1983/1983 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1983 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1550 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/3535 variables, and 4 constraints, problems are : Problem set: 0 solved, 1983 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1551 constraints, PredecessorRefiner: 0/1983 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60732ms problems are : Problem set: 0 solved, 1983 unsolved
Search for dead transitions found 0 dead transitions in 60859ms
Starting structural reductions in LTL mode, iteration 1 : 1551/2585 places, 1984/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64108 ms. Remains : 1551/2585 places, 1984/3095 transitions.
Support contains 28 out of 1551 places after structural reductions.
[2025-05-30 07:11:47] [INFO ] Flatten gal took : 121 ms
[2025-05-30 07:11:47] [INFO ] Flatten gal took : 72 ms
[2025-05-30 07:11:47] [INFO ] Input system was already deterministic with 1984 transitions.
Support contains 27 out of 1551 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (280 resets) in 1669 ms. (23 steps per ms) remains 14/26 properties
BEST_FIRST walk for 40003 steps (77 resets) in 339 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (79 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 136 ms. (292 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (78 resets) in 190 ms. (209 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (76 resets) in 141 ms. (281 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (79 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (74 resets) in 99 ms. (400 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (73 resets) in 173 ms. (229 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (73 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (75 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (80 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
[2025-05-30 07:11:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1527/1540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1540 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1974/3514 variables, 1540/1544 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3514 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/3516 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3516 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/3518 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3518 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 2/3520 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3520/3535 variables, and 1547 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1543/1551 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1527/1540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1540 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1974/3514 variables, 1540/1544 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3514 variables, 10/1554 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3514 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/3516 variables, 1/1555 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3516 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/3518 variables, 1/1556 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3518 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3520 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3520 variables, 0/1557 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/3522 variables, 1/1558 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3522/3535 variables, and 1558 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1544/1551 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10039ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Graph (trivial) has 1861 edges and 1551 vertex of which 672 / 1551 are part of one of the 61 SCC in 9 ms
Free SCC test removed 611 places
Drop transitions (Empty/Sink Transition effects.) removed 768 transitions
Reduce isomorphic transitions removed 768 transitions.
Graph (complete) has 1390 edges and 940 vertex of which 931 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 516 transitions
Trivial Post-agglo rules discarded 516 transitions
Performed 516 trivial Post agglomeration. Transition count delta: 516
Iterating post reduction 0 with 522 rules applied. Total rules applied 524 place count 931 transition count 690
Reduce places removed 516 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 576 rules applied. Total rules applied 1100 place count 415 transition count 630
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 39 rules applied. Total rules applied 1139 place count 378 transition count 628
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1142 place count 377 transition count 626
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1146 place count 376 transition count 623
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 8 rules applied. Total rules applied 1154 place count 374 transition count 617
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1161 place count 368 transition count 616
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 47 Pre rules applied. Total rules applied 1161 place count 368 transition count 569
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 1255 place count 321 transition count 569
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1267 place count 309 transition count 551
Iterating global reduction 7 with 12 rules applied. Total rules applied 1279 place count 309 transition count 551
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 1282 place count 309 transition count 548
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1285 place count 306 transition count 548
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1291 place count 300 transition count 542
Iterating global reduction 9 with 6 rules applied. Total rules applied 1297 place count 300 transition count 542
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1303 place count 300 transition count 536
Performed 149 Post agglomeration using F-continuation condition with reduction of 90 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 10 with 298 rules applied. Total rules applied 1601 place count 151 transition count 297
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 1624 place count 151 transition count 274
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1627 place count 148 transition count 271
Iterating global reduction 11 with 3 rules applied. Total rules applied 1630 place count 148 transition count 271
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1656 place count 135 transition count 255
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1670 place count 135 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1672 place count 134 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1675 place count 134 transition count 237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1677 place count 133 transition count 236
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1678 place count 133 transition count 235
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 1746 place count 99 transition count 266
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 14 with 34 rules applied. Total rules applied 1780 place count 99 transition count 232
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 1800 place count 79 transition count 199
Iterating global reduction 15 with 20 rules applied. Total rules applied 1820 place count 79 transition count 199
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1830 place count 79 transition count 189
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 1835 place count 74 transition count 179
Iterating global reduction 16 with 5 rules applied. Total rules applied 1840 place count 74 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 1844 place count 74 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1865 place count 74 transition count 154
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1866 place count 73 transition count 151
Iterating global reduction 17 with 1 rules applied. Total rules applied 1867 place count 73 transition count 151
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1868 place count 72 transition count 150
Iterating global reduction 17 with 1 rules applied. Total rules applied 1869 place count 72 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1870 place count 72 transition count 149
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 18 with 2 rules applied. Total rules applied 1872 place count 71 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1873 place count 71 transition count 147
Free-agglomeration rule applied 3 times.
Iterating global reduction 18 with 3 rules applied. Total rules applied 1876 place count 71 transition count 144
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1879 place count 68 transition count 144
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1881 place count 68 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1882 place count 68 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1883 place count 67 transition count 142
Applied a total of 1883 rules in 170 ms. Remains 67 /1551 variables (removed 1484) and now considering 142/1984 (removed 1842) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 67/1551 places, 142/1984 transitions.
RANDOM walk for 40000 steps (968 resets) in 290 ms. (137 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40001 steps (9 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2025-05-30 07:11:58] [INFO ] Flow matrix only has 134 transitions (discarded 8 similar events)
// Phase 1: matrix 134 rows 67 cols
[2025-05-30 07:11:58] [INFO ] Computed 3 invariants in 1 ms
[2025-05-30 07:11:58] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/64 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/135 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/141 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 169/201 variables, and 55 constraints, problems are : Problem set: 1 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 51/67 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CloudReconfiguration-PT-308-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2163 edges and 1551 vertex of which 1542 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.24 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 U (p1||G(p0))))))'
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Graph (trivial) has 1887 edges and 1551 vertex of which 696 / 1551 are part of one of the 63 SCC in 4 ms
Free SCC test removed 633 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1422 edges and 918 vertex of which 909 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 908 transition count 744
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 525 rules applied. Total rules applied 1026 place count 409 transition count 718
Reduce places removed 13 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 18 rules applied. Total rules applied 1044 place count 396 transition count 713
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1049 place count 391 transition count 713
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1049 place count 391 transition count 668
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1139 place count 346 transition count 668
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1157 place count 328 transition count 639
Iterating global reduction 4 with 18 rules applied. Total rules applied 1175 place count 328 transition count 639
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1178 place count 328 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1181 place count 325 transition count 636
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1192 place count 314 transition count 621
Iterating global reduction 6 with 11 rules applied. Total rules applied 1203 place count 314 transition count 621
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 1211 place count 314 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1212 place count 313 transition count 613
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1215 place count 310 transition count 607
Iterating global reduction 8 with 3 rules applied. Total rules applied 1218 place count 310 transition count 607
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1220 place count 308 transition count 603
Iterating global reduction 8 with 2 rules applied. Total rules applied 1222 place count 308 transition count 603
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1224 place count 306 transition count 599
Iterating global reduction 8 with 2 rules applied. Total rules applied 1226 place count 306 transition count 599
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1228 place count 304 transition count 595
Iterating global reduction 8 with 2 rules applied. Total rules applied 1230 place count 304 transition count 595
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1232 place count 302 transition count 591
Iterating global reduction 8 with 2 rules applied. Total rules applied 1234 place count 302 transition count 591
Performed 139 Post agglomeration using F-continuation condition with reduction of 77 identical transitions.
Deduced a syphon composed of 139 places in 1 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 8 with 278 rules applied. Total rules applied 1512 place count 163 transition count 375
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 1531 place count 163 transition count 356
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1537 place count 157 transition count 344
Iterating global reduction 9 with 6 rules applied. Total rules applied 1543 place count 157 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1544 place count 157 transition count 343
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1570 place count 144 transition count 327
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1583 place count 144 transition count 314
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1584 place count 143 transition count 310
Iterating global reduction 11 with 1 rules applied. Total rules applied 1585 place count 143 transition count 310
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 11 with 2 rules applied. Total rules applied 1587 place count 142 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1589 place count 142 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1623 place count 125 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1640 place count 125 transition count 324
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1649 place count 116 transition count 306
Iterating global reduction 13 with 9 rules applied. Total rules applied 1658 place count 116 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1664 place count 116 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1700 place count 116 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1701 place count 115 transition count 263
Applied a total of 1701 rules in 143 ms. Remains 115 /1551 variables (removed 1436) and now considering 263/1984 (removed 1721) transitions.
[2025-05-30 07:11:59] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 115 cols
[2025-05-30 07:11:59] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:11:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 07:11:59] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2025-05-30 07:11:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:11:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 07:11:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 180 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1551 places, 263/1984 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 261
Applied a total of 2 rules in 10 ms. Remains 111 /113 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2025-05-30 07:11:59] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 111 cols
[2025-05-30 07:11:59] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:11:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 07:11:59] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2025-05-30 07:11:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:11:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 07:11:59] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1551 places, 261/1984 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 472 ms. Remains : 111/1551 places, 261/1984 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-308-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLFireability-01 finished in 728 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 U !p1)))'
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Graph (trivial) has 1884 edges and 1551 vertex of which 690 / 1551 are part of one of the 62 SCC in 3 ms
Free SCC test removed 628 places
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Graph (complete) has 1427 edges and 923 vertex of which 914 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 913 transition count 745
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 529 rules applied. Total rules applied 1034 place count 410 transition count 719
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 1050 place count 397 transition count 716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1053 place count 394 transition count 716
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1053 place count 394 transition count 670
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1145 place count 348 transition count 670
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1163 place count 330 transition count 641
Iterating global reduction 4 with 18 rules applied. Total rules applied 1181 place count 330 transition count 641
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1184 place count 330 transition count 638
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1187 place count 327 transition count 638
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1198 place count 316 transition count 623
Iterating global reduction 6 with 11 rules applied. Total rules applied 1209 place count 316 transition count 623
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 1217 place count 316 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1218 place count 315 transition count 615
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1221 place count 312 transition count 609
Iterating global reduction 8 with 3 rules applied. Total rules applied 1224 place count 312 transition count 609
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1226 place count 310 transition count 605
Iterating global reduction 8 with 2 rules applied. Total rules applied 1228 place count 310 transition count 605
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1230 place count 308 transition count 601
Iterating global reduction 8 with 2 rules applied. Total rules applied 1232 place count 308 transition count 601
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1234 place count 306 transition count 597
Iterating global reduction 8 with 2 rules applied. Total rules applied 1236 place count 306 transition count 597
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1238 place count 304 transition count 593
Iterating global reduction 8 with 2 rules applied. Total rules applied 1240 place count 304 transition count 593
Performed 140 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 8 with 280 rules applied. Total rules applied 1520 place count 164 transition count 371
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1534 place count 164 transition count 357
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1540 place count 158 transition count 345
Iterating global reduction 9 with 6 rules applied. Total rules applied 1546 place count 158 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1547 place count 158 transition count 344
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1573 place count 145 transition count 328
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1586 place count 145 transition count 315
Performed 19 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 38 rules applied. Total rules applied 1624 place count 126 transition count 349
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1643 place count 126 transition count 330
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1652 place count 117 transition count 312
Iterating global reduction 12 with 9 rules applied. Total rules applied 1661 place count 117 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1667 place count 117 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1703 place count 117 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1704 place count 116 transition count 269
Applied a total of 1704 rules in 113 ms. Remains 116 /1551 variables (removed 1435) and now considering 269/1984 (removed 1715) transitions.
[2025-05-30 07:12:00] [INFO ] Flow matrix only has 214 transitions (discarded 55 similar events)
// Phase 1: matrix 214 rows 116 cols
[2025-05-30 07:12:00] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:12:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-30 07:12:00] [INFO ] Flow matrix only has 214 transitions (discarded 55 similar events)
[2025-05-30 07:12:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:12:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 07:12:00] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [10, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 174 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1551 places, 269/1984 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 267
Applied a total of 2 rules in 9 ms. Remains 112 /114 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2025-05-30 07:12:00] [INFO ] Flow matrix only has 212 transitions (discarded 55 similar events)
// Phase 1: matrix 212 rows 112 cols
[2025-05-30 07:12:00] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:12:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 07:12:00] [INFO ] Flow matrix only has 212 transitions (discarded 55 similar events)
[2025-05-30 07:12:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:12:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 07:12:00] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1551 places, 267/1984 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 429 ms. Remains : 112/1551 places, 267/1984 transitions.
Stuttering acceptance computed with spot in 112 ms :[p1, true, p1]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-02
Entered a terminal (fully accepting) state of product in 14770 steps with 1272 reset in 54 ms.
FORMULA CloudReconfiguration-PT-308-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLFireability-02 finished in 615 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) U X(X(X(X((p1||G(p2)))))))))'
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1541 transition count 1974
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1541 transition count 1974
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 1535 transition count 1967
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 1535 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1535 transition count 1966
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 1531 transition count 1962
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 1531 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 1528 transition count 1959
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 1528 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1525 transition count 1956
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1525 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 1522 transition count 1952
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 1522 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 1519 transition count 1947
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 1516 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 1516 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 1514 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1512 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 1512 transition count 1935
Applied a total of 81 rules in 610 ms. Remains 1512 /1551 variables (removed 39) and now considering 1935/1984 (removed 49) transitions.
// Phase 1: matrix 1935 rows 1512 cols
[2025-05-30 07:12:01] [INFO ] Computed 4 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:12:01] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-30 07:12:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:12:02] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2025-05-30 07:12:02] [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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1551 places, 1935/1984 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62206 ms. Remains : 1512/1551 places, 1935/1984 transitions.
Stuttering acceptance computed with spot in 669 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-03
Product exploration explored 100000 steps with 18166 reset in 289 ms.
Product exploration explored 100000 steps with 18177 reset in 356 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2112 edges and 1512 vertex of which 1503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 17 states, 26 edges and 3 AP (stutter sensitive) to 17 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 692 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (288 resets) in 476 ms. (83 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40003 steps (78 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (83 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (72 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (79 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (74 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
[2025-05-30 07:13:05] [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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 696/699 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 802/1501 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3426 variables, 1501/1505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5036ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1512/1512 places, 1935/1935 transitions.
Graph (trivial) has 1842 edges and 1512 vertex of which 679 / 1512 are part of one of the 62 SCC in 3 ms
Free SCC test removed 617 places
Drop transitions (Empty/Sink Transition effects.) removed 778 transitions
Reduce isomorphic transitions removed 778 transitions.
Graph (complete) has 1329 edges and 895 vertex of which 886 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 886 transition count 650
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 555 rules applied. Total rules applied 1060 place count 390 transition count 591
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1100 place count 352 transition count 589
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1103 place count 351 transition count 587
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1107 place count 350 transition count 584
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1109 place count 348 transition count 584
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 50 Pre rules applied. Total rules applied 1109 place count 348 transition count 534
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 1209 place count 298 transition count 534
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1220 place count 287 transition count 518
Iterating global reduction 6 with 11 rules applied. Total rules applied 1231 place count 287 transition count 518
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 1234 place count 287 transition count 515
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1237 place count 284 transition count 515
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1244 place count 277 transition count 507
Iterating global reduction 8 with 7 rules applied. Total rules applied 1251 place count 277 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1257 place count 277 transition count 501
Performed 143 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 9 with 286 rules applied. Total rules applied 1543 place count 134 transition count 262
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1560 place count 134 transition count 245
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1563 place count 131 transition count 242
Iterating global reduction 10 with 3 rules applied. Total rules applied 1566 place count 131 transition count 242
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1592 place count 118 transition count 226
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 1608 place count 118 transition count 210
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 11 with 2 rules applied. Total rules applied 1610 place count 117 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1612 place count 117 transition count 207
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 12 with 2 rules applied. Total rules applied 1614 place count 116 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1616 place count 116 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1618 place count 115 transition count 203
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1619 place count 115 transition count 202
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 1687 place count 81 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 14 with 38 rules applied. Total rules applied 1725 place count 81 transition count 195
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 1746 place count 60 transition count 161
Iterating global reduction 15 with 21 rules applied. Total rules applied 1767 place count 60 transition count 161
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 1779 place count 60 transition count 149
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 1785 place count 54 transition count 137
Iterating global reduction 16 with 6 rules applied. Total rules applied 1791 place count 54 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1797 place count 54 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 17 with 10 rules applied. Total rules applied 1807 place count 54 transition count 121
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1808 place count 53 transition count 118
Iterating global reduction 17 with 1 rules applied. Total rules applied 1809 place count 53 transition count 118
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1810 place count 52 transition count 117
Iterating global reduction 17 with 1 rules applied. Total rules applied 1811 place count 52 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1812 place count 52 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1813 place count 52 transition count 115
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 1817 place count 52 transition count 111
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1823 place count 48 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1824 place count 48 transition count 108
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1826 place count 48 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1827 place count 48 transition count 107
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1828 place count 47 transition count 106
Iterating global reduction 19 with 1 rules applied. Total rules applied 1829 place count 47 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1830 place count 46 transition count 105
Applied a total of 1830 rules in 72 ms. Remains 46 /1512 variables (removed 1466) and now considering 105/1935 (removed 1830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 46/1512 places, 105/1935 transitions.
RANDOM walk for 2409 steps (44 resets) in 15 ms. (150 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0 (NOT p2)))), (F p0), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 426 ms. Reduced automaton from 17 states, 26 edges and 3 AP (stutter sensitive) to 17 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 683 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 695 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 1935/1935 transitions.
Applied a total of 0 rules in 71 ms. Remains 1512 /1512 variables (removed 0) and now considering 1935/1935 (removed 0) transitions.
[2025-05-30 07:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:13:12] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-30 07:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:13:13] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2025-05-30 07:13:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Finished structural reductions in LTL mode , in 1 iterations and 61704 ms. Remains : 1512/1512 places, 1935/1935 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2112 edges and 1512 vertex of which 1503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.19 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 17 states, 26 edges and 3 AP (stutter sensitive) to 17 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 705 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (291 resets) in 258 ms. (154 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (75 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (77 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (78 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (73 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (80 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (72 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (74 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (80 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (74 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 286381 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 10
Probabilistic random walk after 286381 steps, saw 70532 distinct states, run finished after 3007 ms. (steps per millisecond=95 ) properties seen :0
[2025-05-30 07:14:18] [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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 696/699 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 802/1501 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3426 variables, 1501/1505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3436/3447 variables, and 1510 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1512 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 696/699 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 802/1501 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1925/3426 variables, 1501/1505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 10/1515 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3426 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/3428 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3428 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3430 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3430 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/3432 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3432 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 2/3434 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3434/3447 variables, and 1519 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5007 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1505/1512 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10031ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1512/1512 places, 1935/1935 transitions.
Graph (trivial) has 1842 edges and 1512 vertex of which 679 / 1512 are part of one of the 62 SCC in 1 ms
Free SCC test removed 617 places
Drop transitions (Empty/Sink Transition effects.) removed 778 transitions
Reduce isomorphic transitions removed 778 transitions.
Graph (complete) has 1329 edges and 895 vertex of which 886 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 886 transition count 650
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 555 rules applied. Total rules applied 1060 place count 390 transition count 591
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1100 place count 352 transition count 589
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1103 place count 351 transition count 587
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1107 place count 350 transition count 584
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1109 place count 348 transition count 584
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 50 Pre rules applied. Total rules applied 1109 place count 348 transition count 534
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 1209 place count 298 transition count 534
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1220 place count 287 transition count 518
Iterating global reduction 6 with 11 rules applied. Total rules applied 1231 place count 287 transition count 518
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 1234 place count 287 transition count 515
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1237 place count 284 transition count 515
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1244 place count 277 transition count 507
Iterating global reduction 8 with 7 rules applied. Total rules applied 1251 place count 277 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1257 place count 277 transition count 501
Performed 143 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 9 with 286 rules applied. Total rules applied 1543 place count 134 transition count 262
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1560 place count 134 transition count 245
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1563 place count 131 transition count 242
Iterating global reduction 10 with 3 rules applied. Total rules applied 1566 place count 131 transition count 242
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1592 place count 118 transition count 226
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 1608 place count 118 transition count 210
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 11 with 2 rules applied. Total rules applied 1610 place count 117 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1612 place count 117 transition count 207
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 12 with 2 rules applied. Total rules applied 1614 place count 116 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1616 place count 116 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1618 place count 115 transition count 203
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1619 place count 115 transition count 202
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 1687 place count 81 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 14 with 38 rules applied. Total rules applied 1725 place count 81 transition count 195
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 1746 place count 60 transition count 161
Iterating global reduction 15 with 21 rules applied. Total rules applied 1767 place count 60 transition count 161
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 1779 place count 60 transition count 149
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 1785 place count 54 transition count 137
Iterating global reduction 16 with 6 rules applied. Total rules applied 1791 place count 54 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1797 place count 54 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 17 with 10 rules applied. Total rules applied 1807 place count 54 transition count 121
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1808 place count 53 transition count 118
Iterating global reduction 17 with 1 rules applied. Total rules applied 1809 place count 53 transition count 118
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1810 place count 52 transition count 117
Iterating global reduction 17 with 1 rules applied. Total rules applied 1811 place count 52 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1812 place count 52 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1813 place count 52 transition count 115
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 1817 place count 52 transition count 111
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1823 place count 48 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1824 place count 48 transition count 108
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1826 place count 48 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1827 place count 48 transition count 107
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1828 place count 47 transition count 106
Iterating global reduction 19 with 1 rules applied. Total rules applied 1829 place count 47 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1830 place count 46 transition count 105
Applied a total of 1830 rules in 57 ms. Remains 46 /1512 variables (removed 1466) and now considering 105/1935 (removed 1830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 46/1512 places, 105/1935 transitions.
RANDOM walk for 4957 steps (83 resets) in 58 ms. (84 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p0 (NOT p2)))), (F p0), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 369 ms. Reduced automaton from 17 states, 26 edges and 3 AP (stutter sensitive) to 17 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 748 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 743 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 736 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 18187 reset in 197 ms.
Product exploration explored 100000 steps with 18195 reset in 201 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 759 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1512/1512 places, 1935/1935 transitions.
Graph (trivial) has 1842 edges and 1512 vertex of which 679 / 1512 are part of one of the 62 SCC in 2 ms
Free SCC test removed 617 places
Ensure Unique test removed 715 transitions
Reduce isomorphic transitions removed 715 transitions.
Graph (complete) has 1391 edges and 895 vertex of which 886 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 482 rules applied. Total rules applied 484 place count 886 transition count 1215
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 14 rules applied. Total rules applied 498 place count 886 transition count 1202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 2 rules applied. Total rules applied 500 place count 886 transition count 1201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 501 place count 886 transition count 1200
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 501 place count 886 transition count 1214
Deduced a syphon composed of 507 places in 1 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 524 place count 886 transition count 1214
Discarding 290 places :
Symmetric choice reduction at 4 with 290 rule applications. Total rules 814 place count 596 transition count 914
Deduced a syphon composed of 233 places in 1 ms
Iterating global reduction 4 with 290 rules applied. Total rules applied 1104 place count 596 transition count 914
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1116 place count 584 transition count 898
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 1128 place count 584 transition count 898
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1134 place count 584 transition count 892
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1146 place count 572 transition count 880
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 12 rules applied. Total rules applied 1158 place count 572 transition count 880
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1160 place count 570 transition count 876
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1162 place count 570 transition count 876
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1164 place count 568 transition count 872
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1166 place count 568 transition count 872
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1170 place count 564 transition count 868
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 1174 place count 564 transition count 868
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1175 place count 563 transition count 866
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1176 place count 563 transition count 866
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1177 place count 562 transition count 864
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1178 place count 562 transition count 864
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1180 place count 560 transition count 861
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1182 place count 560 transition count 861
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1183 place count 559 transition count 860
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1184 place count 559 transition count 860
Performed 108 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 325 places in 0 ms
Iterating global reduction 5 with 108 rules applied. Total rules applied 1292 place count 559 transition count 935
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 1336 place count 559 transition count 891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1336 place count 559 transition count 891
Deduced a syphon composed of 326 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 1337 place count 559 transition count 891
Discarding 104 places :
Symmetric choice reduction at 6 with 104 rule applications. Total rules 1441 place count 455 transition count 777
Deduced a syphon composed of 232 places in 1 ms
Iterating global reduction 6 with 104 rules applied. Total rules applied 1545 place count 455 transition count 777
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1551 place count 449 transition count 768
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1557 place count 449 transition count 768
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1564 place count 449 transition count 768
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1570 place count 449 transition count 762
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1585 place count 434 transition count 743
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1600 place count 434 transition count 743
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1606 place count 434 transition count 737
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1610 place count 430 transition count 733
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1614 place count 430 transition count 733
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1617 place count 430 transition count 733
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1623 place count 430 transition count 727
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1626 place count 427 transition count 724
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1629 place count 427 transition count 724
Performed 73 Post agglomeration using F-continuation condition with reduction of 133 identical transitions.
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 9 with 73 rules applied. Total rules applied 1702 place count 427 transition count 1068
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 9 with 130 rules applied. Total rules applied 1832 place count 427 transition count 938
Discarding 130 places :
Symmetric choice reduction at 10 with 130 rule applications. Total rules 1962 place count 297 transition count 587
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 10 with 130 rules applied. Total rules applied 2092 place count 297 transition count 587
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 2105 place count 297 transition count 574
Discarding 24 places :
Symmetric choice reduction at 11 with 24 rule applications. Total rules 2129 place count 273 transition count 524
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 11 with 24 rules applied. Total rules applied 2153 place count 273 transition count 524
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2156 place count 273 transition count 574
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2159 place count 270 transition count 546
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2162 place count 270 transition count 546
Deduced a syphon composed of 145 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 11 with 51 rules applied. Total rules applied 2213 place count 270 transition count 495
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2217 place count 266 transition count 491
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2221 place count 266 transition count 491
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2224 place count 266 transition count 551
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2227 place count 263 transition count 536
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2230 place count 263 transition count 536
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 2230 rules in 302 ms. Remains 263 /1512 variables (removed 1249) and now considering 536/1935 (removed 1399) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:14:32] [INFO ] Redundant transitions in 35 ms returned []
Running 535 sub problems to find dead transitions.
[2025-05-30 07:14:32] [INFO ] Flow matrix only has 481 transitions (discarded 55 similar events)
// Phase 1: matrix 481 rows 263 cols
[2025-05-30 07:14:32] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 07:14:32] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
At refinement iteration 1 (OVERLAPS) 480/742 variables, 262/262 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 4/266 constraints. Problems are: Problem set: 256 solved, 279 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/742 variables, 0/266 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 1/743 variables, 1/267 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 0/267 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 1/744 variables, 1/268 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/268 constraints. Problems are: Problem set: 256 solved, 279 unsolved
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 Real declared 744/744 variables, and 268 constraints, problems are : Problem set: 256 solved, 279 unsolved in 30013 ms.
Refiners :[State Equation: 263/263 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 256 solved, 279 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 477/598 variables, 121/121 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 4/125 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/598 variables, 279/404 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/404 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 145/743 variables, 142/546 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 0/546 constraints. Problems are: Problem set: 256 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 1/744 variables, 1/547 constraints. Problems are: Problem set: 256 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 744/744 variables, and 547 constraints, problems are : Problem set: 256 solved, 279 unsolved in 30021 ms.
Refiners :[State Equation: 263/263 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 279/535 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 256 solved, 279 unsolved
Search for dead transitions found 256 dead transitions in 60141ms
Found 256 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 256 transitions
Dead transitions reduction (with SMT) removed 256 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 263/1512 places, 280/1935 transitions.
Graph (complete) has 432 edges and 263 vertex of which 122 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.1 ms
Discarding 141 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 122 /263 variables (removed 141) and now considering 280/280 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/1512 places, 280/1935 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60490 ms. Remains : 122/1512 places, 280/1935 transitions.
Built C files in :
/tmp/ltsmin5342134002166651492
[2025-05-30 07:15:33] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5342134002166651492
Running compilation step : cd /tmp/ltsmin5342134002166651492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5342134002166651492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5342134002166651492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 1935/1935 transitions.
Applied a total of 0 rules in 43 ms. Remains 1512 /1512 variables (removed 0) and now considering 1935/1935 (removed 0) transitions.
// Phase 1: matrix 1935 rows 1512 cols
[2025-05-30 07:15:36] [INFO ] Computed 4 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:15:36] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-05-30 07:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:15:37] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2025-05-30 07:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in LTL mode , in 1 iterations and 61599 ms. Remains : 1512/1512 places, 1935/1935 transitions.
Built C files in :
/tmp/ltsmin14252018293438028853
[2025-05-30 07:16:37] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14252018293438028853
Running compilation step : cd /tmp/ltsmin14252018293438028853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14252018293438028853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14252018293438028853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 07:16:40] [INFO ] Flatten gal took : 52 ms
[2025-05-30 07:16:41] [INFO ] Flatten gal took : 47 ms
[2025-05-30 07:16:41] [INFO ] Time to serialize gal into /tmp/LTL2499966506089787902.gal : 16 ms
[2025-05-30 07:16:41] [INFO ] Time to serialize properties into /tmp/LTL13732970766970348171.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2499966506089787902.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10682721630089235661.hoa' '-atoms' '/tmp/LTL13732970766970348171.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(p474==1)"))U(X(X(X(X(("(p206!=1)")||(G("(p1040!=1)"))))))))))
Formula 0 simplified : F(G!"(p474==1)" R XXXX(!"(p206!=1)" & F!"(p1040!=1)"))
Detected timeout of ITS tools.
[2025-05-30 07:17:11] [INFO ] Flatten gal took : 39 ms
[2025-05-30 07:17:11] [INFO ] Applying decomposition
[2025-05-30 07:17:11] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11747986819072177170.txt' '-o' '/tmp/graph11747986819072177170.bin' '-w' '/tmp/graph11747986819072177170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11747986819072177170.bin' '-l' '-1' '-v' '-w' '/tmp/graph11747986819072177170.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:17:11] [INFO ] Decomposing Gal with order
[2025-05-30 07:17:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:17:11] [INFO ] Removed a total of 511 redundant transitions.
[2025-05-30 07:17:11] [INFO ] Flatten gal took : 132 ms
[2025-05-30 07:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 35 ms.
[2025-05-30 07:17:12] [INFO ] Time to serialize gal into /tmp/LTL10639828770901515006.gal : 21 ms
[2025-05-30 07:17:12] [INFO ] Time to serialize properties into /tmp/LTL2154791952716202459.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10639828770901515006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2154791952716202459.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("(i6.u86.p474==1)"))U(X(X(X(X(("(i2.u77.p206!=1)")||(G("(i16.i1.i0.u243.p1040!=1)"))))))))))
Formula 0 simplified : F(G!"(i6.u86.p474==1)" R XXXX(!"(i2.u77.p206!=1)" & F!"(i16.i1.i0.u243.p1040!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t26, t200, t229, t281, t312, t341, t390, t461, t514, t708, t761, t794, t823, t872, t943, t994...2065
Computing Next relation with stutter on 140576 deadlock states
43 unique states visited
43 strongly connected components in search stack
44 transitions explored
43 items max in DFS search stack
616 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.36837,218376,1,0,389341,10465,22791,682171,486,71300,1359636
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-308-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-308-LTLFireability-03 finished in 318812 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) U X(X(X((G(p1)||F(G(p2))))))))'
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1539 transition count 1972
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1539 transition count 1972
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1531 transition count 1963
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1531 transition count 1963
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 1531 transition count 1961
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 1527 transition count 1957
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 1527 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 1524 transition count 1954
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 1524 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 1521 transition count 1951
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 1521 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 1518 transition count 1947
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 1518 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 1515 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 1515 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 1512 transition count 1938
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 1510 transition count 1935
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1509 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1508 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1508 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 1508 transition count 1930
Applied a total of 90 rules in 705 ms. Remains 1508 /1551 variables (removed 43) and now considering 1930/1984 (removed 54) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2025-05-30 07:17:20] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:17:20] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-05-30 07:17:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:17:21] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 07:17:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
(s615 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
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 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 1)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1551 places, 1930/1984 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62421 ms. Remains : 1508/1551 places, 1930/1984 transitions.
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-04
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-308-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLFireability-04 finished in 62812 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((G(p0)||(p0&&F(p1))))))'
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1539 transition count 1972
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1539 transition count 1972
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1531 transition count 1963
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1531 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1531 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 1527 transition count 1958
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 1527 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 1524 transition count 1955
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 1524 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1521 transition count 1952
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1521 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 1518 transition count 1948
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 1518 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 1515 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 1515 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 1512 transition count 1939
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 1512 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 1510 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 1510 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1508 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1508 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 1508 transition count 1931
Applied a total of 89 rules in 656 ms. Remains 1508 /1551 variables (removed 43) and now considering 1931/1984 (removed 53) transitions.
// Phase 1: matrix 1931 rows 1508 cols
[2025-05-30 07:18:22] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:18:23] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-30 07:18:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:18:24] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2025-05-30 07:18:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3439 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3439 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1551 places, 1931/1984 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62204 ms. Remains : 1508/1551 places, 1931/1984 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-308-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLFireability-05 finished in 62470 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(F(p0))||(X(F(p0))&&(X(X(X(p1))) U ((!p2&&X(X(X(p1))))||X(X(X(G(p1))))))))))'
Support contains 4 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1540 transition count 1973
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1540 transition count 1973
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1533 transition count 1965
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1533 transition count 1965
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 1533 transition count 1963
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 1531 transition count 1961
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 1531 transition count 1961
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 1530 transition count 1960
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 1530 transition count 1960
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 1529 transition count 1959
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 1529 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 1528 transition count 1958
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 1528 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 1527 transition count 1956
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 1527 transition count 1956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 1526 transition count 1954
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 1526 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 1525 transition count 1953
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 1525 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 1525 transition count 1952
Applied a total of 55 rules in 558 ms. Remains 1525 /1551 variables (removed 26) and now considering 1952/1984 (removed 32) transitions.
// Phase 1: matrix 1952 rows 1525 cols
[2025-05-30 07:19:25] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:19:25] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 07:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:19:26] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-30 07:19:26] [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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1524/3477 variables, and 4 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
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 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1524/3477 variables, and 4 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60406ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Starting structural reductions in LTL mode, iteration 1 : 1525/1551 places, 1952/1984 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62067 ms. Remains : 1525/1551 places, 1952/1984 transitions.
Stuttering acceptance computed with spot in 644 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-09
Product exploration explored 100000 steps with 36391 reset in 295 ms.
Product exploration explored 100000 steps with 36311 reset in 322 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2131 edges and 1525 vertex of which 1516 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 139 ms. Reduced automaton from 14 states, 31 edges and 3 AP (stutter sensitive) to 14 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 529 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (291 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (77 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (75 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (77 resets) in 56 ms. (701 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (75 resets) in 43 ms. (909 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (73 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (76 resets) in 36 ms. (1081 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (75 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
[2025-05-30 07:20:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1238 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 276/1514 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1514 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1942/3456 variables, 1514/1518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3456 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/3458 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3458 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/3460 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3460 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/3462 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3462 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/3464 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3464 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/3466 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3466 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/3468 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3468/3477 variables, and 1524 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1520/1525 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1238 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 276/1514 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1514 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1942/3456 variables, 1514/1518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3456 variables, 7/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3456 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/3458 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3458 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/3460 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3460 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/3462 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3462 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 2/3464 variables, 1/1529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3464 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/3466 variables, 1/1530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3466/3477 variables, and 1530 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1525 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10040ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1525/1525 places, 1952/1952 transitions.
Graph (trivial) has 1854 edges and 1525 vertex of which 693 / 1525 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1330 edges and 895 vertex of which 886 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 886 transition count 646
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 559 rules applied. Total rules applied 1067 place count 387 transition count 586
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1107 place count 348 transition count 585
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1108 place count 347 transition count 585
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1108 place count 347 transition count 537
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1204 place count 299 transition count 537
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1215 place count 288 transition count 521
Iterating global reduction 4 with 11 rules applied. Total rules applied 1226 place count 288 transition count 521
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1229 place count 288 transition count 518
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1232 place count 285 transition count 518
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1240 place count 277 transition count 508
Iterating global reduction 6 with 8 rules applied. Total rules applied 1248 place count 277 transition count 508
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1254 place count 277 transition count 502
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1256 place count 275 transition count 490
Iterating global reduction 7 with 2 rules applied. Total rules applied 1258 place count 275 transition count 490
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1259 place count 275 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1260 place count 274 transition count 489
Performed 145 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 9 with 290 rules applied. Total rules applied 1550 place count 129 transition count 250
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 17 rules applied. Total rules applied 1567 place count 129 transition count 233
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1569 place count 128 transition count 232
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1572 place count 125 transition count 229
Iterating global reduction 11 with 3 rules applied. Total rules applied 1575 place count 125 transition count 229
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1599 place count 113 transition count 214
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1611 place count 113 transition count 202
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1677 place count 80 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 12 with 57 rules applied. Total rules applied 1734 place count 80 transition count 176
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 1758 place count 56 transition count 152
Iterating global reduction 13 with 24 rules applied. Total rules applied 1782 place count 56 transition count 152
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 1797 place count 56 transition count 137
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1803 place count 50 transition count 125
Iterating global reduction 14 with 6 rules applied. Total rules applied 1809 place count 50 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1814 place count 50 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 15 with 33 rules applied. Total rules applied 1847 place count 50 transition count 87
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1850 place count 47 transition count 78
Iterating global reduction 15 with 3 rules applied. Total rules applied 1853 place count 47 transition count 78
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1856 place count 44 transition count 75
Iterating global reduction 15 with 3 rules applied. Total rules applied 1859 place count 44 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1862 place count 44 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1865 place count 44 transition count 69
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 1868 place count 44 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1871 place count 41 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1872 place count 41 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1873 place count 40 transition count 65
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 36 edges and 39 vertex of which 24 / 39 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 1875 place count 24 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 18 with 31 rules applied. Total rules applied 1906 place count 24 transition count 34
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 1909 place count 21 transition count 31
Iterating global reduction 19 with 3 rules applied. Total rules applied 1912 place count 21 transition count 31
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 1918 place count 18 transition count 28
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1925 place count 18 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1926 place count 18 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 1929 place count 18 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1932 place count 15 transition count 17
Applied a total of 1932 rules in 73 ms. Remains 15 /1525 variables (removed 1510) and now considering 17/1952 (removed 1935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 15/1525 places, 17/1952 transitions.
RANDOM walk for 1005 steps (57 resets) in 5 ms. (167 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 373 ms. Reduced automaton from 14 states, 28 edges and 3 AP (stutter sensitive) to 14 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 562 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 584 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 4 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 1952/1952 transitions.
Applied a total of 0 rules in 58 ms. Remains 1525 /1525 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
[2025-05-30 07:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:20:40] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-05-30 07:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:20:41] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-30 07:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1524/3477 variables, and 4 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1524/3477 variables, and 4 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Finished structural reductions in LTL mode , in 1 iterations and 61651 ms. Remains : 1525/1525 places, 1952/1952 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2131 edges and 1525 vertex of which 1516 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 14 states, 28 edges and 3 AP (stutter sensitive) to 14 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 622 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (278 resets) in 211 ms. (188 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (79 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (80 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (77 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (78 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (77 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (77 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (75 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 295329 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 8
Probabilistic random walk after 295329 steps, saw 73380 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2025-05-30 07:21:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1238 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 276/1514 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1514 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1942/3456 variables, 1514/1518 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3456 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/3458 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3458 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/3460 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3460 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/3462 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3462 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/3464 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3464/3477 variables, and 1522 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1518/1525 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1234/1238 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 276/1514 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1514 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1942/3456 variables, 1514/1518 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3456 variables, 8/1526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3456 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/3458 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3458 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/3460 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3460 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/3462 variables, 1/1529 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3462 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/3464 variables, 1/1530 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3464/3477 variables, and 1530 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1518/1525 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10028ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1525/1525 places, 1952/1952 transitions.
Graph (trivial) has 1854 edges and 1525 vertex of which 693 / 1525 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1330 edges and 895 vertex of which 886 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 886 transition count 646
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 559 rules applied. Total rules applied 1067 place count 387 transition count 586
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1107 place count 348 transition count 585
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1108 place count 347 transition count 585
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1108 place count 347 transition count 537
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1204 place count 299 transition count 537
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1215 place count 288 transition count 521
Iterating global reduction 4 with 11 rules applied. Total rules applied 1226 place count 288 transition count 521
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1229 place count 288 transition count 518
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1232 place count 285 transition count 518
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1240 place count 277 transition count 508
Iterating global reduction 6 with 8 rules applied. Total rules applied 1248 place count 277 transition count 508
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1254 place count 277 transition count 502
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1256 place count 275 transition count 490
Iterating global reduction 7 with 2 rules applied. Total rules applied 1258 place count 275 transition count 490
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1259 place count 275 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1260 place count 274 transition count 489
Performed 145 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 9 with 290 rules applied. Total rules applied 1550 place count 129 transition count 250
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 17 rules applied. Total rules applied 1567 place count 129 transition count 233
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1569 place count 128 transition count 232
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1572 place count 125 transition count 229
Iterating global reduction 11 with 3 rules applied. Total rules applied 1575 place count 125 transition count 229
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1599 place count 113 transition count 214
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1611 place count 113 transition count 202
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1677 place count 80 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 12 with 57 rules applied. Total rules applied 1734 place count 80 transition count 176
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 1758 place count 56 transition count 152
Iterating global reduction 13 with 24 rules applied. Total rules applied 1782 place count 56 transition count 152
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 1797 place count 56 transition count 137
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1803 place count 50 transition count 125
Iterating global reduction 14 with 6 rules applied. Total rules applied 1809 place count 50 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1814 place count 50 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 15 with 33 rules applied. Total rules applied 1847 place count 50 transition count 87
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1850 place count 47 transition count 78
Iterating global reduction 15 with 3 rules applied. Total rules applied 1853 place count 47 transition count 78
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1856 place count 44 transition count 75
Iterating global reduction 15 with 3 rules applied. Total rules applied 1859 place count 44 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1862 place count 44 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1865 place count 44 transition count 69
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 1868 place count 44 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1871 place count 41 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1872 place count 41 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1873 place count 40 transition count 65
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 36 edges and 39 vertex of which 24 / 39 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 1875 place count 24 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 18 with 31 rules applied. Total rules applied 1906 place count 24 transition count 34
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 1909 place count 21 transition count 31
Iterating global reduction 19 with 3 rules applied. Total rules applied 1912 place count 21 transition count 31
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 1918 place count 18 transition count 28
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1925 place count 18 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1926 place count 18 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 1929 place count 18 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1932 place count 15 transition count 17
Applied a total of 1932 rules in 52 ms. Remains 15 /1525 variables (removed 1510) and now considering 17/1952 (removed 1935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 15/1525 places, 17/1952 transitions.
RANDOM walk for 1306 steps (78 resets) in 8 ms. (145 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 351 ms. Reduced automaton from 14 states, 28 edges and 3 AP (stutter sensitive) to 14 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 595 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 615 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 566 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 28534 reset in 300 ms.
Product exploration explored 100000 steps with 28546 reset in 291 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 509 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 4 out of 1525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1525/1525 places, 1952/1952 transitions.
Graph (trivial) has 1854 edges and 1525 vertex of which 693 / 1525 are part of one of the 63 SCC in 4 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1393 edges and 895 vertex of which 886 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 485 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 485 rules applied. Total rules applied 487 place count 886 transition count 1215
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 499 place count 886 transition count 1203
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 499 place count 886 transition count 1215
Deduced a syphon composed of 505 places in 2 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 519 place count 886 transition count 1215
Discarding 288 places :
Symmetric choice reduction at 2 with 288 rule applications. Total rules 807 place count 598 transition count 917
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 2 with 288 rules applied. Total rules applied 1095 place count 598 transition count 917
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1107 place count 586 transition count 901
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1119 place count 586 transition count 901
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1125 place count 586 transition count 895
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1137 place count 574 transition count 883
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1149 place count 574 transition count 883
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 572 transition count 879
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 572 transition count 879
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 570 transition count 875
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 570 transition count 875
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1161 place count 566 transition count 871
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1165 place count 566 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1167 place count 564 transition count 867
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1169 place count 564 transition count 867
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1171 place count 562 transition count 863
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1173 place count 562 transition count 863
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1177 place count 558 transition count 857
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1181 place count 558 transition count 857
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1185 place count 554 transition count 841
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1189 place count 554 transition count 841
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1190 place count 554 transition count 841
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1194 place count 550 transition count 837
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1198 place count 550 transition count 837
Performed 107 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 321 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1305 place count 550 transition count 911
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 1343 place count 550 transition count 873
Discarding 103 places :
Symmetric choice reduction at 5 with 103 rule applications. Total rules 1446 place count 447 transition count 759
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 103 rules applied. Total rules applied 1549 place count 447 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1551 place count 447 transition count 757
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1556 place count 442 transition count 751
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 6 with 5 rules applied. Total rules applied 1561 place count 442 transition count 751
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1568 place count 442 transition count 751
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1572 place count 442 transition count 747
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1587 place count 427 transition count 728
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1602 place count 427 transition count 728
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1607 place count 427 transition count 723
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1611 place count 423 transition count 719
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1615 place count 423 transition count 719
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1618 place count 423 transition count 719
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1624 place count 423 transition count 713
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1627 place count 420 transition count 710
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1630 place count 420 transition count 710
Performed 71 Post agglomeration using F-continuation condition with reduction of 91 identical transitions.
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 9 with 71 rules applied. Total rules applied 1701 place count 420 transition count 1033
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 9 with 110 rules applied. Total rules applied 1811 place count 420 transition count 923
Discarding 125 places :
Symmetric choice reduction at 10 with 125 rule applications. Total rules 1936 place count 295 transition count 595
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 10 with 125 rules applied. Total rules applied 2061 place count 295 transition count 595
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 2074 place count 295 transition count 582
Discarding 24 places :
Symmetric choice reduction at 11 with 24 rule applications. Total rules 2098 place count 271 transition count 535
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 11 with 24 rules applied. Total rules applied 2122 place count 271 transition count 535
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 2124 place count 271 transition count 565
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2128 place count 271 transition count 561
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2131 place count 268 transition count 541
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 12 with 3 rules applied. Total rules applied 2134 place count 268 transition count 541
Deduced a syphon composed of 145 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 12 with 45 rules applied. Total rules applied 2179 place count 268 transition count 496
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2183 place count 264 transition count 492
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 12 with 4 rules applied. Total rules applied 2187 place count 264 transition count 492
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 12 with 3 rules applied. Total rules applied 2190 place count 264 transition count 552
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2193 place count 261 transition count 537
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 12 with 3 rules applied. Total rules applied 2196 place count 261 transition count 537
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 2196 rules in 218 ms. Remains 261 /1525 variables (removed 1264) and now considering 537/1952 (removed 1415) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:22:00] [INFO ] Redundant transitions in 9 ms returned []
Running 536 sub problems to find dead transitions.
[2025-05-30 07:22:00] [INFO ] Flow matrix only has 480 transitions (discarded 57 similar events)
// Phase 1: matrix 480 rows 261 cols
[2025-05-30 07:22:00] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 07:22:00] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
At refinement iteration 1 (OVERLAPS) 479/739 variables, 260/260 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/739 variables, 2/262 constraints. Problems are: Problem set: 261 solved, 275 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/739 variables, 0/262 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/740 variables, 1/263 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 0/263 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 1/741 variables, 1/264 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 0/264 constraints. Problems are: Problem set: 261 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/741 variables, and 264 constraints, problems are : Problem set: 261 solved, 275 unsolved in 30015 ms.
Refiners :[State Equation: 261/261 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 536/536 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 261 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 476/595 variables, 119/119 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 2/121 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 275/396 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 0/396 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 145/740 variables, 142/538 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/538 constraints. Problems are: Problem set: 261 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 1/741 variables, 1/539 constraints. Problems are: Problem set: 261 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/741 variables, and 539 constraints, problems are : Problem set: 261 solved, 275 unsolved in 30020 ms.
Refiners :[State Equation: 261/261 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 275/536 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 261 solved, 275 unsolved
Search for dead transitions found 261 dead transitions in 60122ms
Found 261 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 261 transitions
Dead transitions reduction (with SMT) removed 261 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 261/1525 places, 276/1952 transitions.
Graph (complete) has 427 edges and 261 vertex of which 120 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.1 ms
Discarding 141 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 120 /261 variables (removed 141) and now considering 276/276 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/1525 places, 276/1952 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60360 ms. Remains : 120/1525 places, 276/1952 transitions.
Built C files in :
/tmp/ltsmin14687529021723752461
[2025-05-30 07:23:00] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14687529021723752461
Running compilation step : cd /tmp/ltsmin14687529021723752461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14687529021723752461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14687529021723752461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 1952/1952 transitions.
Applied a total of 0 rules in 53 ms. Remains 1525 /1525 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1525 cols
[2025-05-30 07:23:03] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:23:03] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-05-30 07:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:23:04] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-30 07:23:04] [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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1524/3477 variables, and 4 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1524/3477 variables, and 4 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Finished structural reductions in LTL mode , in 1 iterations and 61603 ms. Remains : 1525/1525 places, 1952/1952 transitions.
Built C files in :
/tmp/ltsmin5037894988188701122
[2025-05-30 07:24:05] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5037894988188701122
Running compilation step : cd /tmp/ltsmin5037894988188701122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5037894988188701122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5037894988188701122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 07:24:08] [INFO ] Flatten gal took : 32 ms
[2025-05-30 07:24:08] [INFO ] Flatten gal took : 63 ms
[2025-05-30 07:24:08] [INFO ] Time to serialize gal into /tmp/LTL10497659864462138188.gal : 5 ms
[2025-05-30 07:24:08] [INFO ] Time to serialize properties into /tmp/LTL10428616949312567719.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10497659864462138188.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3257064115739646859.hoa' '-atoms' '/tmp/LTL10428616949312567719.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p1672!=1)")))||((X(F("(p1672!=1)")))&&((X(X(X("(p2433!=1)"))))U((X(X(X(G("(p2433!=1)")))))||((!("(((p1229==1)||(p1672==1))...203
Formula 0 simplified : G(FG!"(p1672!=1)" & (XG!"(p1672!=1)" | (XXX!"(p2433!=1)" R (XXXF!"(p2433!=1)" & ("(((p1229==1)||(p1672==1))&&(p1006==1))" | XXX!"(p2...168
Detected timeout of ITS tools.
[2025-05-30 07:24:38] [INFO ] Flatten gal took : 32 ms
[2025-05-30 07:24:38] [INFO ] Applying decomposition
[2025-05-30 07:24:38] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12518753394066249030.txt' '-o' '/tmp/graph12518753394066249030.bin' '-w' '/tmp/graph12518753394066249030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12518753394066249030.bin' '-l' '-1' '-v' '-w' '/tmp/graph12518753394066249030.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:24:38] [INFO ] Decomposing Gal with order
[2025-05-30 07:24:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:24:38] [INFO ] Removed a total of 537 redundant transitions.
[2025-05-30 07:24:38] [INFO ] Flatten gal took : 64 ms
[2025-05-30 07:24:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 22 ms.
[2025-05-30 07:24:38] [INFO ] Time to serialize gal into /tmp/LTL18380530271962354082.gal : 13 ms
[2025-05-30 07:24:38] [INFO ] Time to serialize properties into /tmp/LTL13766546709189114795.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18380530271962354082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13766546709189114795.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(i38.i2.i1.u402.p1672!=1)")))||((X(F("(i38.i2.i1.u402.p1672!=1)")))&&((X(X(X("(i37.i0.i4.u600.p2433!=1)"))))U((X(X(X(G("(i3...323
Formula 0 simplified : G(FG!"(i38.i2.i1.u402.p1672!=1)" & (XG!"(i38.i2.i1.u402.p1672!=1)" | (XXX!"(i37.i0.i4.u600.p2433!=1)" R (XXXF!"(i37.i0.i4.u600.p2433...288
Reverse transition relation is NOT exact ! Due to transitions t26, t200, t281, t312, t390, t461, t514, t679, t761, t794, t823, t872, t943, t994, t1150, t12...2267
Computing Next relation with stutter on 147296 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
416 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.3374,158388,1,0,234344,6698,20283,454049,631,37710,1341915
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-308-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-308-LTLFireability-09 finished in 318886 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)||(G((p1||X(p2)))&&X(F(p3)))))'
Support contains 4 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1539 transition count 1972
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1539 transition count 1972
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1531 transition count 1963
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1531 transition count 1963
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 1531 transition count 1961
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 1528 transition count 1958
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 1528 transition count 1958
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 1526 transition count 1956
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 1526 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 1524 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 1524 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 1522 transition count 1951
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 1522 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 1520 transition count 1948
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 1520 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 1518 transition count 1946
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 1518 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 1517 transition count 1944
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 1517 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 1516 transition count 1942
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 1516 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 1515 transition count 1941
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 1515 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 1515 transition count 1940
Applied a total of 75 rules in 683 ms. Remains 1515 /1551 variables (removed 36) and now considering 1940/1984 (removed 44) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2025-05-30 07:24:44] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:24:44] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-05-30 07:24:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:24:45] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2025-05-30 07:24:45] [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: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 timeout
0.0)
(s202 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1551 places, 1940/1984 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62247 ms. Remains : 1515/1551 places, 1940/1984 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-12
Stuttering criterion allowed to conclude after 747 steps with 14 reset in 5 ms.
FORMULA CloudReconfiguration-PT-308-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLFireability-12 finished in 62541 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)||X(p1)))'
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1539 transition count 1972
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1539 transition count 1972
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1531 transition count 1964
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1531 transition count 1964
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 1531 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 1528 transition count 1959
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 1528 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 1525 transition count 1956
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 1525 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1522 transition count 1953
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1522 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 1519 transition count 1949
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 1519 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 1516 transition count 1944
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 1513 transition count 1940
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 1513 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 1511 transition count 1937
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 1511 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 1511 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1509 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 1509 transition count 1932
Applied a total of 88 rules in 656 ms. Remains 1509 /1551 variables (removed 42) and now considering 1932/1984 (removed 52) transitions.
// Phase 1: matrix 1932 rows 1509 cols
[2025-05-30 07:25:46] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:25:46] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-05-30 07:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:25:47] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 07:25:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60392ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1551 places, 1932/1984 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62168 ms. Remains : 1509/1551 places, 1932/1984 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-13
Stuttering criterion allowed to conclude after 172 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-308-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLFireability-13 finished in 62317 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&&X(F(p1))))&&G(F(p0))))'
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1538 transition count 1971
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1538 transition count 1971
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1529 transition count 1961
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1529 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 1529 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 1525 transition count 1955
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 1525 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1522 transition count 1952
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1522 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 1520 transition count 1950
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 1520 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 1518 transition count 1947
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 1518 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 1516 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 1516 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 1514 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 1514 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 1513 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 1513 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 1513 transition count 1938
Applied a total of 79 rules in 559 ms. Remains 1513 /1551 variables (removed 38) and now considering 1938/1984 (removed 46) transitions.
// Phase 1: matrix 1938 rows 1513 cols
[2025-05-30 07:26:49] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:26:49] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-30 07:26:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:26:50] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2025-05-30 07:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1551 places, 1938/1984 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62109 ms. Remains : 1513/1551 places, 1938/1984 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-14
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-308-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLFireability-14 finished in 62336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1984/1984 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1538 transition count 1971
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1538 transition count 1971
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1529 transition count 1961
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1529 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 1529 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 1525 transition count 1955
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 1525 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1522 transition count 1952
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1522 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 1519 transition count 1949
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 1519 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 1516 transition count 1945
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 1516 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 1513 transition count 1940
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 1513 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 1510 transition count 1936
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 1510 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 1508 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 1508 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1507 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 1506 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 1506 transition count 1928
Applied a total of 94 rules in 670 ms. Remains 1506 /1551 variables (removed 45) and now considering 1928/1984 (removed 56) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 07:27:51] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:27:51] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-30 07:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:27:52] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 07:27:52] [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: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1551 places, 1928/1984 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62213 ms. Remains : 1506/1551 places, 1928/1984 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-308-LTLFireability-15
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-308-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-308-LTLFireability-15 finished in 62319 ms.
All properties solved by simple procedures.
Total runtime 1090853 ms.

BK_STOP 1748590133154

--------------------
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="CloudReconfiguration-PT-308"
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 CloudReconfiguration-PT-308, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028100268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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