MCC'2025- Execution of r044-tall-174854028300340

About the Execution of ITS-Tools for CloudReconfiguration-PT-318

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	978651.00	0.00	0.00	TFFTFFFFTFFFFFFF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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 661K 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-318-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-318-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748598974018

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-318
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 09:56:15] [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 09:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 09:56:15] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2025-05-30 09:56:15] [INFO ] Transformed 2587 places.
[2025-05-30 09:56:15] [INFO ] Transformed 3099 transitions.
[2025-05-30 09:56:15] [INFO ] Found NUPN structural information;
[2025-05-30 09:56:15] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Support contains 39 out of 2587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Discarding 514 places :
Symmetric choice reduction at 0 with 514 rule applications. Total rules 514 place count 2073 transition count 2585
Iterating global reduction 0 with 514 rules applied. Total rules applied 1028 place count 2073 transition count 2585
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 1054 place count 2073 transition count 2559
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1293 place count 1834 transition count 2320
Iterating global reduction 1 with 239 rules applied. Total rules applied 1532 place count 1834 transition count 2320
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 1619 place count 1747 transition count 2233
Iterating global reduction 1 with 87 rules applied. Total rules applied 1706 place count 1747 transition count 2233
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1722 place count 1747 transition count 2217
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1765 place count 1704 transition count 2174
Iterating global reduction 2 with 43 rules applied. Total rules applied 1808 place count 1704 transition count 2174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1817 place count 1704 transition count 2165
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1850 place count 1671 transition count 2127
Iterating global reduction 3 with 33 rules applied. Total rules applied 1883 place count 1671 transition count 2127
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1908 place count 1646 transition count 2102
Iterating global reduction 3 with 25 rules applied. Total rules applied 1933 place count 1646 transition count 2102
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1955 place count 1624 transition count 2080
Iterating global reduction 3 with 22 rules applied. Total rules applied 1977 place count 1624 transition count 2080
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1998 place count 1603 transition count 2059
Iterating global reduction 3 with 21 rules applied. Total rules applied 2019 place count 1603 transition count 2059
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2036 place count 1586 transition count 2032
Iterating global reduction 3 with 17 rules applied. Total rules applied 2053 place count 1586 transition count 2032
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2057 place count 1582 transition count 2026
Iterating global reduction 3 with 4 rules applied. Total rules applied 2061 place count 1582 transition count 2026
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2065 place count 1578 transition count 2021
Iterating global reduction 3 with 4 rules applied. Total rules applied 2069 place count 1578 transition count 2021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2070 place count 1578 transition count 2020
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2071 place count 1577 transition count 2019
Iterating global reduction 4 with 1 rules applied. Total rules applied 2072 place count 1577 transition count 2019
Applied a total of 2072 rules in 1355 ms. Remains 1577 /2587 variables (removed 1010) and now considering 2019/3099 (removed 1080) transitions.
// Phase 1: matrix 2019 rows 1577 cols
[2025-05-30 09:56:17] [INFO ] Computed 4 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:56:17] [INFO ] Implicit Places using invariants in 539 ms returned []
[2025-05-30 09:56:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:56:18] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
Running 2018 sub problems to find dead transitions.
[2025-05-30 09:56:18] [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/1576 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2018 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1576/3596 variables, and 4 constraints, problems are : Problem set: 0 solved, 2018 unsolved in 30057 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1577 constraints, PredecessorRefiner: 2018/2018 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2018 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1576 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2018 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 1576/3596 variables, and 4 constraints, problems are : Problem set: 0 solved, 2018 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1577 constraints, PredecessorRefiner: 0/2018 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60682ms problems are : Problem set: 0 solved, 2018 unsolved
Search for dead transitions found 0 dead transitions in 60699ms
Starting structural reductions in LTL mode, iteration 1 : 1577/2587 places, 2019/3099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63668 ms. Remains : 1577/2587 places, 2019/3099 transitions.
Support contains 39 out of 1577 places after structural reductions.
[2025-05-30 09:57:19] [INFO ] Flatten gal took : 145 ms
[2025-05-30 09:57:19] [INFO ] Flatten gal took : 81 ms
[2025-05-30 09:57:20] [INFO ] Input system was already deterministic with 2019 transitions.
RANDOM walk for 40000 steps (315 resets) in 2414 ms. (16 steps per ms) remains 29/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 50 ms. (78 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (11 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 78 ms. (50 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (11 resets) in 28 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (10 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
[2025-05-30 09:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1535/1566 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1566 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 2009/3575 variables, 1566/1570 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3575 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 2/3577 variables, 1/1571 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3577 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 2/3579 variables, 1/1572 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3579 variables, 0/1572 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
SMT process timed out in 5045ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 1577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Graph (trivial) has 1862 edges and 1577 vertex of which 655 / 1577 are part of one of the 60 SCC in 6 ms
Free SCC test removed 595 places
Drop transitions (Empty/Sink Transition effects.) removed 748 transitions
Reduce isomorphic transitions removed 748 transitions.
Graph (complete) has 1450 edges and 982 vertex of which 972 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 502 transitions
Trivial Post-agglo rules discarded 502 transitions
Performed 502 trivial Post agglomeration. Transition count delta: 502
Iterating post reduction 0 with 509 rules applied. Total rules applied 511 place count 972 transition count 757
Reduce places removed 502 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 554 rules applied. Total rules applied 1065 place count 470 transition count 705
Reduce places removed 34 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 36 rules applied. Total rules applied 1101 place count 436 transition count 703
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 1104 place count 435 transition count 701
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 4 with 3 rules applied. Total rules applied 1107 place count 434 transition count 699
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 11 rules applied. Total rules applied 1118 place count 433 transition count 689
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1128 place count 423 transition count 689
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 1128 place count 423 transition count 638
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 1230 place count 372 transition count 638
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1237 place count 365 transition count 629
Iterating global reduction 7 with 7 rules applied. Total rules applied 1244 place count 365 transition count 629
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 1245 place count 365 transition count 628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1246 place count 364 transition count 628
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1251 place count 359 transition count 623
Iterating global reduction 9 with 5 rules applied. Total rules applied 1256 place count 359 transition count 623
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1261 place count 359 transition count 618
Performed 167 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 10 with 334 rules applied. Total rules applied 1595 place count 192 transition count 355
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1612 place count 192 transition count 338
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1615 place count 189 transition count 335
Iterating global reduction 11 with 3 rules applied. Total rules applied 1618 place count 189 transition count 335
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1636 place count 180 transition count 325
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1647 place count 180 transition count 314
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 1649 place count 179 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1651 place count 179 transition count 311
Performed 39 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 13 with 78 rules applied. Total rules applied 1729 place count 140 transition count 366
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 13 with 30 rules applied. Total rules applied 1759 place count 140 transition count 336
Discarding 21 places :
Symmetric choice reduction at 14 with 21 rule applications. Total rules 1780 place count 119 transition count 294
Iterating global reduction 14 with 21 rules applied. Total rules applied 1801 place count 119 transition count 294
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 1808 place count 119 transition count 287
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 1812 place count 115 transition count 279
Iterating global reduction 15 with 4 rules applied. Total rules applied 1816 place count 115 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1818 place count 115 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 16 with 27 rules applied. Total rules applied 1845 place count 115 transition count 250
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1846 place count 114 transition count 249
Iterating global reduction 16 with 1 rules applied. Total rules applied 1847 place count 114 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1848 place count 114 transition count 248
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 1855 place count 114 transition count 241
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 1862 place count 107 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1863 place count 107 transition count 240
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 17 with 7 rules applied. Total rules applied 1870 place count 107 transition count 240
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1871 place count 107 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1872 place count 106 transition count 239
Applied a total of 1872 rules in 187 ms. Remains 106 /1577 variables (removed 1471) and now considering 239/2019 (removed 1780) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 106/1577 places, 239/2019 transitions.
RANDOM walk for 40000 steps (3844 resets) in 387 ms. (103 steps per ms) remains 3/29 properties
BEST_FIRST walk for 40002 steps (721 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (792 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (750 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
[2025-05-30 09:57:26] [INFO ] Flow matrix only has 228 transitions (discarded 11 similar events)
// Phase 1: matrix 228 rows 106 cols
[2025-05-30 09:57:26] [INFO ] Computed 3 invariants in 2 ms
[2025-05-30 09:57:26] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 186/262 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 47/309 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 20/329 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/334 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 115 constraints, problems are : Problem set: 0 solved, 3 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 186/262 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 47/309 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/329 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/334 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/334 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/334 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 118 constraints, problems are : Problem set: 0 solved, 3 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 47 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 239/239 transitions.
Graph (trivial) has 94 edges and 106 vertex of which 20 / 106 are part of one of the 9 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 95 transition count 196
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 77 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 76 transition count 192
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 42 place count 76 transition count 186
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 54 place count 70 transition count 186
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 63 place count 61 transition count 173
Iterating global reduction 3 with 9 rules applied. Total rules applied 72 place count 61 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 79 place count 61 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 91 place count 55 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 95 place count 55 transition count 156
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 54 transition count 153
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 54 transition count 153
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 53 transition count 152
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 53 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 102 place count 53 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 106 place count 51 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 109 place count 51 transition count 145
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 7 with 2 rules applied. Total rules applied 111 place count 50 transition count 144
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 118 place count 50 transition count 137
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 120 place count 48 transition count 135
Iterating global reduction 8 with 2 rules applied. Total rules applied 122 place count 48 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 124 place count 48 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 144 place count 48 transition count 113
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 146 place count 46 transition count 107
Iterating global reduction 9 with 2 rules applied. Total rules applied 148 place count 46 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 150 place count 46 transition count 105
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 152 place count 44 transition count 103
Iterating global reduction 10 with 2 rules applied. Total rules applied 154 place count 44 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 159 place count 44 transition count 98
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 161 place count 43 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 163 place count 43 transition count 95
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 166 place count 43 transition count 92
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 171 place count 40 transition count 90
Applied a total of 171 rules in 42 ms. Remains 40 /106 variables (removed 66) and now considering 90/239 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 40/106 places, 90/239 transitions.
RANDOM walk for 40000 steps (746 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (240 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5571 states, properties seen :0
Probabilistic random walk after 23363 steps, saw 5571 distinct states, run finished after 51 ms. (steps per millisecond=458 ) properties seen :0
Explored full state space saw : 5571 states, properties seen :0
Exhaustive walk after 23363 steps, saw 5571 distinct states, run finished after 30 ms. (steps per millisecond=778 ) properties seen :0
FORMULA CloudReconfiguration-PT-318-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudReconfiguration-PT-318-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudReconfiguration-PT-318-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA CloudReconfiguration-PT-318-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2202 edges and 1577 vertex of which 1567 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.27 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1557 transition count 1999
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1557 transition count 1999
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 1557 transition count 1996
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 1543 transition count 1980
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 1543 transition count 1980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 1543 transition count 1979
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 81 place count 1534 transition count 1967
Iterating global reduction 2 with 9 rules applied. Total rules applied 90 place count 1534 transition count 1967
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 98 place count 1526 transition count 1959
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 1526 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 1526 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 1521 transition count 1953
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 1521 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 1517 transition count 1947
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 1517 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 1515 transition count 1943
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 1515 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 1513 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 1513 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 1511 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 1511 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 1511 transition count 1936
Applied a total of 138 rules in 735 ms. Remains 1511 /1577 variables (removed 66) and now considering 1936/2019 (removed 83) transitions.
// Phase 1: matrix 1936 rows 1511 cols
[2025-05-30 09:57:28] [INFO ] Computed 4 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:57:28] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-05-30 09:57:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:57:29] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2025-05-30 09:57:29] [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 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.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 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.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 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 1.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 1.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 1.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 1.0)
(s1116 0.0)
(s1117 1.0)
(s1118 1.0)
(s1119 0.0)
(s1120 1.0)
(s1121 0.0)
(s1122 0.0)
(s1123 1.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 1.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 timeout
0.0)
(s1169 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60506ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1577 places, 1936/2019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62429 ms. Remains : 1511/1577 places, 1936/2019 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 361 ms.
Product exploration explored 100000 steps with 33333 reset in 313 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2119 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.13 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 30 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-318-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-318-LTLFireability-00 finished in 63457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||X(p1)))&&(F(p1) U p2)&&G(p3))))'
Support contains 3 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1558 transition count 2000
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1558 transition count 2000
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 1558 transition count 1997
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 1544 transition count 1981
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 1544 transition count 1981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 1544 transition count 1980
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 1535 transition count 1968
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 1535 transition count 1968
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 1535 transition count 1967
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 96 place count 1528 transition count 1960
Iterating global reduction 3 with 7 rules applied. Total rules applied 103 place count 1528 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 1528 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 108 place count 1524 transition count 1955
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 1524 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 115 place count 1521 transition count 1950
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 1521 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 1520 transition count 1948
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 1520 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 1519 transition count 1946
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 1519 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 1518 transition count 1945
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 1518 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 1518 transition count 1944
Applied a total of 125 rules in 641 ms. Remains 1518 /1577 variables (removed 59) and now considering 1944/2019 (removed 75) transitions.
// Phase 1: matrix 1944 rows 1518 cols
[2025-05-30 09:58:31] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:58:31] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-05-30 09:58:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:58:32] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1943 sub problems to find dead transitions.
[2025-05-30 09:58:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1517 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1517/3462 variables, and 4 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1518 constraints, PredecessorRefiner: 1943/1943 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1943 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1517 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1517/3462 variables, and 4 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1518 constraints, PredecessorRefiner: 0/1943 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 1943 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 1518/1577 places, 1944/2019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62266 ms. Remains : 1518/1577 places, 1944/2019 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p3), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-01
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-318-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-318-LTLFireability-01 finished in 62619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Graph (trivial) has 1926 edges and 1577 vertex of which 702 / 1577 are part of one of the 63 SCC in 6 ms
Free SCC test removed 639 places
Ensure Unique test removed 743 transitions
Reduce isomorphic transitions removed 743 transitions.
Graph (complete) has 1454 edges and 938 vertex of which 928 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 518 rules applied. Total rules applied 520 place count 927 transition count 751
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 544 rules applied. Total rules applied 1064 place count 410 transition count 724
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1077 place count 397 transition count 724
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1077 place count 397 transition count 679
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1167 place count 352 transition count 679
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1181 place count 338 transition count 656
Iterating global reduction 3 with 14 rules applied. Total rules applied 1195 place count 338 transition count 656
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 1 rules applied. Total rules applied 1196 place count 338 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1197 place count 337 transition count 655
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1206 place count 328 transition count 642
Iterating global reduction 5 with 9 rules applied. Total rules applied 1215 place count 328 transition count 642
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1220 place count 328 transition count 637
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1222 place count 326 transition count 633
Iterating global reduction 6 with 2 rules applied. Total rules applied 1224 place count 326 transition count 633
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1226 place count 324 transition count 629
Iterating global reduction 6 with 2 rules applied. Total rules applied 1228 place count 324 transition count 629
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1230 place count 322 transition count 625
Iterating global reduction 6 with 2 rules applied. Total rules applied 1232 place count 322 transition count 625
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1234 place count 320 transition count 621
Iterating global reduction 6 with 2 rules applied. Total rules applied 1236 place count 320 transition count 621
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1238 place count 318 transition count 617
Iterating global reduction 6 with 2 rules applied. Total rules applied 1240 place count 318 transition count 617
Performed 156 Post agglomeration using F-continuation condition with reduction of 100 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 6 with 312 rules applied. Total rules applied 1552 place count 162 transition count 361
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1562 place count 162 transition count 351
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1568 place count 156 transition count 340
Iterating global reduction 7 with 6 rules applied. Total rules applied 1574 place count 156 transition count 340
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1575 place count 155 transition count 339
Iterating global reduction 7 with 1 rules applied. Total rules applied 1576 place count 155 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1577 place count 155 transition count 338
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1597 place count 145 transition count 327
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1607 place count 145 transition count 317
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1643 place count 127 transition count 363
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1662 place count 127 transition count 344
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1671 place count 118 transition count 326
Iterating global reduction 10 with 9 rules applied. Total rules applied 1680 place count 118 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1686 place count 118 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 11 with 37 rules applied. Total rules applied 1723 place count 118 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1724 place count 117 transition count 282
Applied a total of 1724 rules in 165 ms. Remains 117 /1577 variables (removed 1460) and now considering 282/2019 (removed 1737) transitions.
[2025-05-30 09:59:33] [INFO ] Flow matrix only has 224 transitions (discarded 58 similar events)
// Phase 1: matrix 224 rows 117 cols
[2025-05-30 09:59:33] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:59:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-30 09:59:33] [INFO ] Flow matrix only has 224 transitions (discarded 58 similar events)
[2025-05-30 09:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:59:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 09:59:34] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 216 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1577 places, 282/2019 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 115 transition count 281
Applied a total of 2 rules in 10 ms. Remains 115 /116 variables (removed 1) and now considering 281/282 (removed 1) transitions.
[2025-05-30 09:59:34] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
// Phase 1: matrix 223 rows 115 cols
[2025-05-30 09:59:34] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:59:34] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-30 09:59:34] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
[2025-05-30 09:59:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:59:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 09:59:34] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1577 places, 281/2019 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 621 ms. Remains : 115/1577 places, 281/2019 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-318-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-318-LTLFireability-02 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(X(p1)) U ((X(X(p1))&&(p2 U (p3||G(p2))))||X(X(G(p1))))))))'
Support contains 3 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1558 transition count 2000
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1558 transition count 2000
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 1558 transition count 1997
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 1546 transition count 1983
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 1546 transition count 1983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1546 transition count 1982
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 1538 transition count 1971
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 1538 transition count 1971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 1538 transition count 1970
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 1532 transition count 1964
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 1532 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 1532 transition count 1963
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 99 place count 1529 transition count 1960
Iterating global reduction 4 with 3 rules applied. Total rules applied 102 place count 1529 transition count 1960
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 1526 transition count 1956
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 1526 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 1524 transition count 1952
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 1524 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 1522 transition count 1948
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 1522 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 1520 transition count 1946
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 1520 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 1520 transition count 1945
Applied a total of 121 rules in 596 ms. Remains 1520 /1577 variables (removed 57) and now considering 1945/2019 (removed 74) transitions.
// Phase 1: matrix 1945 rows 1520 cols
[2025-05-30 09:59:35] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:59:35] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 09:59:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:59:36] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Running 1944 sub problems to find dead transitions.
[2025-05-30 09:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/3465 variables, and 4 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 1944/1944 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1944 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/3465 variables, and 4 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 0/1944 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60451ms problems are : Problem set: 0 solved, 1944 unsolved
Search for dead transitions found 0 dead transitions in 60456ms
Starting structural reductions in LTL mode, iteration 1 : 1520/1577 places, 1945/2019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62100 ms. Remains : 1520/1577 places, 1945/2019 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 463 ms.
Product exploration explored 100000 steps with 33333 reset in 487 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2128 edges and 1520 vertex of which 1511 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND p0 (NOT p3) p2 p1))), (X (OR (AND p0 p3 p1) (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1))))), (X (NOT (AND p0 (NOT p3) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (NOT (OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (OR (AND p0 p3 p1) (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1)))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 127 ms. Reduced automaton from 6 states, 48 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-318-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-318-LTLFireability-03 finished in 63557 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||(p1&&F(G(p2)))))))'
Support contains 5 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Graph (trivial) has 1915 edges and 1577 vertex of which 702 / 1577 are part of one of the 63 SCC in 4 ms
Free SCC test removed 639 places
Ensure Unique test removed 743 transitions
Reduce isomorphic transitions removed 743 transitions.
Graph (complete) has 1454 edges and 938 vertex of which 928 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 509 rules applied. Total rules applied 511 place count 927 transition count 760
Reduce places removed 508 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 536 rules applied. Total rules applied 1047 place count 419 transition count 732
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 1065 place count 406 transition count 727
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1070 place count 401 transition count 727
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1070 place count 401 transition count 683
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1158 place count 357 transition count 683
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1172 place count 343 transition count 660
Iterating global reduction 4 with 14 rules applied. Total rules applied 1186 place count 343 transition count 660
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 4 with 1 rules applied. Total rules applied 1187 place count 343 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1188 place count 342 transition count 659
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1197 place count 333 transition count 646
Iterating global reduction 6 with 9 rules applied. Total rules applied 1206 place count 333 transition count 646
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1211 place count 333 transition count 641
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1213 place count 331 transition count 637
Iterating global reduction 7 with 2 rules applied. Total rules applied 1215 place count 331 transition count 637
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1217 place count 329 transition count 633
Iterating global reduction 7 with 2 rules applied. Total rules applied 1219 place count 329 transition count 633
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1220 place count 328 transition count 631
Iterating global reduction 7 with 1 rules applied. Total rules applied 1221 place count 328 transition count 631
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1222 place count 327 transition count 629
Iterating global reduction 7 with 1 rules applied. Total rules applied 1223 place count 327 transition count 629
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1224 place count 326 transition count 627
Iterating global reduction 7 with 1 rules applied. Total rules applied 1225 place count 326 transition count 627
Performed 156 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 7 with 312 rules applied. Total rules applied 1537 place count 170 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1547 place count 170 transition count 363
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1553 place count 164 transition count 352
Iterating global reduction 8 with 6 rules applied. Total rules applied 1559 place count 164 transition count 352
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1560 place count 163 transition count 351
Iterating global reduction 8 with 1 rules applied. Total rules applied 1561 place count 163 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1562 place count 163 transition count 350
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1584 place count 152 transition count 338
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1594 place count 152 transition count 328
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1595 place count 151 transition count 326
Iterating global reduction 10 with 1 rules applied. Total rules applied 1596 place count 151 transition count 326
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1630 place count 134 transition count 376
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1650 place count 134 transition count 356
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1659 place count 125 transition count 338
Iterating global reduction 11 with 9 rules applied. Total rules applied 1668 place count 125 transition count 338
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1672 place count 125 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 12 with 39 rules applied. Total rules applied 1711 place count 125 transition count 295
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1714 place count 125 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1715 place count 125 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1716 place count 124 transition count 293
Applied a total of 1716 rules in 105 ms. Remains 124 /1577 variables (removed 1453) and now considering 293/2019 (removed 1726) transitions.
[2025-05-30 10:00:38] [INFO ] Flow matrix only has 234 transitions (discarded 59 similar events)
// Phase 1: matrix 234 rows 124 cols
[2025-05-30 10:00:38] [INFO ] Computed 0 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:38] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-30 10:00:38] [INFO ] Flow matrix only has 234 transitions (discarded 59 similar events)
[2025-05-30 10:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 10:00:38] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 196 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/1577 places, 293/2019 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 122 transition count 292
Applied a total of 2 rules in 7 ms. Remains 122 /123 variables (removed 1) and now considering 292/293 (removed 1) transitions.
[2025-05-30 10:00:38] [INFO ] Flow matrix only has 233 transitions (discarded 59 similar events)
// Phase 1: matrix 233 rows 122 cols
[2025-05-30 10:00:38] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 10:00:38] [INFO ] Flow matrix only has 233 transitions (discarded 59 similar events)
[2025-05-30 10:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 10:00:38] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/1577 places, 292/2019 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 459 ms. Remains : 122/1577 places, 292/2019 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-04
Stuttering criterion allowed to conclude after 20655 steps with 1717 reset in 70 ms.
FORMULA CloudReconfiguration-PT-318-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-318-LTLFireability-04 finished in 665 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((X(p0)||F((G(F(p1))||(F(p1)&&G(p2))))))))'
Support contains 2 out of 1577 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Graph (trivial) has 1922 edges and 1577 vertex of which 696 / 1577 are part of one of the 62 SCC in 2 ms
Free SCC test removed 634 places
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 738 transitions.
Graph (complete) has 1459 edges and 943 vertex of which 933 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 518 rules applied. Total rules applied 520 place count 932 transition count 756
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 543 rules applied. Total rules applied 1063 place count 415 transition count 730
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1075 place count 403 transition count 730
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1075 place count 403 transition count 684
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1167 place count 357 transition count 684
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1180 place count 344 transition count 663
Iterating global reduction 3 with 13 rules applied. Total rules applied 1193 place count 344 transition count 663
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 1 rules applied. Total rules applied 1194 place count 344 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1195 place count 343 transition count 662
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1204 place count 334 transition count 649
Iterating global reduction 5 with 9 rules applied. Total rules applied 1213 place count 334 transition count 649
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1218 place count 334 transition count 644
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1220 place count 332 transition count 640
Iterating global reduction 6 with 2 rules applied. Total rules applied 1222 place count 332 transition count 640
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1224 place count 330 transition count 636
Iterating global reduction 6 with 2 rules applied. Total rules applied 1226 place count 330 transition count 636
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1228 place count 328 transition count 632
Iterating global reduction 6 with 2 rules applied. Total rules applied 1230 place count 328 transition count 632
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1232 place count 326 transition count 628
Iterating global reduction 6 with 2 rules applied. Total rules applied 1234 place count 326 transition count 628
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1236 place count 324 transition count 624
Iterating global reduction 6 with 2 rules applied. Total rules applied 1238 place count 324 transition count 624
Performed 159 Post agglomeration using F-continuation condition with reduction of 101 identical transitions.
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 6 with 318 rules applied. Total rules applied 1556 place count 165 transition count 364
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1566 place count 165 transition count 354
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1573 place count 158 transition count 338
Iterating global reduction 7 with 7 rules applied. Total rules applied 1580 place count 158 transition count 338
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1581 place count 157 transition count 337
Iterating global reduction 7 with 1 rules applied. Total rules applied 1582 place count 157 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1583 place count 157 transition count 336
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1603 place count 147 transition count 325
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1612 place count 147 transition count 316
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1648 place count 129 transition count 362
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 1666 place count 129 transition count 344
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1675 place count 120 transition count 326
Iterating global reduction 10 with 9 rules applied. Total rules applied 1684 place count 120 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1690 place count 120 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 11 with 37 rules applied. Total rules applied 1727 place count 120 transition count 283
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1728 place count 120 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1729 place count 119 transition count 282
Applied a total of 1729 rules in 85 ms. Remains 119 /1577 variables (removed 1458) and now considering 282/2019 (removed 1737) transitions.
[2025-05-30 10:00:38] [INFO ] Flow matrix only has 224 transitions (discarded 58 similar events)
// Phase 1: matrix 224 rows 119 cols
[2025-05-30 10:00:38] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 10:00:38] [INFO ] Flow matrix only has 224 transitions (discarded 58 similar events)
[2025-05-30 10:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:00:39] [INFO ] Implicit Places using invariants and state equation in 306 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 348 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1577 places, 282/2019 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 117 transition count 281
Applied a total of 2 rules in 9 ms. Remains 117 /118 variables (removed 1) and now considering 281/282 (removed 1) transitions.
[2025-05-30 10:00:39] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
// Phase 1: matrix 223 rows 117 cols
[2025-05-30 10:00:39] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-30 10:00:39] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
[2025-05-30 10:00:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:00:39] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1577 places, 281/2019 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 601 ms. Remains : 117/1577 places, 281/2019 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-05
Product exploration explored 100000 steps with 9484 reset in 122 ms.
Product exploration explored 100000 steps with 9658 reset in 253 ms.
Computed a total of 6 stabilizing places and 34 stable transitions
Computed a total of 6 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4506 resets) in 570 ms. (70 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (942 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2025-05-30 10:00:40] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
[2025-05-30 10:00:40] [INFO ] Invariant cache hit.
[2025-05-30 10:00:40] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/18 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/152 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 177/329 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/339 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/340 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[State Equation: 117/117 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/18 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 134/152 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 177/329 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/339 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/340 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/340 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[State Equation: 117/117 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 76 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 281/281 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2025-05-30 10:00:40] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
[2025-05-30 10:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:40] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 10:00:40] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
[2025-05-30 10:00:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:00:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:00:40] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:00:40] [INFO ] Redundant transitions in 36 ms returned []
Running 276 sub problems to find dead transitions.
[2025-05-30 10:00:40] [INFO ] Flow matrix only has 223 transitions (discarded 58 similar events)
[2025-05-30 10:00:40] [INFO ] Invariant cache hit.
[2025-05-30 10:00:40] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 222/338 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/339 variables, 1/120 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/120 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 1/340 variables, 1/121 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/121 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/121 constraints. Problems are: Problem set: 5 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 121 constraints, problems are : Problem set: 5 solved, 271 unsolved in 14302 ms.
Refiners :[State Equation: 117/117 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 222/338 variables, 116/116 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 3/119 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 271/390 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/390 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 1/339 variables, 1/391 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/391 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/340 variables, 1/392 constraints. Problems are: Problem set: 5 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/392 constraints. Problems are: Problem set: 5 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 392 constraints, problems are : Problem set: 5 solved, 271 unsolved in 30026 ms.
Refiners :[State Equation: 117/117 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 271/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44395ms problems are : Problem set: 5 solved, 271 unsolved
Search for dead transitions found 5 dead transitions in 44397ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 117/117 places, 276/281 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:01:25] [INFO ] Redundant transitions in 22 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 44635 ms. Remains : 117/117 places, 276/281 transitions.
Computed a total of 6 stabilizing places and 29 stable transitions
Computed a total of 6 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 83 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4484 resets) in 188 ms. (211 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (950 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
[2025-05-30 10:01:25] [INFO ] Flow matrix only has 219 transitions (discarded 57 similar events)
// Phase 1: matrix 219 rows 117 cols
[2025-05-30 10:01:25] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 10:01:25] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/18 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/152 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 173/325 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/335 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/336 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/336 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[State Equation: 117/117 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/18 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 134/152 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 173/325 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/335 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/336 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/336 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[State Equation: 117/117 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9535 reset in 217 ms.
Product exploration explored 100000 steps with 9498 reset in 130 ms.
Built C files in :
/tmp/ltsmin3962670778566925305
[2025-05-30 10:01:26] [INFO ] Computing symmetric may disable matrix : 276 transitions.
[2025-05-30 10:01:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:01:26] [INFO ] Computing symmetric may enable matrix : 276 transitions.
[2025-05-30 10:01:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:01:26] [INFO ] Computing Do-Not-Accords matrix : 276 transitions.
[2025-05-30 10:01:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:01:26] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3962670778566925305
Running compilation step : cd /tmp/ltsmin3962670778566925305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 597 ms.
Running link step : cd /tmp/ltsmin3962670778566925305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3962670778566925305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7727784022229405537.hoa' '--buchi-type=spotba'
LTSmin run took 550 ms.
FORMULA CloudReconfiguration-PT-318-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-318-LTLFireability-05 finished in 49354 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(X(p1)))) U X(G(p2))))'
Support contains 3 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1559 transition count 2001
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1559 transition count 2001
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1559 transition count 2000
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 1545 transition count 1984
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 1545 transition count 1984
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1545 transition count 1983
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 1536 transition count 1971
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 1536 transition count 1971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 1536 transition count 1970
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 92 place count 1529 transition count 1963
Iterating global reduction 3 with 7 rules applied. Total rules applied 99 place count 1529 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 1529 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 104 place count 1525 transition count 1958
Iterating global reduction 4 with 4 rules applied. Total rules applied 108 place count 1525 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 111 place count 1522 transition count 1954
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 1522 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 1521 transition count 1952
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 1521 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 1520 transition count 1950
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 1520 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 1519 transition count 1949
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 1519 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 1519 transition count 1948
Applied a total of 121 rules in 599 ms. Remains 1519 /1577 variables (removed 58) and now considering 1948/2019 (removed 71) transitions.
// Phase 1: matrix 1948 rows 1519 cols
[2025-05-30 10:01:28] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:01:28] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-30 10:01:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:01:29] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2025-05-30 10:01:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1518/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Starting structural reductions in LTL mode, iteration 1 : 1519/1577 places, 1948/2019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62205 ms. Remains : 1519/1577 places, 1948/2019 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-07
Product exploration explored 100000 steps with 25048 reset in 252 ms.
Product exploration explored 100000 steps with 25044 reset in 248 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2131 edges and 1519 vertex of which 1509 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 121 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (311 resets) in 163 ms. (243 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (98 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (89 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (90 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (99 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
[2025-05-30 10:02:31] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 703/706 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/706 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 802/1508 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1938/3446 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3446 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3448 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3448 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3450 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3450 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3452 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3452 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3454 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3454 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3456 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3456 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3458 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3458 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3460 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3460 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3462 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3462 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3464 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3464 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3466 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3466 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3467 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3467 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3467 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3467/3467 variables, and 1523 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4342 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 703/706 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/706 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 802/1508 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1938/3446 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3446 variables, 4/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3446 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3448 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3448 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3450 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3450 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3452 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3454 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3454 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3456 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3456 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3458 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3458 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3460 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3460 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3462 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3462 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3464 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3464 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3466 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3466 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3467/3467 variables, and 1527 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9370ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1519/1519 places, 1948/1948 transitions.
Graph (trivial) has 1851 edges and 1519 vertex of which 693 / 1519 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 889 vertex of which 880 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 880 transition count 648
Reduce places removed 493 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 553 rules applied. Total rules applied 1055 place count 387 transition count 588
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1094 place count 348 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1094 place count 348 transition count 540
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1190 place count 300 transition count 540
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1200 place count 290 transition count 526
Iterating global reduction 3 with 10 rules applied. Total rules applied 1210 place count 290 transition count 526
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 3 with 2 rules applied. Total rules applied 1212 place count 290 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1214 place count 288 transition count 524
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1222 place count 280 transition count 514
Iterating global reduction 5 with 8 rules applied. Total rules applied 1230 place count 280 transition count 514
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1236 place count 280 transition count 508
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1238 place count 278 transition count 496
Iterating global reduction 6 with 2 rules applied. Total rules applied 1240 place count 278 transition count 496
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 1 rules applied. Total rules applied 1241 place count 278 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1242 place count 277 transition count 495
Performed 149 Post agglomeration using F-continuation condition with reduction of 103 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 8 with 298 rules applied. Total rules applied 1540 place count 128 transition count 243
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 8 with 12 rules applied. Total rules applied 1552 place count 128 transition count 231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1554 place count 127 transition count 230
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1557 place count 124 transition count 227
Iterating global reduction 10 with 3 rules applied. Total rules applied 1560 place count 124 transition count 227
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1582 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 10 with 12 rules applied. Total rules applied 1594 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 11 with 66 rules applied. Total rules applied 1660 place count 80 transition count 246
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 11 with 57 rules applied. Total rules applied 1717 place count 80 transition count 189
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 1741 place count 56 transition count 165
Iterating global reduction 12 with 24 rules applied. Total rules applied 1765 place count 56 transition count 165
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 1780 place count 56 transition count 150
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1786 place count 50 transition count 138
Iterating global reduction 13 with 6 rules applied. Total rules applied 1792 place count 50 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1798 place count 50 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 14 with 31 rules applied. Total rules applied 1829 place count 50 transition count 101
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1832 place count 47 transition count 92
Iterating global reduction 14 with 3 rules applied. Total rules applied 1835 place count 47 transition count 92
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1838 place count 44 transition count 89
Iterating global reduction 14 with 3 rules applied. Total rules applied 1841 place count 44 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1847 place count 44 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1850 place count 44 transition count 80
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1853 place count 44 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1856 place count 41 transition count 77
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1858 place count 41 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1859 place count 41 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1860 place count 40 transition count 75
Applied a total of 1860 rules in 54 ms. Remains 40 /1519 variables (removed 1479) and now considering 75/1948 (removed 1873) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 40/1519 places, 75/1948 transitions.
RANDOM walk for 3765 steps (429 resets) in 9 ms. (376 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 12 factoid took 388 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
[2025-05-30 10:02:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 10:02:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:02:42] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2025-05-30 10:02:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 10:02:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:02:44] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2025-05-30 10:02:44] [INFO ] Computed and/alt/rep : 1941/2382/1941 causal constraints (skipped 6 transitions) in 80 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-30 10:02:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 3 out of 1519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1519/1519 places, 1948/1948 transitions.
Applied a total of 0 rules in 55 ms. Remains 1519 /1519 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
[2025-05-30 10:02:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:02:58] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-05-30 10:02:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:02:59] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2025-05-30 10:02:59] [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/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 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 1518/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in LTL mode , in 1 iterations and 61617 ms. Remains : 1519/1519 places, 1948/1948 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2131 edges and 1519 vertex of which 1509 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 127 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (303 resets) in 126 ms. (314 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (94 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (82 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (101 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
[2025-05-30 10:04:00] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 703/706 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/706 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 802/1508 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1938/3446 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3446 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3448 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3448 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3450 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3450 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3452 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3452 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3454 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3454 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3456 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3456 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3458 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3458 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3460 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3460 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3462 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3462 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3464 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3464 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3466 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3466 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3467 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3467 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3467 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3467/3467 variables, and 1523 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4462 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 703/706 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/706 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 802/1508 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1938/3446 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3446 variables, 4/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3446 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3448 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3448 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3450 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3450 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3452 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3454 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3454 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3456 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3456 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3458 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3458 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3460 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3460 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3462 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3462 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3464 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3464 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3466 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3466 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3467/3467 variables, and 1527 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9484ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1519/1519 places, 1948/1948 transitions.
Graph (trivial) has 1851 edges and 1519 vertex of which 693 / 1519 are part of one of the 63 SCC in 2 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 889 vertex of which 880 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 880 transition count 648
Reduce places removed 493 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 553 rules applied. Total rules applied 1055 place count 387 transition count 588
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1094 place count 348 transition count 588
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1094 place count 348 transition count 540
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1190 place count 300 transition count 540
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1200 place count 290 transition count 526
Iterating global reduction 3 with 10 rules applied. Total rules applied 1210 place count 290 transition count 526
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 3 with 2 rules applied. Total rules applied 1212 place count 290 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1214 place count 288 transition count 524
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1222 place count 280 transition count 514
Iterating global reduction 5 with 8 rules applied. Total rules applied 1230 place count 280 transition count 514
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1236 place count 280 transition count 508
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1238 place count 278 transition count 496
Iterating global reduction 6 with 2 rules applied. Total rules applied 1240 place count 278 transition count 496
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 1 rules applied. Total rules applied 1241 place count 278 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1242 place count 277 transition count 495
Performed 149 Post agglomeration using F-continuation condition with reduction of 103 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 8 with 298 rules applied. Total rules applied 1540 place count 128 transition count 243
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 8 with 12 rules applied. Total rules applied 1552 place count 128 transition count 231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1554 place count 127 transition count 230
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1557 place count 124 transition count 227
Iterating global reduction 10 with 3 rules applied. Total rules applied 1560 place count 124 transition count 227
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1582 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 10 with 12 rules applied. Total rules applied 1594 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 11 with 66 rules applied. Total rules applied 1660 place count 80 transition count 246
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 11 with 57 rules applied. Total rules applied 1717 place count 80 transition count 189
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 1741 place count 56 transition count 165
Iterating global reduction 12 with 24 rules applied. Total rules applied 1765 place count 56 transition count 165
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 1780 place count 56 transition count 150
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1786 place count 50 transition count 138
Iterating global reduction 13 with 6 rules applied. Total rules applied 1792 place count 50 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1798 place count 50 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 14 with 31 rules applied. Total rules applied 1829 place count 50 transition count 101
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1832 place count 47 transition count 92
Iterating global reduction 14 with 3 rules applied. Total rules applied 1835 place count 47 transition count 92
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1838 place count 44 transition count 89
Iterating global reduction 14 with 3 rules applied. Total rules applied 1841 place count 44 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1847 place count 44 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1850 place count 44 transition count 80
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1853 place count 44 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1856 place count 41 transition count 77
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1858 place count 41 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1859 place count 41 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1860 place count 40 transition count 75
Applied a total of 1860 rules in 55 ms. Remains 40 /1519 variables (removed 1479) and now considering 75/1948 (removed 1873) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 40/1519 places, 75/1948 transitions.
RANDOM walk for 4426 steps (514 resets) in 11 ms. (368 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 12 factoid took 332 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
[2025-05-30 10:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 10:04:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:04:11] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2025-05-30 10:04:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 10:04:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:04:13] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2025-05-30 10:04:13] [INFO ] Computed and/alt/rep : 1941/2382/1941 causal constraints (skipped 6 transitions) in 74 ms.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25040 reset in 249 ms.
Product exploration explored 100000 steps with 25005 reset in 251 ms.
Built C files in :
/tmp/ltsmin13109411924270335701
[2025-05-30 10:04:27] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13109411924270335701
Running compilation step : cd /tmp/ltsmin13109411924270335701;'/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/ltsmin13109411924270335701;'/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/ltsmin13109411924270335701;'/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 1519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1519/1519 places, 1948/1948 transitions.
Applied a total of 0 rules in 54 ms. Remains 1519 /1519 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
[2025-05-30 10:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:04:31] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-05-30 10:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:04:32] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2025-05-30 10:04:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1518/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Finished structural reductions in LTL mode , in 1 iterations and 61556 ms. Remains : 1519/1519 places, 1948/1948 transitions.
Built C files in :
/tmp/ltsmin6403803045525187817
[2025-05-30 10:05:32] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6403803045525187817
Running compilation step : cd /tmp/ltsmin6403803045525187817;'/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/ltsmin6403803045525187817;'/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/ltsmin6403803045525187817;'/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 10:05:35] [INFO ] Flatten gal took : 52 ms
[2025-05-30 10:05:35] [INFO ] Flatten gal took : 49 ms
[2025-05-30 10:05:35] [INFO ] Time to serialize gal into /tmp/LTL837425716637499904.gal : 14 ms
[2025-05-30 10:05:35] [INFO ] Time to serialize properties into /tmp/LTL9780395706679296130.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/LTL837425716637499904.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3961418959245311269.hoa' '-atoms' '/tmp/LTL9780395706679296130.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...316
Loading property file /tmp/LTL9780395706679296130.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3961418959245311269.hoa
Detected timeout of ITS tools.
[2025-05-30 10:05:50] [INFO ] Flatten gal took : 45 ms
[2025-05-30 10:05:50] [INFO ] Flatten gal took : 45 ms
[2025-05-30 10:05:50] [INFO ] Time to serialize gal into /tmp/LTL3740138323138471478.gal : 9 ms
[2025-05-30 10:05:50] [INFO ] Time to serialize properties into /tmp/LTL2086640622972861659.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3740138323138471478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2086640622972861659.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...275
Read 1 LTL properties
Checking formula 0 : !(((F(("(p26!=1)")&&(X(X("(p1764!=1)")))))U(X(G("(p1866==1)")))))
Formula 0 simplified : G(!"(p26!=1)" | XX!"(p1764!=1)") R XF!"(p1866==1)"
Detected timeout of ITS tools.
[2025-05-30 10:06:06] [INFO ] Flatten gal took : 40 ms
[2025-05-30 10:06:06] [INFO ] Applying decomposition
[2025-05-30 10:06:06] [INFO ] Flatten gal took : 38 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/graph2328989358454488499.txt' '-o' '/tmp/graph2328989358454488499.bin' '-w' '/tmp/graph2328989358454488499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2328989358454488499.bin' '-l' '-1' '-v' '-w' '/tmp/graph2328989358454488499.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:06:06] [INFO ] Decomposing Gal with order
[2025-05-30 10:06:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:06:06] [INFO ] Removed a total of 517 redundant transitions.
[2025-05-30 10:06:06] [INFO ] Flatten gal took : 151 ms
[2025-05-30 10:06:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 33 ms.
[2025-05-30 10:06:06] [INFO ] Time to serialize gal into /tmp/LTL16900526412798306835.gal : 20 ms
[2025-05-30 10:06:06] [INFO ] Time to serialize properties into /tmp/LTL15246874484703139851.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16900526412798306835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15246874484703139851.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(("(i4.u5.p26!=1)")&&(X(X("(i0.i0.i3.u293.p1764!=1)")))))U(X(G("(i28.i0.i5.u435.p1866==1)")))))
Formula 0 simplified : G(!"(i4.u5.p26!=1)" | XX!"(i0.i0.i3.u293.p1764!=1)") R XF!"(i28.i0.i5.u435.p1866==1)"
Reverse transition relation is NOT exact ! Due to transitions t27, t209, t261, t292, t370, t441, t679, t708, t760, t791, t820, t869, t940, t993, t1200, t12...2103
Computing Next relation with stutter on 203776 deadlock states
84 unique states visited
82 strongly connected components in search stack
84 transitions explored
82 items max in DFS search stack
1407 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,14.2637,541504,1,0,1.12455e+06,5342,23034,3.08134e+06,668,23692,1807932
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-318-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-318-LTLFireability-07 finished in 293911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(F(!p0))||(p1&&X(p2)))) U ((!p2&&X((X(F(!p0))||(p1&&X(p2)))))||X(G((X(F(!p0))||(p1&&X(p2))))))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1557 transition count 1999
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1557 transition count 1999
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 1557 transition count 1996
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 1543 transition count 1980
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 1543 transition count 1980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 1543 transition count 1979
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 1533 transition count 1966
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 1533 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 1533 transition count 1965
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 101 place count 1525 transition count 1957
Iterating global reduction 3 with 8 rules applied. Total rules applied 109 place count 1525 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 1525 transition count 1956
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 115 place count 1520 transition count 1951
Iterating global reduction 4 with 5 rules applied. Total rules applied 120 place count 1520 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 124 place count 1516 transition count 1945
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 1516 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 1514 transition count 1941
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 1514 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 1512 transition count 1937
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 1510 transition count 1935
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 1510 transition count 1934
Applied a total of 141 rules in 607 ms. Remains 1510 /1577 variables (removed 67) and now considering 1934/2019 (removed 85) transitions.
// Phase 1: matrix 1934 rows 1510 cols
[2025-05-30 10:06:22] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:06:22] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-05-30 10:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:06:23] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2025-05-30 10:06:23] [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/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 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 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1577 places, 1934/2019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62155 ms. Remains : 1510/1577 places, 1934/2019 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 275 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2117 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND p2 p1 p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 18 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-318-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-318-LTLFireability-08 finished in 63010 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))))'
Support contains 1 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1556 transition count 1998
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1556 transition count 1998
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 1556 transition count 1995
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 1541 transition count 1978
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 1541 transition count 1978
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 1541 transition count 1977
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 1531 transition count 1964
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 1531 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 1531 transition count 1963
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 105 place count 1523 transition count 1955
Iterating global reduction 3 with 8 rules applied. Total rules applied 113 place count 1523 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 1523 transition count 1954
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 119 place count 1518 transition count 1949
Iterating global reduction 4 with 5 rules applied. Total rules applied 124 place count 1518 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 1514 transition count 1943
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 1514 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 1512 transition count 1939
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 1512 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 1510 transition count 1935
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 1508 transition count 1933
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 1508 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 1508 transition count 1932
Applied a total of 145 rules in 593 ms. Remains 1508 /1577 variables (removed 69) and now considering 1932/2019 (removed 87) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2025-05-30 10:07:25] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:07:25] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-05-30 10:07:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:07:26] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 10:07:26] [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, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 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/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1577 places, 1932/2019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62156 ms. Remains : 1508/1577 places, 1932/2019 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-09
Product exploration explored 100000 steps with 793 reset in 127 ms.
Product exploration explored 100000 steps with 779 reset in 134 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2115 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (297 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (89 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 468608 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 468608 steps, saw 130996 distinct states, run finished after 3003 ms. (steps per millisecond=156 ) properties seen :0
[2025-05-30 10:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 291/292 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1497 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1922/3419 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3421 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3421 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3423 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3425 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3440/3440 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1217 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 291/292 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1497 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1922/3419 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3440 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3440/3440 variables, and 1513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1871 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3097ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Graph (trivial) has 1839 edges and 1508 vertex of which 679 / 1508 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 1332 edges and 891 vertex of which 882 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 882 transition count 650
Reduce places removed 493 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 553 rules applied. Total rules applied 1055 place count 389 transition count 590
Reduce places removed 39 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 41 rules applied. Total rules applied 1096 place count 350 transition count 588
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 1099 place count 349 transition count 586
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 4 with 3 rules applied. Total rules applied 1102 place count 348 transition count 584
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1104 place count 347 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1105 place count 346 transition count 583
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 1105 place count 346 transition count 532
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 1207 place count 295 transition count 532
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1218 place count 284 transition count 516
Iterating global reduction 7 with 11 rules applied. Total rules applied 1229 place count 284 transition count 516
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 1232 place count 284 transition count 513
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1235 place count 281 transition count 513
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1242 place count 274 transition count 505
Iterating global reduction 9 with 7 rules applied. Total rules applied 1249 place count 274 transition count 505
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1255 place count 274 transition count 499
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1256 place count 273 transition count 493
Iterating global reduction 10 with 1 rules applied. Total rules applied 1257 place count 273 transition count 493
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 10 with 286 rules applied. Total rules applied 1543 place count 130 transition count 254
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1558 place count 130 transition count 239
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1561 place count 127 transition count 236
Iterating global reduction 11 with 3 rules applied. Total rules applied 1564 place count 127 transition count 236
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 1590 place count 114 transition count 220
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 1605 place count 114 transition count 205
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 1607 place count 113 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1609 place count 113 transition count 202
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 1611 place count 112 transition count 201
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1613 place count 112 transition count 199
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 1681 place count 78 transition count 243
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 14 with 48 rules applied. Total rules applied 1729 place count 78 transition count 195
Discarding 23 places :
Symmetric choice reduction at 15 with 23 rule applications. Total rules 1752 place count 55 transition count 165
Iterating global reduction 15 with 23 rules applied. Total rules applied 1775 place count 55 transition count 165
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 15 with 14 rules applied. Total rules applied 1789 place count 55 transition count 151
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 1795 place count 49 transition count 139
Iterating global reduction 16 with 6 rules applied. Total rules applied 1801 place count 49 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1807 place count 49 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 17 with 20 rules applied. Total rules applied 1827 place count 49 transition count 113
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 1829 place count 47 transition count 107
Iterating global reduction 17 with 2 rules applied. Total rules applied 1831 place count 47 transition count 107
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 1833 place count 45 transition count 105
Iterating global reduction 17 with 2 rules applied. Total rules applied 1835 place count 45 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1839 place count 45 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 1841 place count 45 transition count 99
Free-agglomeration rule applied 3 times.
Iterating global reduction 18 with 3 rules applied. Total rules applied 1844 place count 45 transition count 96
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 1848 place count 42 transition count 95
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 1850 place count 42 transition count 95
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 1851 place count 42 transition count 94
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1852 place count 41 transition count 93
Iterating global reduction 19 with 1 rules applied. Total rules applied 1853 place count 41 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1854 place count 40 transition count 92
Applied a total of 1854 rules in 58 ms. Remains 40 /1508 variables (removed 1468) and now considering 92/1932 (removed 1840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 40/1508 places, 92/1932 transitions.
RANDOM walk for 44 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Applied a total of 0 rules in 60 ms. Remains 1508 /1508 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
[2025-05-30 10:08:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:08:34] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-30 10:08:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:08:35] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 10:08:35] [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/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 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/1508 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/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 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 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Finished structural reductions in LTL mode , in 1 iterations and 61676 ms. Remains : 1508/1508 places, 1932/1932 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2115 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (308 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (86 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 465858 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 465858 steps, saw 129678 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-05-30 10:09:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 291/292 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1497 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1922/3419 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3421 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3421 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3423 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3425 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3440/3440 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1227 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 291/292 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1497 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1922/3419 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3440 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3440/3440 variables, and 1513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1867 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3103ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Graph (trivial) has 1839 edges and 1508 vertex of which 679 / 1508 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 1332 edges and 891 vertex of which 882 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 882 transition count 650
Reduce places removed 493 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 553 rules applied. Total rules applied 1055 place count 389 transition count 590
Reduce places removed 39 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 41 rules applied. Total rules applied 1096 place count 350 transition count 588
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 1099 place count 349 transition count 586
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 4 with 3 rules applied. Total rules applied 1102 place count 348 transition count 584
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1104 place count 347 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1105 place count 346 transition count 583
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 1105 place count 346 transition count 532
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 1207 place count 295 transition count 532
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1218 place count 284 transition count 516
Iterating global reduction 7 with 11 rules applied. Total rules applied 1229 place count 284 transition count 516
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 1232 place count 284 transition count 513
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1235 place count 281 transition count 513
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1242 place count 274 transition count 505
Iterating global reduction 9 with 7 rules applied. Total rules applied 1249 place count 274 transition count 505
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1255 place count 274 transition count 499
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1256 place count 273 transition count 493
Iterating global reduction 10 with 1 rules applied. Total rules applied 1257 place count 273 transition count 493
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 10 with 286 rules applied. Total rules applied 1543 place count 130 transition count 254
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1558 place count 130 transition count 239
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1561 place count 127 transition count 236
Iterating global reduction 11 with 3 rules applied. Total rules applied 1564 place count 127 transition count 236
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 1590 place count 114 transition count 220
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 1605 place count 114 transition count 205
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 1607 place count 113 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1609 place count 113 transition count 202
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 1611 place count 112 transition count 201
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1613 place count 112 transition count 199
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 1681 place count 78 transition count 243
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 14 with 48 rules applied. Total rules applied 1729 place count 78 transition count 195
Discarding 23 places :
Symmetric choice reduction at 15 with 23 rule applications. Total rules 1752 place count 55 transition count 165
Iterating global reduction 15 with 23 rules applied. Total rules applied 1775 place count 55 transition count 165
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 15 with 14 rules applied. Total rules applied 1789 place count 55 transition count 151
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 1795 place count 49 transition count 139
Iterating global reduction 16 with 6 rules applied. Total rules applied 1801 place count 49 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1807 place count 49 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 17 with 20 rules applied. Total rules applied 1827 place count 49 transition count 113
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 1829 place count 47 transition count 107
Iterating global reduction 17 with 2 rules applied. Total rules applied 1831 place count 47 transition count 107
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 1833 place count 45 transition count 105
Iterating global reduction 17 with 2 rules applied. Total rules applied 1835 place count 45 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1839 place count 45 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 1841 place count 45 transition count 99
Free-agglomeration rule applied 3 times.
Iterating global reduction 18 with 3 rules applied. Total rules applied 1844 place count 45 transition count 96
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 1848 place count 42 transition count 95
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 1850 place count 42 transition count 95
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 1851 place count 42 transition count 94
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1852 place count 41 transition count 93
Iterating global reduction 19 with 1 rules applied. Total rules applied 1853 place count 41 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1854 place count 40 transition count 92
Applied a total of 1854 rules in 61 ms. Remains 40 /1508 variables (removed 1468) and now considering 92/1932 (removed 1840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 40/1508 places, 92/1932 transitions.
RANDOM walk for 46 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 775 reset in 121 ms.
Product exploration explored 100000 steps with 797 reset in 127 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Graph (trivial) has 1839 edges and 1508 vertex of which 679 / 1508 are part of one of the 62 SCC in 1 ms
Free SCC test removed 617 places
Ensure Unique test removed 715 transitions
Reduce isomorphic transitions removed 715 transitions.
Graph (complete) has 1394 edges and 891 vertex of which 882 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 480 place count 882 transition count 1212
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 494 place count 882 transition count 1199
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 496 place count 882 transition count 1198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 497 place count 882 transition count 1197
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 497 place count 882 transition count 1212
Deduced a syphon composed of 502 places in 1 ms
Iterating global reduction 4 with 22 rules applied. Total rules applied 519 place count 882 transition count 1212
Discarding 285 places :
Symmetric choice reduction at 4 with 285 rule applications. Total rules 804 place count 597 transition count 918
Deduced a syphon composed of 232 places in 1 ms
Iterating global reduction 4 with 285 rules applied. Total rules applied 1089 place count 597 transition count 918
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1100 place count 586 transition count 904
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1111 place count 586 transition count 904
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1117 place count 586 transition count 898
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1127 place count 576 transition count 888
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 10 rules applied. Total rules applied 1137 place count 576 transition count 888
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1138 place count 575 transition count 886
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1139 place count 575 transition count 886
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1140 place count 574 transition count 884
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1141 place count 574 transition count 884
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1143 place count 572 transition count 882
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1145 place count 572 transition count 882
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1146 place count 571 transition count 880
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1147 place count 571 transition count 880
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1148 place count 570 transition count 878
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1149 place count 570 transition count 878
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1151 place count 568 transition count 875
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1153 place count 568 transition count 875
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1155 place count 566 transition count 867
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1157 place count 566 transition count 867
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1159 place count 564 transition count 865
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1161 place count 564 transition count 865
Performed 113 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 330 places in 1 ms
Iterating global reduction 5 with 113 rules applied. Total rules applied 1274 place count 564 transition count 940
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 1316 place count 564 transition count 898
Discarding 109 places :
Symmetric choice reduction at 6 with 109 rule applications. Total rules 1425 place count 455 transition count 779
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 6 with 109 rules applied. Total rules applied 1534 place count 455 transition count 779
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1540 place count 449 transition count 770
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1546 place count 449 transition count 770
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1553 place count 449 transition count 770
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1558 place count 449 transition count 765
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1573 place count 434 transition count 746
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1588 place count 434 transition count 746
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1594 place count 434 transition count 740
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1598 place count 430 transition count 736
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1602 place count 430 transition count 736
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1605 place count 430 transition count 736
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1611 place count 430 transition count 730
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1614 place count 427 transition count 727
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1617 place count 427 transition count 727
Performed 75 Post agglomeration using F-continuation condition with reduction of 126 identical transitions.
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 9 with 75 rules applied. Total rules applied 1692 place count 427 transition count 1067
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 9 with 125 rules applied. Total rules applied 1817 place count 427 transition count 942
Discarding 132 places :
Symmetric choice reduction at 10 with 132 rule applications. Total rules 1949 place count 295 transition count 593
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 10 with 132 rules applied. Total rules applied 2081 place count 295 transition count 593
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 2096 place count 295 transition count 578
Discarding 27 places :
Symmetric choice reduction at 11 with 27 rule applications. Total rules 2123 place count 268 transition count 521
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 11 with 27 rules applied. Total rules applied 2150 place count 268 transition count 521
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2153 place count 268 transition count 569
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2156 place count 265 transition count 542
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2159 place count 265 transition count 542
Deduced a syphon composed of 142 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 11 with 56 rules applied. Total rules applied 2215 place count 265 transition count 486
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2219 place count 261 transition count 482
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2223 place count 261 transition count 482
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2226 place count 261 transition count 554
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2229 place count 258 transition count 539
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2232 place count 258 transition count 539
Deduced a syphon composed of 138 places in 0 ms
Applied a total of 2232 rules in 305 ms. Remains 258 /1508 variables (removed 1250) and now considering 539/1932 (removed 1393) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:09:43] [INFO ] Redundant transitions in 4 ms returned []
Running 538 sub problems to find dead transitions.
[2025-05-30 10:09:43] [INFO ] Flow matrix only has 479 transitions (discarded 60 similar events)
// Phase 1: matrix 479 rows 258 cols
[2025-05-30 10:09:43] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 10:09:43] [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/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 538 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 TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 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 TDEAD151 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 TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 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 TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 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 TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
At refinement iteration 1 (OVERLAPS) 478/735 variables, 257/257 constraints. Problems are: Problem set: 249 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 4/261 constraints. Problems are: Problem set: 249 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 0/261 constraints. Problems are: Problem set: 249 solved, 289 unsolved
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/736 variables, 1/262 constraints. Problems are: Problem set: 254 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 0/262 constraints. Problems are: Problem set: 254 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 1/737 variables, 1/263 constraints. Problems are: Problem set: 254 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/737 variables, and 263 constraints, problems are : Problem set: 254 solved, 284 unsolved in 30011 ms.
Refiners :[State Equation: 258/258 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 254 solved, 284 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: 254 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 475/594 variables, 119/119 constraints. Problems are: Problem set: 254 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 4/123 constraints. Problems are: Problem set: 254 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 284/407 constraints. Problems are: Problem set: 254 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 0/407 constraints. Problems are: Problem set: 254 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 142/736 variables, 139/546 constraints. Problems are: Problem set: 254 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 0/546 constraints. Problems are: Problem set: 254 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/737 variables, 1/547 constraints. Problems are: Problem set: 254 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 737/737 variables, and 547 constraints, problems are : Problem set: 254 solved, 284 unsolved in 30017 ms.
Refiners :[State Equation: 258/258 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 284/538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 254 solved, 284 unsolved
Search for dead transitions found 254 dead transitions in 60136ms
Found 254 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 254 transitions
Dead transitions reduction (with SMT) removed 254 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 258/1508 places, 285/1932 transitions.
Graph (complete) has 438 edges and 258 vertex of which 120 are kept as prefixes of interest. Removing 138 places using SCC suffix rule.0 ms
Discarding 138 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 120 /258 variables (removed 138) and now considering 285/285 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/1508 places, 285/1932 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60469 ms. Remains : 120/1508 places, 285/1932 transitions.
Built C files in :
/tmp/ltsmin2574371898953488522
[2025-05-30 10:10:43] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2574371898953488522
Running compilation step : cd /tmp/ltsmin2574371898953488522;'/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/ltsmin2574371898953488522;'/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/ltsmin2574371898953488522;'/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 1 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Applied a total of 0 rules in 59 ms. Remains 1508 /1508 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2025-05-30 10:10:46] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:46] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-30 10:10:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:10:47] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2025-05-30 10:10:47] [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, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 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/1508 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/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in LTL mode , in 1 iterations and 61575 ms. Remains : 1508/1508 places, 1932/1932 transitions.
Built C files in :
/tmp/ltsmin1063403087216146771
[2025-05-30 10:11:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1063403087216146771
Running compilation step : cd /tmp/ltsmin1063403087216146771;'/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/ltsmin1063403087216146771;'/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/ltsmin1063403087216146771;'/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 10:11:51] [INFO ] Flatten gal took : 35 ms
[2025-05-30 10:11:51] [INFO ] Flatten gal took : 34 ms
[2025-05-30 10:11:51] [INFO ] Time to serialize gal into /tmp/LTL1617100093111375404.gal : 6 ms
[2025-05-30 10:11:51] [INFO ] Time to serialize properties into /tmp/LTL8004494534759072114.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1617100093111375404.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2662270581076277441.hoa' '-atoms' '/tmp/LTL8004494534759072114.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...317
Loading property file /tmp/LTL8004494534759072114.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2662270581076277441.hoa
Detected timeout of ITS tools.
[2025-05-30 10:12:06] [INFO ] Flatten gal took : 30 ms
[2025-05-30 10:12:06] [INFO ] Flatten gal took : 30 ms
[2025-05-30 10:12:06] [INFO ] Time to serialize gal into /tmp/LTL15592869705884939558.gal : 5 ms
[2025-05-30 10:12:06] [INFO ] Time to serialize properties into /tmp/LTL13485535873973532449.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15592869705884939558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13485535873973532449.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 : !((X(X(G("(p344==0)")))))
Formula 0 simplified : XXF!"(p344==0)"
Detected timeout of ITS tools.
[2025-05-30 10:12:21] [INFO ] Flatten gal took : 42 ms
[2025-05-30 10:12:21] [INFO ] Applying decomposition
[2025-05-30 10:12:21] [INFO ] Flatten gal took : 29 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/graph9095123657308830397.txt' '-o' '/tmp/graph9095123657308830397.bin' '-w' '/tmp/graph9095123657308830397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9095123657308830397.bin' '-l' '-1' '-v' '-w' '/tmp/graph9095123657308830397.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:12:21] [INFO ] Decomposing Gal with order
[2025-05-30 10:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:12:21] [INFO ] Removed a total of 490 redundant transitions.
[2025-05-30 10:12:22] [INFO ] Flatten gal took : 87 ms
[2025-05-30 10:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 22 ms.
[2025-05-30 10:12:22] [INFO ] Time to serialize gal into /tmp/LTL15615363047656632026.gal : 13 ms
[2025-05-30 10:12:22] [INFO ] Time to serialize properties into /tmp/LTL13921848264173616017.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/LTL15615363047656632026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13921848264173616017.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 : !((X(X(G("(i3.u59.p344==0)")))))
Formula 0 simplified : XXF!"(i3.u59.p344==0)"
Reverse transition relation is NOT exact ! Due to transitions t27, t180, t209, t261, t292, t321, t370, t441, t708, t760, t791, t869, t940, t993, t1200, t12...2143
Computing Next relation with stutter on 203776 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
747 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,7.69428,269920,1,0,423853,10298,23331,1.1226e+06,746,78159,1852055
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-318-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-318-LTLFireability-09 finished in 306071 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)&&F(G(p1)))))'
Support contains 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Graph (trivial) has 1923 edges and 1577 vertex of which 701 / 1577 are part of one of the 63 SCC in 1 ms
Free SCC test removed 638 places
Ensure Unique test removed 741 transitions
Reduce isomorphic transitions removed 741 transitions.
Graph (complete) has 1456 edges and 939 vertex of which 929 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 518 rules applied. Total rules applied 520 place count 928 transition count 753
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 545 rules applied. Total rules applied 1065 place count 411 transition count 725
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1079 place count 398 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1080 place count 397 transition count 724
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1080 place count 397 transition count 679
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 1170 place count 352 transition count 679
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1184 place count 338 transition count 656
Iterating global reduction 4 with 14 rules applied. Total rules applied 1198 place count 338 transition count 656
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 4 with 1 rules applied. Total rules applied 1199 place count 338 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1200 place count 337 transition count 655
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1209 place count 328 transition count 642
Iterating global reduction 6 with 9 rules applied. Total rules applied 1218 place count 328 transition count 642
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1223 place count 328 transition count 637
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1225 place count 326 transition count 633
Iterating global reduction 7 with 2 rules applied. Total rules applied 1227 place count 326 transition count 633
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1229 place count 324 transition count 629
Iterating global reduction 7 with 2 rules applied. Total rules applied 1231 place count 324 transition count 629
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1232 place count 323 transition count 627
Iterating global reduction 7 with 1 rules applied. Total rules applied 1233 place count 323 transition count 627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1234 place count 322 transition count 625
Iterating global reduction 7 with 1 rules applied. Total rules applied 1235 place count 322 transition count 625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1236 place count 321 transition count 623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1237 place count 321 transition count 623
Performed 156 Post agglomeration using F-continuation condition with reduction of 100 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 7 with 312 rules applied. Total rules applied 1549 place count 165 transition count 367
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1559 place count 165 transition count 357
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1565 place count 159 transition count 346
Iterating global reduction 8 with 6 rules applied. Total rules applied 1571 place count 159 transition count 346
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1572 place count 158 transition count 345
Iterating global reduction 8 with 1 rules applied. Total rules applied 1573 place count 158 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1574 place count 158 transition count 344
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1596 place count 147 transition count 332
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1606 place count 147 transition count 322
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1607 place count 146 transition count 320
Iterating global reduction 10 with 1 rules applied. Total rules applied 1608 place count 146 transition count 320
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1642 place count 129 transition count 372
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 1665 place count 129 transition count 349
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1674 place count 120 transition count 331
Iterating global reduction 11 with 9 rules applied. Total rules applied 1683 place count 120 transition count 331
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1689 place count 120 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 12 with 39 rules applied. Total rules applied 1728 place count 120 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1729 place count 119 transition count 285
Applied a total of 1729 rules in 91 ms. Remains 119 /1577 variables (removed 1458) and now considering 285/2019 (removed 1734) transitions.
[2025-05-30 10:12:31] [INFO ] Flow matrix only has 226 transitions (discarded 59 similar events)
// Phase 1: matrix 226 rows 119 cols
[2025-05-30 10:12:31] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-30 10:12:31] [INFO ] Flow matrix only has 226 transitions (discarded 59 similar events)
[2025-05-30 10:12:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 10:12:31] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 244 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1577 places, 285/2019 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 117 transition count 284
Applied a total of 2 rules in 3 ms. Remains 117 /118 variables (removed 1) and now considering 284/285 (removed 1) transitions.
[2025-05-30 10:12:31] [INFO ] Flow matrix only has 225 transitions (discarded 59 similar events)
// Phase 1: matrix 225 rows 117 cols
[2025-05-30 10:12:31] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 10:12:31] [INFO ] Flow matrix only has 225 transitions (discarded 59 similar events)
[2025-05-30 10:12:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 10:12:31] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1577 places, 284/2019 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 500 ms. Remains : 117/1577 places, 284/2019 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-318-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-318-LTLFireability-12 finished in 612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Graph (trivial) has 1923 edges and 1577 vertex of which 702 / 1577 are part of one of the 63 SCC in 2 ms
Free SCC test removed 639 places
Ensure Unique test removed 743 transitions
Reduce isomorphic transitions removed 743 transitions.
Graph (complete) has 1454 edges and 938 vertex of which 928 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 518 rules applied. Total rules applied 520 place count 927 transition count 751
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 545 rules applied. Total rules applied 1065 place count 410 transition count 723
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1078 place count 397 transition count 723
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1078 place count 397 transition count 678
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1168 place count 352 transition count 678
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1182 place count 338 transition count 655
Iterating global reduction 3 with 14 rules applied. Total rules applied 1196 place count 338 transition count 655
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 1 rules applied. Total rules applied 1197 place count 338 transition count 654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1198 place count 337 transition count 654
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1207 place count 328 transition count 641
Iterating global reduction 5 with 9 rules applied. Total rules applied 1216 place count 328 transition count 641
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1221 place count 328 transition count 636
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1223 place count 326 transition count 632
Iterating global reduction 6 with 2 rules applied. Total rules applied 1225 place count 326 transition count 632
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1227 place count 324 transition count 628
Iterating global reduction 6 with 2 rules applied. Total rules applied 1229 place count 324 transition count 628
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1231 place count 322 transition count 624
Iterating global reduction 6 with 2 rules applied. Total rules applied 1233 place count 322 transition count 624
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1235 place count 320 transition count 620
Iterating global reduction 6 with 2 rules applied. Total rules applied 1237 place count 320 transition count 620
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1239 place count 318 transition count 616
Iterating global reduction 6 with 2 rules applied. Total rules applied 1241 place count 318 transition count 616
Performed 154 Post agglomeration using F-continuation condition with reduction of 99 identical transitions.
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 6 with 308 rules applied. Total rules applied 1549 place count 164 transition count 363
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1559 place count 164 transition count 353
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1566 place count 157 transition count 337
Iterating global reduction 7 with 7 rules applied. Total rules applied 1573 place count 157 transition count 337
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1574 place count 156 transition count 336
Iterating global reduction 7 with 1 rules applied. Total rules applied 1575 place count 156 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1576 place count 156 transition count 335
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1598 place count 145 transition count 323
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1609 place count 145 transition count 312
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1643 place count 128 transition count 346
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1659 place count 128 transition count 330
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1668 place count 119 transition count 312
Iterating global reduction 10 with 9 rules applied. Total rules applied 1677 place count 119 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1683 place count 119 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 11 with 33 rules applied. Total rules applied 1716 place count 119 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1717 place count 118 transition count 272
Applied a total of 1717 rules in 78 ms. Remains 118 /1577 variables (removed 1459) and now considering 272/2019 (removed 1747) transitions.
[2025-05-30 10:12:31] [INFO ] Flow matrix only has 213 transitions (discarded 59 similar events)
// Phase 1: matrix 213 rows 118 cols
[2025-05-30 10:12:31] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-30 10:12:31] [INFO ] Flow matrix only has 213 transitions (discarded 59 similar events)
[2025-05-30 10:12:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:12:31] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 187 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1577 places, 272/2019 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 116 transition count 271
Applied a total of 2 rules in 7 ms. Remains 116 /117 variables (removed 1) and now considering 271/272 (removed 1) transitions.
[2025-05-30 10:12:31] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
// Phase 1: matrix 212 rows 116 cols
[2025-05-30 10:12:31] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:31] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 10:12:31] [INFO ] Flow matrix only has 212 transitions (discarded 59 similar events)
[2025-05-30 10:12:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:12:32] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1577 places, 271/2019 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 441 ms. Remains : 116/1577 places, 271/2019 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-318-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-318-LTLFireability-13 finished in 543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 2019/2019 transitions.
Graph (trivial) has 1926 edges and 1577 vertex of which 702 / 1577 are part of one of the 63 SCC in 1 ms
Free SCC test removed 639 places
Ensure Unique test removed 743 transitions
Reduce isomorphic transitions removed 743 transitions.
Graph (complete) has 1454 edges and 938 vertex of which 928 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 518 rules applied. Total rules applied 520 place count 927 transition count 751
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 545 rules applied. Total rules applied 1065 place count 410 transition count 723
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1078 place count 397 transition count 723
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1078 place count 397 transition count 678
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1168 place count 352 transition count 678
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1182 place count 338 transition count 655
Iterating global reduction 3 with 14 rules applied. Total rules applied 1196 place count 338 transition count 655
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 1 rules applied. Total rules applied 1197 place count 338 transition count 654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1198 place count 337 transition count 654
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1207 place count 328 transition count 641
Iterating global reduction 5 with 9 rules applied. Total rules applied 1216 place count 328 transition count 641
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1221 place count 328 transition count 636
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1223 place count 326 transition count 632
Iterating global reduction 6 with 2 rules applied. Total rules applied 1225 place count 326 transition count 632
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1227 place count 324 transition count 628
Iterating global reduction 6 with 2 rules applied. Total rules applied 1229 place count 324 transition count 628
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1231 place count 322 transition count 624
Iterating global reduction 6 with 2 rules applied. Total rules applied 1233 place count 322 transition count 624
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1235 place count 320 transition count 620
Iterating global reduction 6 with 2 rules applied. Total rules applied 1237 place count 320 transition count 620
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1239 place count 318 transition count 616
Iterating global reduction 6 with 2 rules applied. Total rules applied 1241 place count 318 transition count 616
Performed 156 Post agglomeration using F-continuation condition with reduction of 99 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 6 with 312 rules applied. Total rules applied 1553 place count 162 transition count 361
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1563 place count 162 transition count 351
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1570 place count 155 transition count 335
Iterating global reduction 7 with 7 rules applied. Total rules applied 1577 place count 155 transition count 335
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1578 place count 154 transition count 334
Iterating global reduction 7 with 1 rules applied. Total rules applied 1579 place count 154 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1580 place count 154 transition count 333
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1602 place count 143 transition count 321
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1613 place count 143 transition count 310
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1647 place count 126 transition count 356
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1664 place count 126 transition count 339
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1673 place count 117 transition count 321
Iterating global reduction 10 with 9 rules applied. Total rules applied 1682 place count 117 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1688 place count 117 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 1724 place count 117 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1725 place count 116 transition count 278
Applied a total of 1725 rules in 72 ms. Remains 116 /1577 variables (removed 1461) and now considering 278/2019 (removed 1741) transitions.
[2025-05-30 10:12:32] [INFO ] Flow matrix only has 219 transitions (discarded 59 similar events)
// Phase 1: matrix 219 rows 116 cols
[2025-05-30 10:12:32] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 10:12:32] [INFO ] Flow matrix only has 219 transitions (discarded 59 similar events)
[2025-05-30 10:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:12:32] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 182 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1577 places, 278/2019 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 114 transition count 277
Applied a total of 2 rules in 5 ms. Remains 114 /115 variables (removed 1) and now considering 277/278 (removed 1) transitions.
[2025-05-30 10:12:32] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
// Phase 1: matrix 218 rows 114 cols
[2025-05-30 10:12:32] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-30 10:12:32] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
[2025-05-30 10:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:12:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 10:12:32] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1577 places, 277/2019 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 ms. Remains : 114/1577 places, 277/2019 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-318-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-318-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-318-LTLFireability-15 finished in 530 ms.
All properties solved by simple procedures.
Total runtime 977438 ms.

BK_STOP 1748599952669

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

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