About the Execution of ITS-Tools for HirschbergSinclair-PT-40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1344206.00 | 0.00 | 0.00 | TTFTFFTFFFTFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422100115.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 HirschbergSinclair-PT-40, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422100115
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 580K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-40-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748784026332
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 13:20:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 13:20:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:20:28] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-06-01 13:20:28] [INFO ] Transformed 1068 places.
[2025-06-01 13:20:28] [INFO ] Transformed 982 transitions.
[2025-06-01 13:20:28] [INFO ] Parsed PT model containing 1068 places and 982 transitions and 2991 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 982/982 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 1033 transition count 982
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 70 place count 998 transition count 947
Iterating global reduction 1 with 35 rules applied. Total rules applied 105 place count 998 transition count 947
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 139 place count 964 transition count 913
Iterating global reduction 1 with 34 rules applied. Total rules applied 173 place count 964 transition count 913
Applied a total of 173 rules in 324 ms. Remains 964 /1068 variables (removed 104) and now considering 913/982 (removed 69) transitions.
// Phase 1: matrix 913 rows 964 cols
[2025-06-01 13:20:28] [INFO ] Computed 51 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:20:29] [INFO ] Implicit Places using invariants in 757 ms returned []
[2025-06-01 13:20:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:20:39] [INFO ] Implicit Places using invariants and state equation in 10187 ms returned []
Implicit Place search using SMT with State Equation took 10987 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2025-06-01 13:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/919 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 919/1877 variables, and 6 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/964 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/919 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/919 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (OVERLAPS) 10/929 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 929/1877 variables, and 11 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/964 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Starting structural reductions in LTL mode, iteration 1 : 964/1068 places, 913/982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71693 ms. Remains : 964/1068 places, 913/982 transitions.
Support contains 45 out of 964 places after structural reductions.
[2025-06-01 13:21:40] [INFO ] Flatten gal took : 88 ms
[2025-06-01 13:21:40] [INFO ] Flatten gal took : 52 ms
[2025-06-01 13:21:40] [INFO ] Input system was already deterministic with 913 transitions.
RANDOM walk for 40000 steps (40 resets) in 1329 ms. (30 steps per ms) remains 12/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
[2025-06-01 13:21:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 20/35 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 837/872 variables, 43/47 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3/875 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/875 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 17/892 variables, 3/51 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/892 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 9 (OVERLAPS) 913/1805 variables, 892/943 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1805 variables, 0/943 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 72/1877 variables, 72/1015 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1877 variables, 0/1015 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1877 variables, 0/1015 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1877/1877 variables, and 1015 constraints, problems are : Problem set: 9 solved, 3 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 964/964 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 749/770 variables, 41/44 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/44 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/776 variables, 2/46 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 0/46 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 115/891 variables, 5/51 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/891 variables, 0/51 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 913/1804 variables, 891/942 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1804 variables, 3/945 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1804 variables, 0/945 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 73/1877 variables, 73/1018 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1877 variables, 0/1018 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1877 variables, 0/1018 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1877/1877 variables, and 1018 constraints, problems are : Problem set: 9 solved, 3 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 964/964 constraints, PredecessorRefiner: 3/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4945ms problems are : Problem set: 9 solved, 3 unsolved
Parikh walk visited 0 properties in 1679 ms.
Support contains 6 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 913/913 transitions.
Graph (complete) has 1836 edges and 964 vertex of which 922 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.6 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 0 with 444 rules applied. Total rules applied 445 place count 922 transition count 469
Reduce places removed 404 places and 0 transitions.
Graph (complete) has 906 edges and 518 vertex of which 378 are kept as prefixes of interest. Removing 140 places using SCC suffix rule.1 ms
Discarding 140 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 407 rules applied. Total rules applied 852 place count 378 transition count 467
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 142 rules applied. Total rules applied 994 place count 376 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 994 place count 376 transition count 326
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 996 place count 375 transition count 326
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 997 place count 374 transition count 325
Iterating global reduction 3 with 1 rules applied. Total rules applied 998 place count 374 transition count 325
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 999 place count 374 transition count 324
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 622 edges and 373 vertex of which 371 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 1001 place count 371 transition count 324
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1003 place count 371 transition count 322
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1008 place count 371 transition count 317
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1013 place count 366 transition count 317
Reduce places removed 40 places and 40 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1053 place count 326 transition count 277
Reduce places removed 39 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 7 with 274 rules applied. Total rules applied 1327 place count 287 transition count 42
Reduce places removed 235 places and 0 transitions.
Iterating post reduction 8 with 235 rules applied. Total rules applied 1562 place count 52 transition count 42
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 23 Pre rules applied. Total rules applied 1562 place count 52 transition count 19
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 49 rules applied. Total rules applied 1611 place count 26 transition count 19
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 4 rules applied. Total rules applied 1615 place count 24 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1617 place count 22 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 1617 place count 22 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1621 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1623 place count 19 transition count 14
Applied a total of 1623 rules in 110 ms. Remains 19 /964 variables (removed 945) and now considering 14/913 (removed 899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 19/964 places, 14/913 transitions.
RANDOM walk for 30552 steps (2034 resets) in 206 ms. (147 steps per ms) remains 0/3 properties
FORMULA HirschbergSinclair-PT-40-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-40-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-40-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 964 stabilizing places and 913 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 964 transition count 913
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(((p0&&X(X(X(X(p1))))) U p2))))'
Support contains 6 out of 964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 961 transition count 913
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 957 transition count 909
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 957 transition count 909
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 954 transition count 906
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 954 transition count 906
Applied a total of 17 rules in 158 ms. Remains 954 /964 variables (removed 10) and now considering 906/913 (removed 7) transitions.
// Phase 1: matrix 906 rows 954 cols
[2025-06-01 13:21:49] [INFO ] Computed 48 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:21:49] [INFO ] Implicit Places using invariants in 562 ms returned []
[2025-06-01 13:21:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:22:00] [INFO ] Implicit Places using invariants and state equation in 10610 ms returned []
Implicit Place search using SMT with State Equation took 11176 ms to find 0 implicit places.
Running 866 sub problems to find dead transitions.
[2025-06-01 13:22:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/912 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 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)
(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)
(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 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 912/1860 variables, and 6 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/954 constraints, PredecessorRefiner: 866/866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 866 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/912 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/912 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 866 unsolved
At refinement iteration 2 (OVERLAPS) 4/916 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 866 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/1860 variables, and 8 constraints, problems are : Problem set: 0 solved, 866 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/954 constraints, PredecessorRefiner: 0/866 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 866 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 954/964 places, 906/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71575 ms. Remains : 954/964 places, 906/913 transitions.
Stuttering acceptance computed with spot in 624 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 628 ms.
Product exploration explored 100000 steps with 50000 reset in 465 ms.
Computed a total of 954 stabilizing places and 906 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 954 transition count 906
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 20 ms. Reduced automaton from 13 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-00 finished in 73668 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)&&F(p1)))'
Support contains 3 out of 964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Graph (complete) has 1836 edges and 964 vertex of which 959 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 40 places and 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 409 transitions
Trivial Post-agglo rules discarded 409 transitions
Performed 409 trivial Post agglomeration. Transition count delta: 409
Iterating post reduction 0 with 409 rules applied. Total rules applied 410 place count 919 transition count 464
Reduce places removed 409 places and 0 transitions.
Iterating post reduction 1 with 409 rules applied. Total rules applied 819 place count 510 transition count 464
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 825 place count 504 transition count 458
Iterating global reduction 2 with 6 rules applied. Total rules applied 831 place count 504 transition count 458
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 832 place count 504 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 833 place count 503 transition count 457
Applied a total of 833 rules in 73 ms. Remains 503 /964 variables (removed 461) and now considering 457/913 (removed 456) transitions.
// Phase 1: matrix 457 rows 503 cols
[2025-06-01 13:23:02] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:23:03] [INFO ] Implicit Places using invariants in 671 ms returned []
[2025-06-01 13:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:23:15] [INFO ] Implicit Places using invariants and state equation in 12024 ms returned []
Implicit Place search using SMT with State Equation took 12700 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:23:15] [INFO ] Redundant transitions in 25 ms returned []
Running 378 sub problems to find dead transitions.
[2025-06-01 13:23:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 2/426 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/960 variables, and 472 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/503 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 2/426 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 378/850 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/960 variables, and 850 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/503 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 503/964 places, 457/913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72880 ms. Remains : 503/964 places, 457/913 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-01
Product exploration explored 100000 steps with 393 reset in 455 ms.
Product exploration explored 100000 steps with 393 reset in 408 ms.
Computed a total of 503 stabilizing places and 457 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 503 transition count 457
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1095 steps (0 resets) in 16 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 13 factoid took 251 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
[2025-06-01 13:24:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:24:20] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 2680 ms returned sat
[2025-06-01 13:24:26] [INFO ] [Real]Absence check using state equation in 5850 ms returned sat
[2025-06-01 13:24:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:24:26] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 311 ms returned sat
[2025-06-01 13:24:26] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2025-06-01 13:24:27] [INFO ] Computed and/alt/rep : 378/385/378 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-01 13:24:29] [INFO ] Added : 195 causal constraints over 39 iterations in 2104 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 503 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 : 503/503 places, 457/457 transitions.
Applied a total of 0 rules in 31 ms. Remains 503 /503 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2025-06-01 13:24:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:24:29] [INFO ] Implicit Places using invariants in 630 ms returned []
[2025-06-01 13:24:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:24:41] [INFO ] Implicit Places using invariants and state equation in 12023 ms returned []
Implicit Place search using SMT with State Equation took 12657 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:24:41] [INFO ] Redundant transitions in 5 ms returned []
Running 378 sub problems to find dead transitions.
[2025-06-01 13:24:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 2/426 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/960 variables, and 472 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/503 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 2/426 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 380/806 variables, 426/472 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 378/850 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/960 variables, and 850 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 426/503 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72780 ms. Remains : 503/503 places, 457/457 transitions.
Computed a total of 503 stabilizing places and 457 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 503 transition count 457
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1090 steps (0 resets) in 14 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
[2025-06-01 13:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:25:45] [INFO ] [Real]Absence check using 0 positive and 46 generalized place invariants in 2659 ms returned sat
[2025-06-01 13:25:51] [INFO ] [Real]Absence check using state equation in 5859 ms returned sat
[2025-06-01 13:25:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:25:51] [INFO ] [Nat]Absence check using 0 positive and 46 generalized place invariants in 306 ms returned sat
[2025-06-01 13:25:52] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2025-06-01 13:25:52] [INFO ] Computed and/alt/rep : 378/385/378 causal constraints (skipped 0 transitions) in 25 ms.
[2025-06-01 13:25:54] [INFO ] Added : 195 causal constraints over 39 iterations in 1984 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 393 reset in 339 ms.
Product exploration explored 100000 steps with 394 reset in 456 ms.
Built C files in :
/tmp/ltsmin9081110332210064893
[2025-06-01 13:25:55] [INFO ] Computing symmetric may disable matrix : 457 transitions.
[2025-06-01 13:25:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:25:55] [INFO ] Computing symmetric may enable matrix : 457 transitions.
[2025-06-01 13:25:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:25:55] [INFO ] Computing Do-Not-Accords matrix : 457 transitions.
[2025-06-01 13:25:55] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:25:55] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9081110332210064893
Running compilation step : cd /tmp/ltsmin9081110332210064893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1159 ms.
Running link step : cd /tmp/ltsmin9081110332210064893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9081110332210064893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8887186242018512183.hoa' '--buchi-type=spotba'
LTSmin run took 5939 ms.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-01 finished in 179838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 960 transition count 913
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 955 transition count 908
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 955 transition count 908
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 951 transition count 904
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 951 transition count 904
Applied a total of 22 rules in 112 ms. Remains 951 /964 variables (removed 13) and now considering 904/913 (removed 9) transitions.
// Phase 1: matrix 904 rows 951 cols
[2025-06-01 13:26:02] [INFO ] Computed 47 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:26:02] [INFO ] Implicit Places using invariants in 468 ms returned []
[2025-06-01 13:26:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:26:13] [INFO ] Implicit Places using invariants and state equation in 10986 ms returned []
Implicit Place search using SMT with State Equation took 11456 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2025-06-01 13:26:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 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)
(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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1855 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 951/964 places, 904/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71757 ms. Remains : 951/964 places, 904/913 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-02
Product exploration explored 100000 steps with 452 reset in 523 ms.
Product exploration explored 100000 steps with 460 reset in 579 ms.
Computed a total of 951 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 951 transition count 904
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 760 steps (0 resets) in 12 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 13:27:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:27:16] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 13:27:16] [INFO ] [Real]Absence check using 1 positive and 46 generalized place invariants in 165 ms returned sat
[2025-06-01 13:27:31] [INFO ] [Real]Absence check using state equation in 14319 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 904/904 transitions.
Applied a total of 0 rules in 35 ms. Remains 951 /951 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2025-06-01 13:27:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:27:31] [INFO ] Implicit Places using invariants in 469 ms returned []
[2025-06-01 13:27:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:27:42] [INFO ] Implicit Places using invariants and state equation in 11206 ms returned []
Implicit Place search using SMT with State Equation took 11691 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2025-06-01 13:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1855 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in LTL mode , in 1 iterations and 71905 ms. Remains : 951/951 places, 904/904 transitions.
Computed a total of 951 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 951 transition count 904
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 884 steps (0 resets) in 16 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 13:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:28:44] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-01 13:28:44] [INFO ] [Real]Absence check using 1 positive and 46 generalized place invariants in 152 ms returned sat
[2025-06-01 13:28:59] [INFO ] [Real]Absence check using state equation in 14345 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 462 reset in 530 ms.
Product exploration explored 100000 steps with 466 reset in 563 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 951/951 places, 904/904 transitions.
Performed 408 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 951 transition count 904
Deduced a syphon composed of 408 places in 4 ms
Applied a total of 408 rules in 158 ms. Remains 951 /951 variables (removed 0) and now considering 904/904 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:29:00] [INFO ] Redundant transitions in 7 ms returned []
Running 864 sub problems to find dead transitions.
// Phase 1: matrix 904 rows 951 cols
[2025-06-01 13:29:00] [INFO ] Computed 47 invariants in 5 ms
[2025-06-01 13:29:00] [INFO ] State equation strengthened by 408 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1855 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, ReadFeed: 0/408 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 13:29:53] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 7 ms to minimize.
Problem TDEAD68 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1855 variables, and 8 constraints, problems are : Problem set: 1 solved, 863 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, ReadFeed: 0/408 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 1 solved, 863 unsolved
Search for dead transitions found 1 dead transitions in 60214ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 951/951 places, 903/904 transitions.
Graph (complete) has 2187 edges and 951 vertex of which 950 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Deduced a syphon composed of 407 places in 4 ms
Applied a total of 1 rules in 53 ms. Remains 950 /951 variables (removed 1) and now considering 903/903 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 950/951 places, 903/904 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60450 ms. Remains : 950/951 places, 903/904 transitions.
Built C files in :
/tmp/ltsmin6374113432338934205
[2025-06-01 13:30:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6374113432338934205
Running compilation step : cd /tmp/ltsmin6374113432338934205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1517 ms.
Running link step : cd /tmp/ltsmin6374113432338934205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6374113432338934205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6574112080363079541.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 951/951 places, 904/904 transitions.
Applied a total of 0 rules in 44 ms. Remains 951 /951 variables (removed 0) and now considering 904/904 (removed 0) transitions.
// Phase 1: matrix 904 rows 951 cols
[2025-06-01 13:30:16] [INFO ] Computed 47 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:30:16] [INFO ] Implicit Places using invariants in 535 ms returned []
[2025-06-01 13:30:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:30:28] [INFO ] Implicit Places using invariants and state equation in 11164 ms returned []
Implicit Place search using SMT with State Equation took 11701 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2025-06-01 13:30:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1855 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in LTL mode , in 1 iterations and 71935 ms. Remains : 951/951 places, 904/904 transitions.
Built C files in :
/tmp/ltsmin15507963560246493682
[2025-06-01 13:31:28] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15507963560246493682
Running compilation step : cd /tmp/ltsmin15507963560246493682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1524 ms.
Running link step : cd /tmp/ltsmin15507963560246493682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15507963560246493682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8073571189816680867.hoa' '--buchi-type=spotba'
LTSmin run took 7537 ms.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-02 finished in 335153 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(p1))) U X((G(p2)||G(F(p1)))))))'
Support contains 5 out of 964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 959 transition count 913
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 11 place count 953 transition count 907
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 953 transition count 907
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 948 transition count 902
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 948 transition count 902
Applied a total of 27 rules in 126 ms. Remains 948 /964 variables (removed 16) and now considering 902/913 (removed 11) transitions.
// Phase 1: matrix 902 rows 948 cols
[2025-06-01 13:31:37] [INFO ] Computed 46 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:31:38] [INFO ] Implicit Places using invariants in 488 ms returned []
[2025-06-01 13:31:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:31:48] [INFO ] Implicit Places using invariants and state equation in 10664 ms returned []
Implicit Place search using SMT with State Equation took 11156 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2025-06-01 13:31: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/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LTL mode, iteration 1 : 948/964 places, 902/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71480 ms. Remains : 948/964 places, 902/913 transitions.
Stuttering acceptance computed with spot in 558 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-03
Product exploration explored 100000 steps with 24750 reset in 417 ms.
Product exploration explored 100000 steps with 24738 reset in 435 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 13 ms. Reduced automaton from 13 states, 32 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-03 finished in 73199 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 2 out of 964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Graph (complete) has 1836 edges and 964 vertex of which 959 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 38 places and 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 412 transitions
Trivial Post-agglo rules discarded 412 transitions
Performed 412 trivial Post agglomeration. Transition count delta: 412
Iterating post reduction 0 with 412 rules applied. Total rules applied 413 place count 921 transition count 463
Reduce places removed 412 places and 0 transitions.
Iterating post reduction 1 with 412 rules applied. Total rules applied 825 place count 509 transition count 463
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 830 place count 504 transition count 458
Iterating global reduction 2 with 5 rules applied. Total rules applied 835 place count 504 transition count 458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 837 place count 503 transition count 457
Applied a total of 837 rules in 62 ms. Remains 503 /964 variables (removed 461) and now considering 457/913 (removed 456) transitions.
// Phase 1: matrix 457 rows 503 cols
[2025-06-01 13:32:50] [INFO ] Computed 46 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:32:51] [INFO ] Implicit Places using invariants in 696 ms returned []
[2025-06-01 13:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:32:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 13:33:06] [INFO ] Implicit Places using invariants and state equation in 14919 ms returned []
Implicit Place search using SMT with State Equation took 15617 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:33:06] [INFO ] Redundant transitions in 4 ms returned []
Running 384 sub problems to find dead transitions.
[2025-06-01 13:33:06] [INFO ] Invariant cache hit.
[2025-06-01 13:33:06] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 4/434 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (OVERLAPS) 388/822 variables, 434/480 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 822/960 variables, and 500 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 434/503 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 4/434 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (OVERLAPS) 388/822 variables, 434/480 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 384/884 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/960 variables, and 884 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 434/503 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 503/964 places, 457/913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75762 ms. Remains : 503/964 places, 457/913 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-04
Stuttering criterion allowed to conclude after 642 steps with 2 reset in 5 ms.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-04 finished in 75860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0||G(p1))))))))'
Support contains 4 out of 964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 959 transition count 913
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 11 place count 953 transition count 907
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 953 transition count 907
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 948 transition count 902
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 948 transition count 902
Applied a total of 27 rules in 113 ms. Remains 948 /964 variables (removed 16) and now considering 902/913 (removed 11) transitions.
// Phase 1: matrix 902 rows 948 cols
[2025-06-01 13:34:06] [INFO ] Computed 46 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:34:07] [INFO ] Implicit Places using invariants in 453 ms returned []
[2025-06-01 13:34:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:34:17] [INFO ] Implicit Places using invariants and state equation in 10583 ms returned []
Implicit Place search using SMT with State Equation took 11038 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2025-06-01 13:34: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/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 948/964 places, 902/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71329 ms. Remains : 948/964 places, 902/913 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-06
Product exploration explored 100000 steps with 20000 reset in 400 ms.
Product exploration explored 100000 steps with 20000 reset in 443 ms.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (40 resets) in 269 ms. (148 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
[2025-06-01 13:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 785/789 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/871 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 902/1773 variables, 871/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/1850 variables, 77/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1850 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1850 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1850/1850 variables, and 994 constraints, problems are : Problem set: 0 solved, 1 unsolved in 746 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 948/948 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 785/789 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/871 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 902/1773 variables, 871/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/1850 variables, 77/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1850 variables, 1/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1850 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1850 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1850/1850 variables, and 995 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1269 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 948/948 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2024ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 902/902 transitions.
Graph (complete) has 1815 edges and 948 vertex of which 934 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 407 rules applied. Total rules applied 408 place count 934 transition count 495
Reduce places removed 393 places and 0 transitions.
Graph (complete) has 963 edges and 541 vertex of which 467 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.0 ms
Discarding 74 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 396 rules applied. Total rules applied 804 place count 467 transition count 493
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 880 place count 465 transition count 419
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 881 place count 464 transition count 418
Iterating global reduction 3 with 1 rules applied. Total rules applied 882 place count 464 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 883 place count 463 transition count 417
Iterating global reduction 3 with 1 rules applied. Total rules applied 884 place count 463 transition count 417
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 911 place count 463 transition count 390
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 938 place count 436 transition count 390
Reduce places removed 39 places and 39 transitions.
Iterating global reduction 4 with 39 rules applied. Total rules applied 977 place count 397 transition count 351
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 4 with 111 rules applied. Total rules applied 1088 place count 384 transition count 253
Reduce places removed 98 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 100 rules applied. Total rules applied 1188 place count 286 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1190 place count 284 transition count 251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1190 place count 284 transition count 240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1212 place count 273 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1214 place count 272 transition count 239
Applied a total of 1214 rules in 82 ms. Remains 272 /948 variables (removed 676) and now considering 239/902 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 272/948 places, 239/902 transitions.
RANDOM walk for 40000 steps (164 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1888 steps (2 resets) in 10 ms. (171 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 43 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2025-06-01 13:35:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:35:22] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-06-01 13:35:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:35:33] [INFO ] Implicit Places using invariants and state equation in 10437 ms returned []
Implicit Place search using SMT with State Equation took 10893 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2025-06-01 13:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in LTL mode , in 1 iterations and 71106 ms. Remains : 948/948 places, 902/902 transitions.
Computed a total of 948 stabilizing places and 902 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 948 transition count 902
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (40 resets) in 208 ms. (191 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
[2025-06-01 13:36:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 785/789 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/871 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 902/1773 variables, 871/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/1850 variables, 77/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1850 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1850 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1850/1850 variables, and 994 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 948/948 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 785/789 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/871 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 902/1773 variables, 871/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1773 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/1850 variables, 77/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1850 variables, 1/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1850 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1850 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1850/1850 variables, and 995 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 948/948 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1976ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 902/902 transitions.
Graph (complete) has 1815 edges and 948 vertex of which 934 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 407 rules applied. Total rules applied 408 place count 934 transition count 495
Reduce places removed 393 places and 0 transitions.
Graph (complete) has 963 edges and 541 vertex of which 467 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.0 ms
Discarding 74 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 396 rules applied. Total rules applied 804 place count 467 transition count 493
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 880 place count 465 transition count 419
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 881 place count 464 transition count 418
Iterating global reduction 3 with 1 rules applied. Total rules applied 882 place count 464 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 883 place count 463 transition count 417
Iterating global reduction 3 with 1 rules applied. Total rules applied 884 place count 463 transition count 417
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 911 place count 463 transition count 390
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 938 place count 436 transition count 390
Reduce places removed 39 places and 39 transitions.
Iterating global reduction 4 with 39 rules applied. Total rules applied 977 place count 397 transition count 351
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 4 with 111 rules applied. Total rules applied 1088 place count 384 transition count 253
Reduce places removed 98 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 100 rules applied. Total rules applied 1188 place count 286 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1190 place count 284 transition count 251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1190 place count 284 transition count 240
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1212 place count 273 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1214 place count 272 transition count 239
Applied a total of 1214 rules in 82 ms. Remains 272 /948 variables (removed 676) and now considering 239/902 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 272/948 places, 239/902 transitions.
RANDOM walk for 40000 steps (164 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 531 steps (0 resets) in 4 ms. (106 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 441 ms.
Product exploration explored 100000 steps with 20000 reset in 472 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 948 transition count 902
Deduced a syphon composed of 395 places in 3 ms
Applied a total of 395 rules in 58 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:36:38] [INFO ] Redundant transitions in 9 ms returned []
Running 862 sub problems to find dead transitions.
// Phase 1: matrix 902 rows 948 cols
[2025-06-01 13:36:38] [INFO ] Computed 46 invariants in 6 ms
[2025-06-01 13:36:38] [INFO ] State equation strengthened by 395 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, ReadFeed: 0/395 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, ReadFeed: 0/395 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 948/948 places, 902/902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60241 ms. Remains : 948/948 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin16086308255916951417
[2025-06-01 13:37:38] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16086308255916951417
Running compilation step : cd /tmp/ltsmin16086308255916951417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1504 ms.
Running link step : cd /tmp/ltsmin16086308255916951417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16086308255916951417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8394528892122218119.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 948 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 948/948 places, 902/902 transitions.
Applied a total of 0 rules in 36 ms. Remains 948 /948 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 948 cols
[2025-06-01 13:37:53] [INFO ] Computed 46 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:37:54] [INFO ] Implicit Places using invariants in 473 ms returned []
[2025-06-01 13:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:38:04] [INFO ] Implicit Places using invariants and state equation in 10446 ms returned []
Implicit Place search using SMT with State Equation took 10928 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2025-06-01 13:38:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/1850 variables, and 6 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/908 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 40/948 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/1850 variables, and 46 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/948 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Finished structural reductions in LTL mode , in 1 iterations and 71144 ms. Remains : 948/948 places, 902/902 transitions.
Built C files in :
/tmp/ltsmin2524142805721160760
[2025-06-01 13:39:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2524142805721160760
Running compilation step : cd /tmp/ltsmin2524142805721160760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1491 ms.
Running link step : cd /tmp/ltsmin2524142805721160760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2524142805721160760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5071818347817411700.hoa' '--buchi-type=spotba'
LTSmin run took 5588 ms.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-06 finished in 305737 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 964 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Graph (complete) has 1836 edges and 964 vertex of which 959 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 39 places and 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 401 place count 920 transition count 474
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 801 place count 520 transition count 474
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 807 place count 514 transition count 468
Iterating global reduction 2 with 6 rules applied. Total rules applied 813 place count 514 transition count 468
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 814 place count 514 transition count 467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 815 place count 513 transition count 467
Applied a total of 815 rules in 45 ms. Remains 513 /964 variables (removed 451) and now considering 467/913 (removed 446) transitions.
// Phase 1: matrix 467 rows 513 cols
[2025-06-01 13:39:12] [INFO ] Computed 46 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:39:12] [INFO ] Implicit Places using invariants in 696 ms returned []
[2025-06-01 13:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:39:25] [INFO ] Implicit Places using invariants and state equation in 12318 ms returned []
Implicit Place search using SMT with State Equation took 13016 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:39:25] [INFO ] Redundant transitions in 2 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 13:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 3/440 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 394/834 variables, 440/486 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 834/980 variables, and 486 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 440/513 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 3/440 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 394/834 variables, 440/486 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 391/877 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 834/980 variables, and 877 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 46/46 constraints, State Equation: 440/513 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 513/964 places, 467/913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73132 ms. Remains : 513/964 places, 467/913 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-07
Stuttering criterion allowed to conclude after 508 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-07 finished in 73190 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))&&F(p1)))'
Support contains 4 out of 964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 960 transition count 913
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 955 transition count 908
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 955 transition count 908
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 951 transition count 904
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 951 transition count 904
Applied a total of 22 rules in 114 ms. Remains 951 /964 variables (removed 13) and now considering 904/913 (removed 9) transitions.
// Phase 1: matrix 904 rows 951 cols
[2025-06-01 13:40:25] [INFO ] Computed 47 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:40:26] [INFO ] Implicit Places using invariants in 471 ms returned []
[2025-06-01 13:40:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:40:37] [INFO ] Implicit Places using invariants and state equation in 11047 ms returned []
Implicit Place search using SMT with State Equation took 11520 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2025-06-01 13:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 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 910/1855 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 951/964 places, 904/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71820 ms. Remains : 951/964 places, 904/913 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 352 steps with 1 reset in 3 ms.
FORMULA HirschbergSinclair-PT-40-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-09 finished in 72005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 964/964 places, 913/913 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 960 transition count 913
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 955 transition count 908
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 955 transition count 908
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 951 transition count 904
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 951 transition count 904
Applied a total of 22 rules in 113 ms. Remains 951 /964 variables (removed 13) and now considering 904/913 (removed 9) transitions.
// Phase 1: matrix 904 rows 951 cols
[2025-06-01 13:41:37] [INFO ] Computed 47 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:41:38] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-06-01 13:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:41:48] [INFO ] Implicit Places using invariants and state equation in 10789 ms returned []
Implicit Place search using SMT with State Equation took 11248 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2025-06-01 13:41: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/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/1855 variables, and 6 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/910 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/910 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 2/912 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1855 variables, and 7 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/46 constraints, State Equation: 0/951 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 951/964 places, 904/913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71541 ms. Remains : 951/964 places, 904/913 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-40-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Computed a total of 951 stabilizing places and 904 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 951 transition count 904
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-40-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-40-LTLCardinality-15 finished in 72721 ms.
All properties solved by simple procedures.
Total runtime 1342361 ms.
BK_STOP 1748785370538
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="HirschbergSinclair-PT-40"
export BK_EXAMINATION="LTLCardinality"
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 HirschbergSinclair-PT-40, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422100115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-40.tgz
mv HirschbergSinclair-PT-40 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;