Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 7.0K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 560K Jun 5 20:08 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 Champagne-PT-H10T2O-LTLFireability-00
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-01
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-02
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-03
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-04
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-05
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-06
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-07
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-08
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-09
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-10
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-11
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-12
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-13
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-14
FORMULA_NAME Champagne-PT-H10T2O-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749336714686

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H10T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 22:51:55] [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-06-07 22:51:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 22:51:56] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-06-07 22:51:56] [INFO ] Transformed 2393 places.
[2025-06-07 22:51:56] [INFO ] Transformed 3452 transitions.
[2025-06-07 22:51:56] [INFO ] Found NUPN structural information;
[2025-06-07 22:51:56] [INFO ] Parsed PT model containing 2393 places and 3452 transitions and 8894 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H10T2O-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H10T2O-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H10T2O-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 2393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2393/2393 places, 3452/3452 transitions.
Discarding 438 places :
Symmetric choice reduction at 0 with 438 rule applications. Total rules 438 place count 1955 transition count 3014
Iterating global reduction 0 with 438 rules applied. Total rules applied 876 place count 1955 transition count 3014
Discarding 305 places :
Symmetric choice reduction at 0 with 305 rule applications. Total rules 1181 place count 1650 transition count 2709
Iterating global reduction 0 with 305 rules applied. Total rules applied 1486 place count 1650 transition count 2709
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 1665 place count 1471 transition count 2530
Iterating global reduction 0 with 179 rules applied. Total rules applied 1844 place count 1471 transition count 2530
Applied a total of 1844 rules in 682 ms. Remains 1471 /2393 variables (removed 922) and now considering 2530/3452 (removed 922) transitions.
// Phase 1: matrix 2530 rows 1471 cols
[2025-06-07 22:51:57] [INFO ] Computed 63 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:51:57] [INFO ] Implicit Places using invariants in 914 ms returned []
[2025-06-07 22:51:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:51:59] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
Running 2529 sub problems to find dead transitions.
[2025-06-07 22:51:59] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1470/4001 variables, and 0 constraints, problems are : Problem set: 0 solved, 2529 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1471 constraints, PredecessorRefiner: 2529/2528 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2529 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/4001 variables, and 0 constraints, problems are : Problem set: 0 solved, 2529 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1471 constraints, PredecessorRefiner: 1/2528 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61080ms problems are : Problem set: 0 solved, 2529 unsolved
Search for dead transitions found 0 dead transitions in 61104ms
Starting structural reductions in LTL mode, iteration 1 : 1471/2393 places, 2530/3452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63799 ms. Remains : 1471/2393 places, 2530/3452 transitions.
Support contains 40 out of 1471 places after structural reductions.
[2025-06-07 22:53:00] [INFO ] Flatten gal took : 160 ms
[2025-06-07 22:53:00] [INFO ] Flatten gal took : 100 ms
[2025-06-07 22:53:00] [INFO ] Input system was already deterministic with 2530 transitions.
Reduction of identical properties reduced properties to check from 34 to 32
RANDOM walk for 40000 steps (21 resets) in 1996 ms. (20 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
[2025-06-07 22:53:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 116/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1351/1471 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1471 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2530/4001 variables, 1471/1534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4001 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/4001 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4001/4001 variables, and 1534 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 1471/1471 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 116/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1351/1471 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1471 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2530/4001 variables, 1471/1534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4001 variables, 2/1536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4001 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4001 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4001/4001 variables, and 1536 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 1471/1471 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2915ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 210 ms.
Support contains 1 out of 1471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Graph (trivial) has 1563 edges and 1471 vertex of which 952 / 1471 are part of one of the 63 SCC in 6 ms
Free SCC test removed 889 places
Drop transitions (Empty/Sink Transition effects.) removed 1047 transitions
Reduce isomorphic transitions removed 1047 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 171 place count 582 transition count 1313
Reduce places removed 170 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 290 rules applied. Total rules applied 461 place count 412 transition count 1193
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 521 place count 352 transition count 1193
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 572 place count 301 transition count 749
Iterating global reduction 3 with 51 rules applied. Total rules applied 623 place count 301 transition count 749
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 671 place count 301 transition count 701
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 913 place count 180 transition count 580
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 914 place count 179 transition count 570
Iterating global reduction 4 with 1 rules applied. Total rules applied 915 place count 179 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 916 place count 179 transition count 569
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 922 place count 176 transition count 576
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 926 place count 176 transition count 572
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 930 place count 176 transition count 568
Free-agglomeration rule applied 108 times.
Iterating global reduction 6 with 108 rules applied. Total rules applied 1038 place count 176 transition count 460
Reduce places removed 108 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 448 transitions
Reduce isomorphic transitions removed 448 transitions.
Graph (complete) has 203 edges and 68 vertex of which 7 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 6 with 557 rules applied. Total rules applied 1595 place count 7 transition count 8
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1597 place count 7 transition count 6
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1599 place count 5 transition count 4
Iterating global reduction 8 with 2 rules applied. Total rules applied 1601 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1602 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1603 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1603 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1605 place count 2 transition count 2
Applied a total of 1605 rules in 148 ms. Remains 2 /1471 variables (removed 1469) and now considering 2/2530 (removed 2528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 2/1471 places, 2/2530 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Computed a total of 66 stabilizing places and 66 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p0)||(X(p1)&&(!p2 U (p3||G(!p2)))))))'
Support contains 8 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1458 transition count 2517
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1458 transition count 2517
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1451 transition count 2510
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1451 transition count 2510
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1450 transition count 2509
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1450 transition count 2509
Applied a total of 42 rules in 176 ms. Remains 1450 /1471 variables (removed 21) and now considering 2509/2530 (removed 21) transitions.
// Phase 1: matrix 2509 rows 1450 cols
[2025-06-07 22:53:05] [INFO ] Computed 63 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:53:05] [INFO ] Implicit Places using invariants in 459 ms returned []
[2025-06-07 22:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:53:06] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
Running 2508 sub problems to find dead transitions.
[2025-06-07 22:53:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 2508/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2508 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 1/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60848ms problems are : Problem set: 0 solved, 2508 unsolved
Search for dead transitions found 0 dead transitions in 60856ms
Starting structural reductions in LTL mode, iteration 1 : 1450/1471 places, 2509/2530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62379 ms. Remains : 1450/1471 places, 2509/2530 transitions.
Stuttering acceptance computed with spot in 440 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p3) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 602 ms.
Product exploration explored 100000 steps with 50000 reset in 494 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND p0 p3 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 27 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H10T2O-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H10T2O-LTLFireability-00 finished in 64092 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) U G((F(p1) U X(p2)))))))'
Support contains 3 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1460 transition count 2519
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1460 transition count 2519
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1453 transition count 2512
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1453 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1452 transition count 2511
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1452 transition count 2511
Applied a total of 38 rules in 212 ms. Remains 1452 /1471 variables (removed 19) and now considering 2511/2530 (removed 19) transitions.
// Phase 1: matrix 2511 rows 1452 cols
[2025-06-07 22:54:09] [INFO ] Computed 63 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:54:10] [INFO ] Implicit Places using invariants in 448 ms returned []
[2025-06-07 22:54:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:54:11] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
Running 2510 sub problems to find dead transitions.
[2025-06-07 22:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1451/3963 variables, and 0 constraints, problems are : Problem set: 0 solved, 2510 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1452 constraints, PredecessorRefiner: 2510/2509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2510 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1451/3963 variables, and 0 constraints, problems are : Problem set: 0 solved, 2510 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1452 constraints, PredecessorRefiner: 1/2509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60817ms problems are : Problem set: 0 solved, 2510 unsolved
Search for dead transitions found 0 dead transitions in 60837ms
Starting structural reductions in LTL mode, iteration 1 : 1452/1471 places, 2511/2530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62509 ms. Remains : 1452/1471 places, 2511/2530 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-01
Product exploration explored 100000 steps with 22224 reset in 270 ms.
Product exploration explored 100000 steps with 22229 reset in 273 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/1452 stabilizing places and 63/2511 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 129 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
RANDOM walk for 27877 steps (13 resets) in 185 ms. (149 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p2)), (F p1), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 271 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 301 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 2 out of 1452 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 2511/2511 transitions.
Applied a total of 0 rules in 59 ms. Remains 1452 /1452 variables (removed 0) and now considering 2511/2511 (removed 0) transitions.
[2025-06-07 22:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:55:14] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-06-07 22:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:55:15] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
Running 2510 sub problems to find dead transitions.
[2025-06-07 22:55:15] [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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 timeout
1.0)
(s662 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1451/3963 variables, and 0 constraints, problems are : Problem set: 0 solved, 2510 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1452 constraints, PredecessorRefiner: 2510/2509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2510 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1451/3963 variables, and 0 constraints, problems are : Problem set: 0 solved, 2510 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1452 constraints, PredecessorRefiner: 1/2509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60893ms problems are : Problem set: 0 solved, 2510 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Finished structural reductions in LTL mode , in 1 iterations and 62404 ms. Remains : 1452/1452 places, 2511/2511 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
RANDOM walk for 15270 steps (5 resets) in 147 ms. (103 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p2)), (F p1), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 22257 reset in 284 ms.
Product exploration explored 100000 steps with 22258 reset in 275 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 2 out of 1452 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1452/1452 places, 2511/2511 transitions.
Graph (trivial) has 1543 edges and 1452 vertex of which 939 / 1452 are part of one of the 63 SCC in 5 ms
Free SCC test removed 876 places
Ensure Unique test removed 970 transitions
Reduce isomorphic transitions removed 970 transitions.
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 161 rules applied. Total rules applied 162 place count 576 transition count 1541
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 223 place count 576 transition count 1480
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 223 place count 576 transition count 1480
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 285 place count 576 transition count 1480
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 396 place count 465 transition count 985
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 507 place count 465 transition count 985
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 554 place count 465 transition count 938
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 601 place count 418 transition count 891
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 3 with 47 rules applied. Total rules applied 648 place count 418 transition count 891
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 236 places in 0 ms
Iterating global reduction 3 with 123 rules applied. Total rules applied 771 place count 418 transition count 891
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 833 place count 356 transition count 829
Deduced a syphon composed of 174 places in 0 ms
Iterating global reduction 3 with 62 rules applied. Total rules applied 895 place count 356 transition count 829
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 896 place count 356 transition count 841
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 897 place count 355 transition count 839
Deduced a syphon composed of 174 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 898 place count 355 transition count 839
Deduced a syphon composed of 174 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 908 place count 355 transition count 829
Deduced a syphon composed of 174 places in 0 ms
Applied a total of 908 rules in 234 ms. Remains 355 /1452 variables (removed 1097) and now considering 829/2511 (removed 1682) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:56:19] [INFO ] Redundant transitions in 40 ms returned []
Running 828 sub problems to find dead transitions.
[2025-06-07 22:56:19] [INFO ] Flow matrix only has 347 transitions (discarded 482 similar events)
// Phase 1: matrix 347 rows 355 cols
[2025-06-07 22:56:19] [INFO ] Computed 63 invariants in 4 ms
[2025-06-07 22:56:19] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:32] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:32] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:32] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:32] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:32] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 20/83 constraints. Problems are: Problem set: 60 solved, 768 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:35] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD148 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 20/103 constraints. Problems are: Problem set: 122 solved, 706 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD197 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD206 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD208 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD218 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Problem TDEAD224 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 20/123 constraints. Problems are: Problem set: 170 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:41] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Problem TDEAD228 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD230 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:56:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD314 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 3/126 constraints. Problems are: Problem set: 175 solved, 653 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 Real declared 355/702 variables, and 126 constraints, problems are : Problem set: 175 solved, 653 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/355 constraints, ReadFeed: 0/52 constraints, PredecessorRefiner: 828/827 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 175 solved, 653 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 175 solved, 653 unsolved
At refinement iteration 1 (OVERLAPS) 175/355 variables, 63/63 constraints. Problems are: Problem set: 175 solved, 653 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 63/126 constraints. Problems are: Problem set: 175 solved, 653 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/126 constraints. Problems are: Problem set: 175 solved, 653 unsolved
At refinement iteration 4 (OVERLAPS) 346/701 variables, 355/481 constraints. Problems are: Problem set: 175 solved, 653 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 51/532 constraints. Problems are: Problem set: 175 solved, 653 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 652/1184 constraints. Problems are: Problem set: 175 solved, 653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/702 variables, and 1184 constraints, problems are : Problem set: 175 solved, 653 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 355/355 constraints, ReadFeed: 51/52 constraints, PredecessorRefiner: 653/827 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 175 solved, 653 unsolved
Search for dead transitions found 175 dead transitions in 60232ms
Found 175 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 175 transitions
Dead transitions reduction (with SMT) removed 175 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 355/1452 places, 654/2511 transitions.
Graph (complete) has 5206 edges and 355 vertex of which 181 are kept as prefixes of interest. Removing 174 places using SCC suffix rule.3 ms
Discarding 174 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 181 /355 variables (removed 174) and now considering 654/654 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 181/1452 places, 654/2511 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60536 ms. Remains : 181/1452 places, 654/2511 transitions.
Built C files in :
/tmp/ltsmin2218063099399682345
[2025-06-07 22:57:19] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2218063099399682345
Running compilation step : cd /tmp/ltsmin2218063099399682345;'/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/ltsmin2218063099399682345;'/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/ltsmin2218063099399682345;'/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 2 out of 1452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1452/1452 places, 2511/2511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1451 transition count 2510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1451 transition count 2510
Applied a total of 2 rules in 67 ms. Remains 1451 /1452 variables (removed 1) and now considering 2510/2511 (removed 1) transitions.
// Phase 1: matrix 2510 rows 1451 cols
[2025-06-07 22:57:22] [INFO ] Computed 63 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:57:23] [INFO ] Implicit Places using invariants in 636 ms returned []
[2025-06-07 22:57:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:57:24] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
Running 2509 sub problems to find dead transitions.
[2025-06-07 22:57:24] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1450/3961 variables, and 0 constraints, problems are : Problem set: 0 solved, 2509 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1451 constraints, PredecessorRefiner: 2509/2508 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1450/3961 variables, and 0 constraints, problems are : Problem set: 0 solved, 2509 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1451 constraints, PredecessorRefiner: 1/2508 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60817ms problems are : Problem set: 0 solved, 2509 unsolved
Search for dead transitions found 0 dead transitions in 60821ms
Starting structural reductions in LTL mode, iteration 1 : 1451/1452 places, 2510/2511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62413 ms. Remains : 1451/1452 places, 2510/2511 transitions.
Built C files in :
/tmp/ltsmin343159937326870096
[2025-06-07 22:58:25] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin343159937326870096
Running compilation step : cd /tmp/ltsmin343159937326870096;'/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/ltsmin343159937326870096;'/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/ltsmin343159937326870096;'/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-06-07 22:58:28] [INFO ] Flatten gal took : 66 ms
[2025-06-07 22:58:28] [INFO ] Flatten gal took : 61 ms
[2025-06-07 22:58:28] [INFO ] Time to serialize gal into /tmp/LTL11715162496684227503.gal : 22 ms
[2025-06-07 22:58:28] [INFO ] Time to serialize properties into /tmp/LTL18012366269732487817.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/LTL11715162496684227503.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12545370882161265408.hoa' '-atoms' '/tmp/LTL18012366269732487817.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...320
Loading property file /tmp/LTL18012366269732487817.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12545370882161265408.hoa
Detected timeout of ITS tools.
[2025-06-07 22:58:43] [INFO ] Flatten gal took : 54 ms
[2025-06-07 22:58:43] [INFO ] Flatten gal took : 54 ms
[2025-06-07 22:58:43] [INFO ] Time to serialize gal into /tmp/LTL1619036444390137998.gal : 10 ms
[2025-06-07 22:58:43] [INFO ] Time to serialize properties into /tmp/LTL4118321292787178847.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1619036444390137998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4118321292787178847.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 : !((X(X((G("(p14==1)"))U(G((F("(p1613==1)"))U(X("(p1504!=1)"))))))))
Formula 0 simplified : XX(F!"(p14==1)" R F(G!"(p1613==1)" R X!"(p1504!=1)"))
Detected timeout of ITS tools.
[2025-06-07 22:58:58] [INFO ] Flatten gal took : 51 ms
[2025-06-07 22:58:58] [INFO ] Applying decomposition
[2025-06-07 22:58:58] [INFO ] Flatten gal took : 50 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/graph12689185359858041773.txt' '-o' '/tmp/graph12689185359858041773.bin' '-w' '/tmp/graph12689185359858041773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12689185359858041773.bin' '-l' '-1' '-v' '-w' '/tmp/graph12689185359858041773.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:58:59] [INFO ] Decomposing Gal with order
[2025-06-07 22:58:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:58:59] [INFO ] Removed a total of 2062 redundant transitions.
[2025-06-07 22:58:59] [INFO ] Flatten gal took : 174 ms
[2025-06-07 22:58:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 62 ms.
[2025-06-07 22:58:59] [INFO ] Time to serialize gal into /tmp/LTL665559076328243289.gal : 25 ms
[2025-06-07 22:58:59] [INFO ] Time to serialize properties into /tmp/LTL16398138006163916259.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/LTL665559076328243289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16398138006163916259.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(i1.u6.p14==1)"))U(G((F("(i42.u404.p1613==1)"))U(X("(i39.u375.p1504!=1)"))))))))
Formula 0 simplified : XX(F!"(i1.u6.p14==1)" R F(G!"(i42.u404.p1613==1)" R X!"(i39.u375.p1504!=1)"))
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H10T2O-LTLFireability-01 finished in 305449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1&&X(F(p2))))))'
Support contains 3 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1459 transition count 2518
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1459 transition count 2518
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1451 transition count 2510
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1451 transition count 2510
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1450 transition count 2509
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1450 transition count 2509
Applied a total of 42 rules in 174 ms. Remains 1450 /1471 variables (removed 21) and now considering 2509/2530 (removed 21) transitions.
// Phase 1: matrix 2509 rows 1450 cols
[2025-06-07 22:59:15] [INFO ] Computed 63 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:59:15] [INFO ] Implicit Places using invariants in 488 ms returned []
[2025-06-07 22:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:59:16] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
Running 2508 sub problems to find dead transitions.
[2025-06-07 22:59:16] [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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 2508/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2508 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 1/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60750ms problems are : Problem set: 0 solved, 2508 unsolved
Search for dead transitions found 0 dead transitions in 60754ms
Starting structural reductions in LTL mode, iteration 1 : 1450/1471 places, 2509/2530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62424 ms. Remains : 1450/1471 places, 2509/2530 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-03 finished in 62758 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)&&X(G(p1))))))'
Support contains 3 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1457 transition count 2516
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1457 transition count 2516
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1449 transition count 2508
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1449 transition count 2508
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1448 transition count 2507
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1448 transition count 2507
Applied a total of 46 rules in 215 ms. Remains 1448 /1471 variables (removed 23) and now considering 2507/2530 (removed 23) transitions.
// Phase 1: matrix 2507 rows 1448 cols
[2025-06-07 23:00:17] [INFO ] Computed 63 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:00:18] [INFO ] Implicit Places using invariants in 469 ms returned []
[2025-06-07 23:00:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:00:19] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
Running 2506 sub problems to find dead transitions.
[2025-06-07 23:00:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1447/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2506 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1448 constraints, PredecessorRefiner: 2506/2505 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2506 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1447/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2506 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1448 constraints, PredecessorRefiner: 1/2505 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60762ms problems are : Problem set: 0 solved, 2506 unsolved
Search for dead transitions found 0 dead transitions in 60766ms
Starting structural reductions in LTL mode, iteration 1 : 1448/1471 places, 2507/2530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62375 ms. Remains : 1448/1471 places, 2507/2530 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-04 finished in 62611 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(G((p0||X((F(p1) U X((!p1&&X(p2)))))))))'
Support contains 3 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1459 transition count 2518
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1459 transition count 2518
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 1452 transition count 2511
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 1452 transition count 2511
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1451 transition count 2510
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1451 transition count 2510
Applied a total of 40 rules in 204 ms. Remains 1451 /1471 variables (removed 20) and now considering 2510/2530 (removed 20) transitions.
// Phase 1: matrix 2510 rows 1451 cols
[2025-06-07 23:01:20] [INFO ] Computed 63 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:01:20] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-06-07 23:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:01:21] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
Running 2509 sub problems to find dead transitions.
[2025-06-07 23:01:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s44 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1450/3961 variables, and 0 constraints, problems are : Problem set: 0 solved, 2509 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1451 constraints, PredecessorRefiner: 2509/2508 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1450/3961 variables, and 0 constraints, problems are : Problem set: 0 solved, 2509 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1451 constraints, PredecessorRefiner: 1/2508 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60819ms problems are : Problem set: 0 solved, 2509 unsolved
Search for dead transitions found 0 dead transitions in 60823ms
Starting structural reductions in LTL mode, iteration 1 : 1451/1471 places, 2510/2530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62442 ms. Remains : 1451/1471 places, 2510/2530 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (OR (NOT p2) p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-05
Stuttering criterion allowed to conclude after 1280 steps with 0 reset in 9 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-05 finished in 62794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Graph (trivial) has 1560 edges and 1471 vertex of which 948 / 1471 are part of one of the 64 SCC in 1 ms
Free SCC test removed 884 places
Ensure Unique test removed 976 transitions
Reduce isomorphic transitions removed 976 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 173 place count 586 transition count 1381
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 293 rules applied. Total rules applied 466 place count 414 transition count 1260
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 526 place count 354 transition count 1260
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 577 place count 303 transition count 828
Iterating global reduction 3 with 51 rules applied. Total rules applied 628 place count 303 transition count 828
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 676 place count 303 transition count 780
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 918 place count 182 transition count 659
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 919 place count 181 transition count 649
Iterating global reduction 4 with 1 rules applied. Total rules applied 920 place count 181 transition count 649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 921 place count 181 transition count 648
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 923 place count 179 transition count 646
Applied a total of 923 rules in 64 ms. Remains 179 /1471 variables (removed 1292) and now considering 646/2530 (removed 1884) transitions.
[2025-06-07 23:02:23] [INFO ] Flow matrix only has 182 transitions (discarded 464 similar events)
// Phase 1: matrix 182 rows 179 cols
[2025-06-07 23:02:23] [INFO ] Computed 63 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-07 23:02:23] [INFO ] Flow matrix only has 182 transitions (discarded 464 similar events)
[2025-06-07 23:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:02:23] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:02:23] [INFO ] Redundant transitions in 5 ms returned []
Running 471 sub problems to find dead transitions.
[2025-06-07 23:02:23] [INFO ] Flow matrix only has 182 transitions (discarded 464 similar events)
[2025-06-07 23:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 181/360 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (OVERLAPS) 0/360 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 471 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/361 variables, and 242 constraints, problems are : Problem set: 0 solved, 471 unsolved in 20725 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 471/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 181/360 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 470/712 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 471 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/361 variables, and 712 constraints, problems are : Problem set: 0 solved, 471 unsolved in 21539 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 471/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42323ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 42324ms
Starting structural reductions in SI_LTL mode, iteration 1 : 179/1471 places, 646/2530 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42723 ms. Remains : 179/1471 places, 646/2530 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-07 finished in 42783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X((F(p1)||G(p0))))) U X((p2||G(!p0)))))'
Support contains 3 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1458 transition count 2517
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1458 transition count 2517
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1451 transition count 2510
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1451 transition count 2510
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1450 transition count 2509
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1450 transition count 2509
Applied a total of 42 rules in 210 ms. Remains 1450 /1471 variables (removed 21) and now considering 2509/2530 (removed 21) transitions.
// Phase 1: matrix 2509 rows 1450 cols
[2025-06-07 23:03:06] [INFO ] Computed 63 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:06] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-06-07 23:03:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:03:07] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
Running 2508 sub problems to find dead transitions.
[2025-06-07 23:03:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s643 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 2508/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2508 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 1/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60804ms problems are : Problem set: 0 solved, 2508 unsolved
Search for dead transitions found 0 dead transitions in 60808ms
Starting structural reductions in LTL mode, iteration 1 : 1450/1471 places, 2509/2530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62432 ms. Remains : 1450/1471 places, 2509/2530 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-08
Product exploration explored 100000 steps with 33419 reset in 365 ms.
Product exploration explored 100000 steps with 33226 reset in 421 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/1450 stabilizing places and 62/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 160 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 35608 steps (16 resets) in 307 ms. (115 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 589 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 318 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
[2025-06-07 23:04:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:04:11] [INFO ] [Real]Absence check using 63 positive place invariants in 33 ms returned sat
[2025-06-07 23:04:12] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2025-06-07 23:04:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:04:13] [INFO ] [Nat]Absence check using 63 positive place invariants in 31 ms returned sat
[2025-06-07 23:04:15] [INFO ] [Nat]Absence check using state equation in 1373 ms returned sat
[2025-06-07 23:04:15] [INFO ] Computed and/alt/rep : 2363/3990/2363 causal constraints (skipped 145 transitions) in 113 ms.
Could not prove EG (AND p0 (NOT p2))
Support contains 3 out of 1450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1450/1450 places, 2509/2509 transitions.
Applied a total of 0 rules in 50 ms. Remains 1450 /1450 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2025-06-07 23:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:04:28] [INFO ] Implicit Places using invariants in 433 ms returned []
[2025-06-07 23:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:04:29] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Running 2508 sub problems to find dead transitions.
[2025-06-07 23:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 2508/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2508 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 1/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60762ms problems are : Problem set: 0 solved, 2508 unsolved
Search for dead transitions found 0 dead transitions in 60767ms
Finished structural reductions in LTL mode , in 1 iterations and 62184 ms. Remains : 1450/1450 places, 2509/2509 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/1450 stabilizing places and 62/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
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 p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 176 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (19 resets) in 259 ms. (153 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2025-06-07 23:05:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1347/1450 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1450 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2509/3959 variables, 1450/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3959 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3959 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3959/3959 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 1450/1450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1347/1450 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1450 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2509/3959 variables, 1450/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3959 variables, 2/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3959 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3959 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3959/3959 variables, and 1515 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 1450/1450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2646ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 290 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=58 )
Parikh walk visited 2 properties in 9 ms.
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 p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 632 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 320 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
[2025-06-07 23:05:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:05:35] [INFO ] [Real]Absence check using 63 positive place invariants in 33 ms returned sat
[2025-06-07 23:05:36] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2025-06-07 23:05:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 23:05:37] [INFO ] [Nat]Absence check using 63 positive place invariants in 32 ms returned sat
[2025-06-07 23:05:38] [INFO ] [Nat]Absence check using state equation in 1369 ms returned sat
[2025-06-07 23:05:38] [INFO ] Computed and/alt/rep : 2363/3990/2363 causal constraints (skipped 145 transitions) in 101 ms.
[2025-06-07 23:05:51] [INFO ] Added : 625 causal constraints over 125 iterations in 12915 ms. Result :unknown
Could not prove EG (AND p0 (NOT p2))
Stuttering acceptance computed with spot in 280 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25035 reset in 295 ms.
Product exploration explored 100000 steps with 25134 reset in 289 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 293 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p2)), false, false, (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1450/1450 places, 2509/2509 transitions.
Graph (trivial) has 1540 edges and 1450 vertex of which 939 / 1450 are part of one of the 63 SCC in 3 ms
Free SCC test removed 876 places
Ensure Unique test removed 970 transitions
Reduce isomorphic transitions removed 970 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 161 place count 574 transition count 1539
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 222 place count 574 transition count 1478
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 222 place count 574 transition count 1478
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 285 place count 574 transition count 1478
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 396 place count 463 transition count 969
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 507 place count 463 transition count 969
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 555 place count 463 transition count 921
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 603 place count 415 transition count 873
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 3 with 48 rules applied. Total rules applied 651 place count 415 transition count 873
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 3 with 120 rules applied. Total rules applied 771 place count 415 transition count 874
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 831 place count 355 transition count 814
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 3 with 60 rules applied. Total rules applied 891 place count 355 transition count 814
Deduced a syphon composed of 172 places in 0 ms
Applied a total of 891 rules in 70 ms. Remains 355 /1450 variables (removed 1095) and now considering 814/2509 (removed 1695) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:05:53] [INFO ] Redundant transitions in 7 ms returned []
Running 813 sub problems to find dead transitions.
[2025-06-07 23:05:53] [INFO ] Flow matrix only has 358 transitions (discarded 456 similar events)
// Phase 1: matrix 358 rows 355 cols
[2025-06-07 23:05:53] [INFO ] Computed 63 invariants in 1 ms
[2025-06-07 23:05:53] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 813 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 813 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:05] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 20/83 constraints. Problems are: Problem set: 77 solved, 736 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:06] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 17 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:07] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 20/103 constraints. Problems are: Problem set: 119 solved, 694 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Problem TDEAD197 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD208 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD210 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD214 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD218 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 20/123 constraints. Problems are: Problem set: 168 solved, 645 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD228 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD230 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:06:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 3/126 constraints. Problems are: Problem set: 173 solved, 640 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 Real declared 355/713 variables, and 126 constraints, problems are : Problem set: 173 solved, 640 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/355 constraints, ReadFeed: 0/51 constraints, PredecessorRefiner: 813/812 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 173 solved, 640 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 173 solved, 640 unsolved
At refinement iteration 1 (OVERLAPS) 173/355 variables, 63/63 constraints. Problems are: Problem set: 173 solved, 640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 63/126 constraints. Problems are: Problem set: 173 solved, 640 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/126 constraints. Problems are: Problem set: 173 solved, 640 unsolved
At refinement iteration 4 (OVERLAPS) 357/712 variables, 355/481 constraints. Problems are: Problem set: 173 solved, 640 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/712 variables, 50/531 constraints. Problems are: Problem set: 173 solved, 640 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 639/1170 constraints. Problems are: Problem set: 173 solved, 640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 712/713 variables, and 1170 constraints, problems are : Problem set: 173 solved, 640 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 355/355 constraints, ReadFeed: 50/51 constraints, PredecessorRefiner: 640/812 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 173 solved, 640 unsolved
Search for dead transitions found 173 dead transitions in 60231ms
Found 173 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 173 transitions
Dead transitions reduction (with SMT) removed 173 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 355/1450 places, 641/2509 transitions.
Graph (complete) has 5178 edges and 355 vertex of which 183 are kept as prefixes of interest. Removing 172 places using SCC suffix rule.2 ms
Discarding 172 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 183 /355 variables (removed 172) and now considering 641/641 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 183/1450 places, 641/2509 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60329 ms. Remains : 183/1450 places, 641/2509 transitions.
Built C files in :
/tmp/ltsmin18125734711950540172
[2025-06-07 23:06:53] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18125734711950540172
Running compilation step : cd /tmp/ltsmin18125734711950540172;'/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/ltsmin18125734711950540172;'/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/ltsmin18125734711950540172;'/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 1450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1450/1450 places, 2509/2509 transitions.
Applied a total of 0 rules in 51 ms. Remains 1450 /1450 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
// Phase 1: matrix 2509 rows 1450 cols
[2025-06-07 23:06:56] [INFO ] Computed 63 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:06:56] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-06-07 23:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:06:57] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
Running 2508 sub problems to find dead transitions.
[2025-06-07 23:06:57] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 2508/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2508 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1449/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2508 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1450 constraints, PredecessorRefiner: 1/2507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60799ms problems are : Problem set: 0 solved, 2508 unsolved
Search for dead transitions found 0 dead transitions in 60802ms
Finished structural reductions in LTL mode , in 1 iterations and 62200 ms. Remains : 1450/1450 places, 2509/2509 transitions.
Built C files in :
/tmp/ltsmin7173045394052442239
[2025-06-07 23:07:58] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7173045394052442239
Running compilation step : cd /tmp/ltsmin7173045394052442239;'/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/ltsmin7173045394052442239;'/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/ltsmin7173045394052442239;'/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-06-07 23:08:01] [INFO ] Flatten gal took : 44 ms
[2025-06-07 23:08:01] [INFO ] Flatten gal took : 47 ms
[2025-06-07 23:08:01] [INFO ] Time to serialize gal into /tmp/LTL5670598873101871516.gal : 9 ms
[2025-06-07 23:08:01] [INFO ] Time to serialize properties into /tmp/LTL1165605886696487060.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/LTL5670598873101871516.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18220769310628815838.hoa' '-atoms' '/tmp/LTL1165605886696487060.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1165605886696487060.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18220769310628815838.hoa
Detected timeout of ITS tools.
[2025-06-07 23:08:16] [INFO ] Flatten gal took : 41 ms
[2025-06-07 23:08:17] [INFO ] Flatten gal took : 43 ms
[2025-06-07 23:08:17] [INFO ] Time to serialize gal into /tmp/LTL6805719079974427540.gal : 8 ms
[2025-06-07 23:08:17] [INFO ] Time to serialize properties into /tmp/LTL8891704323666141904.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/LTL6805719079974427540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8891704323666141904.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(("(p1638!=1)")&&(X((F("(p1913!=1)"))||(G("(p1638!=1)"))))))U(X(("(p524==1)")||(G("(p1638==1)"))))))
Formula 0 simplified : G(!"(p1638!=1)" | X(G!"(p1913!=1)" & F!"(p1638!=1)")) R X(!"(p524==1)" & F!"(p1638==1)")
Detected timeout of ITS tools.
[2025-06-07 23:08:32] [INFO ] Flatten gal took : 42 ms
[2025-06-07 23:08:32] [INFO ] Applying decomposition
[2025-06-07 23:08:32] [INFO ] Flatten gal took : 41 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/graph13380900817312369724.txt' '-o' '/tmp/graph13380900817312369724.bin' '-w' '/tmp/graph13380900817312369724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13380900817312369724.bin' '-l' '-1' '-v' '-w' '/tmp/graph13380900817312369724.weights' '-q' '0' '-e' '0.001'
[2025-06-07 23:08:32] [INFO ] Decomposing Gal with order
[2025-06-07 23:08:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 23:08:32] [INFO ] Removed a total of 2088 redundant transitions.
[2025-06-07 23:08:32] [INFO ] Flatten gal took : 97 ms
[2025-06-07 23:08:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 33 ms.
[2025-06-07 23:08:32] [INFO ] Time to serialize gal into /tmp/LTL10345464590369491488.gal : 16 ms
[2025-06-07 23:08:32] [INFO ] Time to serialize properties into /tmp/LTL15104935301321061070.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/LTL10345464590369491488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15104935301321061070.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(("(i52.u408.p1638!=1)")&&(X((F("(i47.u468.p1913!=1)"))||(G("(i52.u408.p1638!=1)"))))))U(X(("(i13.u131.p524==1)")||(G("(i52.u408....171
Formula 0 simplified : G(!"(i52.u408.p1638!=1)" | X(G!"(i47.u468.p1913!=1)" & F!"(i52.u408.p1638!=1)")) R X(!"(i13.u131.p524==1)" & F!"(i52.u408.p1638==1)"...156
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H10T2O-LTLFireability-08 finished in 341901 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((!p1 U (p2||G(!p1)))))&&p0) U G(!p1)))'
Support contains 3 out of 1471 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 : 1471/1471 places, 2530/2530 transitions.
Graph (trivial) has 1552 edges and 1471 vertex of which 929 / 1471 are part of one of the 63 SCC in 4 ms
Free SCC test removed 866 places
Ensure Unique test removed 956 transitions
Reduce isomorphic transitions removed 956 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 179 rules applied. Total rules applied 180 place count 604 transition count 1394
Reduce places removed 179 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 300 rules applied. Total rules applied 480 place count 425 transition count 1273
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 61 rules applied. Total rules applied 541 place count 365 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 542 place count 364 transition count 1272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 542 place count 364 transition count 1269
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 548 place count 361 transition count 1269
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 596 place count 313 transition count 866
Iterating global reduction 4 with 48 rules applied. Total rules applied 644 place count 313 transition count 866
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 689 place count 313 transition count 821
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 5 with 244 rules applied. Total rules applied 933 place count 191 transition count 699
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 934 place count 190 transition count 689
Iterating global reduction 5 with 1 rules applied. Total rules applied 935 place count 190 transition count 689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 936 place count 190 transition count 688
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
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 940 place count 188 transition count 714
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 941 place count 188 transition count 713
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 942 place count 187 transition count 685
Iterating global reduction 7 with 1 rules applied. Total rules applied 943 place count 187 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 944 place count 187 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 958 place count 187 transition count 670
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 960 place count 185 transition count 668
Applied a total of 960 rules in 86 ms. Remains 185 /1471 variables (removed 1286) and now considering 668/2530 (removed 1862) transitions.
[2025-06-07 23:08:47] [INFO ] Flow matrix only has 203 transitions (discarded 465 similar events)
// Phase 1: matrix 203 rows 185 cols
[2025-06-07 23:08:47] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:47] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-07 23:08:47] [INFO ] Flow matrix only has 203 transitions (discarded 465 similar events)
[2025-06-07 23:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:08:48] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:08:48] [INFO ] Redundant transitions in 6 ms returned []
Running 493 sub problems to find dead transitions.
[2025-06-07 23:08:48] [INFO ] Flow matrix only has 203 transitions (discarded 465 similar events)
[2025-06-07 23:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 4/185 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (OVERLAPS) 202/387 variables, 185/248 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 0/387 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 493 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/388 variables, and 248 constraints, problems are : Problem set: 0 solved, 493 unsolved in 22336 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 493/492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 493 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 4/185 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (OVERLAPS) 202/387 variables, 185/248 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 492/740 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 493 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/388 variables, and 740 constraints, problems are : Problem set: 0 solved, 493 unsolved in 24063 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 493/492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46474ms problems are : Problem set: 0 solved, 493 unsolved
Search for dead transitions found 0 dead transitions in 46476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 185/1471 places, 668/2530 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46868 ms. Remains : 185/1471 places, 668/2530 transitions.
Stuttering acceptance computed with spot in 86 ms :[p1, true, p1]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-10
Entered a terminal (fully accepting) state of product in 227 steps with 1 reset in 6 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-10 finished in 46991 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 1471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Graph (trivial) has 1563 edges and 1471 vertex of which 946 / 1471 are part of one of the 63 SCC in 0 ms
Free SCC test removed 883 places
Ensure Unique test removed 977 transitions
Reduce isomorphic transitions removed 977 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 176 place count 587 transition count 1377
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 296 rules applied. Total rules applied 472 place count 412 transition count 1256
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 532 place count 352 transition count 1256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 532 place count 352 transition count 1255
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 534 place count 351 transition count 1255
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 584 place count 301 transition count 823
Iterating global reduction 3 with 50 rules applied. Total rules applied 634 place count 301 transition count 823
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 681 place count 301 transition count 776
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 921 place count 181 transition count 656
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 922 place count 180 transition count 646
Iterating global reduction 4 with 1 rules applied. Total rules applied 923 place count 180 transition count 646
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 924 place count 180 transition count 645
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 926 place count 178 transition count 643
Applied a total of 926 rules in 64 ms. Remains 178 /1471 variables (removed 1293) and now considering 643/2530 (removed 1887) transitions.
[2025-06-07 23:09:34] [INFO ] Flow matrix only has 168 transitions (discarded 475 similar events)
// Phase 1: matrix 168 rows 178 cols
[2025-06-07 23:09:34] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:09:34] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-07 23:09:34] [INFO ] Flow matrix only has 168 transitions (discarded 475 similar events)
[2025-06-07 23:09:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:09:35] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:09:35] [INFO ] Redundant transitions in 4 ms returned []
Running 467 sub problems to find dead transitions.
[2025-06-07 23:09:35] [INFO ] Flow matrix only has 168 transitions (discarded 475 similar events)
[2025-06-07 23:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 2/178 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 167/345 variables, 178/241 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (OVERLAPS) 0/345 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 467 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/346 variables, and 241 constraints, problems are : Problem set: 0 solved, 467 unsolved in 20305 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 467/466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 2/178 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (OVERLAPS) 167/345 variables, 178/241 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 466/707 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 467 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/346 variables, and 707 constraints, problems are : Problem set: 0 solved, 467 unsolved in 21053 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 467/466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41412ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 41413ms
Starting structural reductions in SI_LTL mode, iteration 1 : 178/1471 places, 643/2530 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41798 ms. Remains : 178/1471 places, 643/2530 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-11
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-11 finished in 41888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Graph (trivial) has 1563 edges and 1471 vertex of which 948 / 1471 are part of one of the 63 SCC in 1 ms
Free SCC test removed 885 places
Ensure Unique test removed 979 transitions
Reduce isomorphic transitions removed 979 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 175 place count 585 transition count 1376
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 295 rules applied. Total rules applied 470 place count 411 transition count 1255
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 530 place count 351 transition count 1255
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 581 place count 300 transition count 811
Iterating global reduction 3 with 51 rules applied. Total rules applied 632 place count 300 transition count 811
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 680 place count 300 transition count 763
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 920 place count 180 transition count 643
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 921 place count 179 transition count 633
Iterating global reduction 4 with 1 rules applied. Total rules applied 922 place count 179 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 923 place count 179 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 925 place count 177 transition count 630
Applied a total of 925 rules in 48 ms. Remains 177 /1471 variables (removed 1294) and now considering 630/2530 (removed 1900) transitions.
[2025-06-07 23:10:16] [INFO ] Flow matrix only has 166 transitions (discarded 464 similar events)
// Phase 1: matrix 166 rows 177 cols
[2025-06-07 23:10:16] [INFO ] Computed 63 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:16] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-06-07 23:10:16] [INFO ] Flow matrix only has 166 transitions (discarded 464 similar events)
[2025-06-07 23:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:17] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:10:17] [INFO ] Redundant transitions in 6 ms returned []
Running 454 sub problems to find dead transitions.
[2025-06-07 23:10:17] [INFO ] Flow matrix only has 166 transitions (discarded 464 similar events)
[2025-06-07 23:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 2/177 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 165/342 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 454 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/343 variables, and 240 constraints, problems are : Problem set: 0 solved, 454 unsolved in 18783 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 454/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (OVERLAPS) 2/177 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 165/342 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 453/693 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 7 (OVERLAPS) 0/342 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 454 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/343 variables, and 693 constraints, problems are : Problem set: 0 solved, 454 unsolved in 20229 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 454/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39063ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 39064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1471 places, 630/2530 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39553 ms. Remains : 177/1471 places, 630/2530 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-12 finished in 39608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(((F(p3) U p4)&&p2))&&F(p5)&&p1))))'
Support contains 6 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1459 transition count 2518
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1459 transition count 2518
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1453 transition count 2512
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1453 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1452 transition count 2511
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1452 transition count 2511
Applied a total of 38 rules in 221 ms. Remains 1452 /1471 variables (removed 19) and now considering 2511/2530 (removed 19) transitions.
// Phase 1: matrix 2511 rows 1452 cols
[2025-06-07 23:10:56] [INFO ] Computed 63 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:56] [INFO ] Implicit Places using invariants in 431 ms returned []
[2025-06-07 23:10:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:10:57] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
Running 2510 sub problems to find dead transitions.
[2025-06-07 23:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1451/3963 variables, and 0 constraints, problems are : Problem set: 0 solved, 2510 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1452 constraints, PredecessorRefiner: 2510/2509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2510 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1451/3963 variables, and 0 constraints, problems are : Problem set: 0 solved, 2510 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1452 constraints, PredecessorRefiner: 1/2509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60812ms problems are : Problem set: 0 solved, 2510 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Starting structural reductions in LTL mode, iteration 1 : 1452/1471 places, 2511/2530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62438 ms. Remains : 1452/1471 places, 2511/2530 transitions.
Stuttering acceptance computed with spot in 699 ms :[(OR (NOT p1) (NOT p4) (NOT p5) (NOT p2)), (OR (NOT p2) (NOT p5) (NOT p1) (NOT p4)), true, (OR (NOT p4) (NOT p2)), (NOT p5), (OR (NOT p4) (NOT p2)), (NOT p3), (NOT p4), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p5)) (AND (NOT p3) (NOT p4))), (NOT p4), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p4))), (AND (NOT p5) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p4)))]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-13 finished in 63177 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(p0))) U (p1&&X((p0&&X(p0)))))))'
Support contains 2 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1458 transition count 2517
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1458 transition count 2517
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1451 transition count 2510
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1451 transition count 2510
Applied a total of 40 rules in 154 ms. Remains 1451 /1471 variables (removed 20) and now considering 2510/2530 (removed 20) transitions.
// Phase 1: matrix 2510 rows 1451 cols
[2025-06-07 23:11:59] [INFO ] Computed 63 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:11:59] [INFO ] Implicit Places using invariants in 475 ms returned []
[2025-06-07 23:11:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:12:00] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
Running 2509 sub problems to find dead transitions.
[2025-06-07 23:12:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1450/3961 variables, and 0 constraints, problems are : Problem set: 0 solved, 2509 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1451 constraints, PredecessorRefiner: 2509/2508 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1450/3961 variables, and 0 constraints, problems are : Problem set: 0 solved, 2509 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/1451 constraints, PredecessorRefiner: 1/2508 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60904ms problems are : Problem set: 0 solved, 2509 unsolved
Search for dead transitions found 0 dead transitions in 60909ms
Starting structural reductions in LTL mode, iteration 1 : 1451/1471 places, 2510/2530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62533 ms. Remains : 1451/1471 places, 2510/2530 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-14 finished in 62695 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 3 out of 1471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Graph (trivial) has 1557 edges and 1471 vertex of which 933 / 1471 are part of one of the 62 SCC in 2 ms
Free SCC test removed 871 places
Ensure Unique test removed 964 transitions
Reduce isomorphic transitions removed 964 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 179 rules applied. Total rules applied 180 place count 599 transition count 1386
Reduce places removed 179 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 300 rules applied. Total rules applied 480 place count 420 transition count 1265
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 61 rules applied. Total rules applied 541 place count 360 transition count 1264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 542 place count 359 transition count 1264
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 542 place count 359 transition count 1261
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 548 place count 356 transition count 1261
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 596 place count 308 transition count 855
Iterating global reduction 4 with 48 rules applied. Total rules applied 644 place count 308 transition count 855
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 689 place count 308 transition count 810
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 5 with 242 rules applied. Total rules applied 931 place count 187 transition count 689
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 932 place count 186 transition count 679
Iterating global reduction 5 with 1 rules applied. Total rules applied 933 place count 186 transition count 679
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 934 place count 186 transition count 678
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
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 938 place count 184 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 939 place count 184 transition count 703
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 940 place count 183 transition count 675
Iterating global reduction 7 with 1 rules applied. Total rules applied 941 place count 183 transition count 675
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 942 place count 183 transition count 674
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 956 place count 183 transition count 660
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 958 place count 181 transition count 658
Applied a total of 958 rules in 69 ms. Remains 181 /1471 variables (removed 1290) and now considering 658/2530 (removed 1872) transitions.
[2025-06-07 23:13:02] [INFO ] Flow matrix only has 185 transitions (discarded 473 similar events)
// Phase 1: matrix 185 rows 181 cols
[2025-06-07 23:13:02] [INFO ] Computed 63 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:02] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-07 23:13:02] [INFO ] Flow matrix only has 185 transitions (discarded 473 similar events)
[2025-06-07 23:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:02] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:13:02] [INFO ] Redundant transitions in 6 ms returned []
Running 483 sub problems to find dead transitions.
[2025-06-07 23:13:02] [INFO ] Flow matrix only has 185 transitions (discarded 473 similar events)
[2025-06-07 23:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 3/181 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 184/365 variables, 181/244 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 483 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/366 variables, and 244 constraints, problems are : Problem set: 0 solved, 483 unsolved in 21909 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 483/482 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 3/181 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 184/365 variables, 181/244 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 482/726 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 483 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/366 variables, and 726 constraints, problems are : Problem set: 0 solved, 483 unsolved in 22576 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 483/482 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44542ms problems are : Problem set: 0 solved, 483 unsolved
Search for dead transitions found 0 dead transitions in 44543ms
Starting structural reductions in SI_LTL mode, iteration 1 : 181/1471 places, 658/2530 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44927 ms. Remains : 181/1471 places, 658/2530 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T2O-LTLFireability-15 finished in 45084 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) U G((F(p1) U X(p2)))))))'
Found a Lengthening insensitive property : Champagne-PT-H10T2O-LTLFireability-01
Stuttering acceptance computed with spot in 389 ms :[(NOT p2), (NOT p2), (NOT p2), false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1) p2)]
Support contains 3 out of 1471 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1471/1471 places, 2530/2530 transitions.
Graph (trivial) has 1561 edges and 1471 vertex of which 945 / 1471 are part of one of the 63 SCC in 3 ms
Free SCC test removed 882 places
Ensure Unique test removed 976 transitions
Reduce isomorphic transitions removed 976 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 176 place count 588 transition count 1378
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 296 rules applied. Total rules applied 472 place count 413 transition count 1257
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 532 place count 353 transition count 1257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 532 place count 353 transition count 1256
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 534 place count 352 transition count 1256
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 582 place count 304 transition count 824
Iterating global reduction 3 with 48 rules applied. Total rules applied 630 place count 304 transition count 824
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 677 place count 304 transition count 777
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 915 place count 185 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 917 place count 184 transition count 667
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 927 place count 184 transition count 657
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 929 place count 182 transition count 655
Applied a total of 929 rules in 70 ms. Remains 182 /1471 variables (removed 1289) and now considering 655/2530 (removed 1875) transitions.
[2025-06-07 23:13:47] [INFO ] Flow matrix only has 173 transitions (discarded 482 similar events)
// Phase 1: matrix 173 rows 182 cols
[2025-06-07 23:13:47] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:47] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-07 23:13:47] [INFO ] Flow matrix only has 173 transitions (discarded 482 similar events)
[2025-06-07 23:13:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:13:48] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2025-06-07 23:13:48] [INFO ] Flow matrix only has 173 transitions (discarded 482 similar events)
[2025-06-07 23:13:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 3/182 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 172/354 variables, 182/245 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (OVERLAPS) 0/354 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 480 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 245 constraints, problems are : Problem set: 0 solved, 480 unsolved in 21363 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 480/479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 3/182 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 172/354 variables, 182/245 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 479/724 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 0/354 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 480 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 724 constraints, problems are : Problem set: 0 solved, 480 unsolved in 23215 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 480/479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44645ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 44649ms
Starting structural reductions in LI_LTL mode, iteration 1 : 182/1471 places, 655/2530 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 45053 ms. Remains : 182/1471 places, 655/2530 transitions.
Running random walk in product with property : Champagne-PT-H10T2O-LTLFireability-01
Stuttering criterion allowed to conclude after 18830 steps with 4158 reset in 144 ms.
Treatment of property Champagne-PT-H10T2O-LTLFireability-01 finished in 45727 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X((F(p1)||G(p0))))) U X((p2||G(!p0)))))'
[2025-06-07 23:14:33] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17498327466448543241
[2025-06-07 23:14:33] [INFO ] Too many transitions (2530) to apply POR reductions. Disabling POR matrices.
[2025-06-07 23:14:33] [INFO ] Applying decomposition
[2025-06-07 23:14:33] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17498327466448543241
Running compilation step : cd /tmp/ltsmin17498327466448543241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-07 23:14:33] [INFO ] Flatten gal took : 39 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/graph14498180899940024058.txt' '-o' '/tmp/graph14498180899940024058.bin' '-w' '/tmp/graph14498180899940024058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14498180899940024058.bin' '-l' '-1' '-v' '-w' '/tmp/graph14498180899940024058.weights' '-q' '0' '-e' '0.001'
[2025-06-07 23:14:33] [INFO ] Decomposing Gal with order
[2025-06-07 23:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 23:14:33] [INFO ] Removed a total of 2058 redundant transitions.
[2025-06-07 23:14:33] [INFO ] Flatten gal took : 94 ms
[2025-06-07 23:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 18 ms.
[2025-06-07 23:14:33] [INFO ] Time to serialize gal into /tmp/LTLFireability10699741227380441159.gal : 12 ms
[2025-06-07 23:14:33] [INFO ] Time to serialize properties into /tmp/LTLFireability16192513263083144979.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/LTLFireability10699741227380441159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16192513263083144979.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((F(("(i26.i2.i2.u414.p1638!=1)")&&(X((F("(i44.i1.i1.u476.p1913!=1)"))||(G("(i26.i2.i2.u414.p1638!=1)"))))))U(X(("(i13.u130.p524==1)...195
Formula 0 simplified : G(!"(i26.i2.i2.u414.p1638!=1)" | X(G!"(i44.i1.i1.u476.p1913!=1)" & F!"(i26.i2.i2.u414.p1638!=1)")) R X(!"(i13.u130.p524==1)" & F!"(i...180
Compilation finished in 5156 ms.
Running link step : cd /tmp/ltsmin17498327466448543241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin17498327466448543241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp3==true)&&X((<>((LTLAPp4==true))||[]((LTLAPp3==true)))))) U X(((LTLAPp5==true)||[](!(LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 1008 ms.
FORMULA Champagne-PT-H10T2O-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1363458 ms.

BK_STOP 1749338079371

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="Champagne-PT-H10T2O"
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 Champagne-PT-H10T2O, 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 r254-tall-174931339400164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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