Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812600435.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 Parking-PT-832, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812600435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 251K 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 Parking-PT-832-LTLCardinality-00
FORMULA_NAME Parking-PT-832-LTLCardinality-01
FORMULA_NAME Parking-PT-832-LTLCardinality-02
FORMULA_NAME Parking-PT-832-LTLCardinality-03
FORMULA_NAME Parking-PT-832-LTLCardinality-04
FORMULA_NAME Parking-PT-832-LTLCardinality-05
FORMULA_NAME Parking-PT-832-LTLCardinality-06
FORMULA_NAME Parking-PT-832-LTLCardinality-07
FORMULA_NAME Parking-PT-832-LTLCardinality-08
FORMULA_NAME Parking-PT-832-LTLCardinality-09
FORMULA_NAME Parking-PT-832-LTLCardinality-10
FORMULA_NAME Parking-PT-832-LTLCardinality-11
FORMULA_NAME Parking-PT-832-LTLCardinality-12
FORMULA_NAME Parking-PT-832-LTLCardinality-13
FORMULA_NAME Parking-PT-832-LTLCardinality-14
FORMULA_NAME Parking-PT-832-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748885918006

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-832
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 17:38:39] [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-02 17:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:38:39] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2025-06-02 17:38:39] [INFO ] Transformed 737 places.
[2025-06-02 17:38:39] [INFO ] Transformed 993 transitions.
[2025-06-02 17:38:39] [INFO ] Found NUPN structural information;
[2025-06-02 17:38:39] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 730 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 730 transition count 602
Applied a total of 14 rules in 116 ms. Remains 730 /737 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 730 cols
[2025-06-02 17:38:39] [INFO ] Computed 184 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:40] [INFO ] Implicit Places using invariants in 598 ms returned [136, 144, 152, 160, 184, 186, 213, 221, 229, 237, 261, 263, 290, 298, 306, 314, 338, 340, 367, 375, 383, 391, 415, 417, 444, 452, 460, 468, 492, 494, 521, 529, 537, 545, 569, 571, 598, 606, 614, 622, 646, 648, 676, 684, 692, 700, 724, 726]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 639 ms to find 48 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 682/737 places, 602/609 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 652 transition count 572
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 652 transition count 572
Applied a total of 60 rules in 56 ms. Remains 652 /682 variables (removed 30) and now considering 572/602 (removed 30) transitions.
// Phase 1: matrix 572 rows 652 cols
[2025-06-02 17:38:40] [INFO ] Computed 136 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:40] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-02 17:38:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:40] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:38:42] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 652/737 places, 572/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2631 ms. Remains : 652/737 places, 572/609 transitions.
Support contains 40 out of 652 places after structural reductions.
[2025-06-02 17:38:42] [INFO ] Flatten gal took : 83 ms
[2025-06-02 17:38:42] [INFO ] Flatten gal took : 35 ms
[2025-06-02 17:38:42] [INFO ] Input system was already deterministic with 572 transitions.
RANDOM walk for 40000 steps (201 resets) in 1728 ms. (23 steps per ms) remains 7/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
[2025-06-02 17:38:43] [INFO ] Invariant cache hit.
[2025-06-02 17:38:43] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 286/296 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 356/652 variables, 128/136 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/652 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 572/1224 variables, 652/788 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1224 variables, 152/940 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 0/940 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1224 variables, 0/940 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1224/1224 variables, and 940 constraints, problems are : Problem set: 1 solved, 6 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 652/652 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 239/246 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 406/652 variables, 130/136 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/652 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 572/1224 variables, 652/788 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1224 variables, 152/940 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 6/946 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1224 variables, 0/946 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1224 variables, 0/946 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1224/1224 variables, and 946 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 652/652 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2814ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 944 ms.
Support contains 7 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 652 transition count 556
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 636 transition count 556
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 636 transition count 540
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 620 transition count 540
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 619 transition count 539
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 619 transition count 539
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 587 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 586 transition count 526
Free-agglomeration rule applied 163 times.
Iterating global reduction 2 with 163 rules applied. Total rules applied 295 place count 586 transition count 363
Reduce places removed 163 places and 0 transitions.
Graph (complete) has 857 edges and 423 vertex of which 278 are kept as prefixes of interest. Removing 145 places using SCC suffix rule.1 ms
Discarding 145 places :
Also discarding 112 output transitions
Drop transitions (Output transitions of discarded places.) removed 112 transitions
Iterating post reduction 2 with 164 rules applied. Total rules applied 459 place count 278 transition count 251
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 497 place count 278 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 498 place count 277 transition count 212
Reduce places removed 94 places and 0 transitions.
Graph (trivial) has 189 edges and 183 vertex of which 60 / 183 are part of one of the 4 SCC in 2 ms
Free SCC test removed 56 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 4 with 185 rules applied. Total rules applied 683 place count 127 transition count 122
Reduce places removed 90 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 174 rules applied. Total rules applied 857 place count 37 transition count 38
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 861 place count 33 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 861 place count 33 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 869 place count 29 transition count 34
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 872 place count 26 transition count 31
Iterating global reduction 7 with 3 rules applied. Total rules applied 875 place count 26 transition count 31
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 877 place count 24 transition count 29
Iterating global reduction 7 with 2 rules applied. Total rules applied 879 place count 24 transition count 29
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 881 place count 22 transition count 26
Iterating global reduction 7 with 2 rules applied. Total rules applied 883 place count 22 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 884 place count 22 transition count 25
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 885 place count 21 transition count 24
Iterating global reduction 8 with 1 rules applied. Total rules applied 886 place count 21 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 887 place count 21 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 891 place count 19 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 892 place count 19 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 895 place count 19 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 898 place count 16 transition count 17
Applied a total of 898 rules in 196 ms. Remains 16 /652 variables (removed 636) and now considering 17/572 (removed 555) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 16/652 places, 17/572 transitions.
RANDOM walk for 77 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/6 properties
FORMULA Parking-PT-832-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(X(X(p1))&&F(p2))))))'
Support contains 3 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 650 transition count 570
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 650 transition count 570
Applied a total of 4 rules in 40 ms. Remains 650 /652 variables (removed 2) and now considering 570/572 (removed 2) transitions.
// Phase 1: matrix 570 rows 650 cols
[2025-06-02 17:38:47] [INFO ] Computed 136 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:48] [INFO ] Implicit Places using invariants in 248 ms returned []
[2025-06-02 17:38:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:48] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:38:50] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 2285 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2025-06-02 17:38:50] [INFO ] Invariant cache hit.
[2025-06-02 17:38:50] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (OVERLAPS) 1/650 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:06] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:06] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:06] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/650 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 650/1220 variables, and 144 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/650 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (OVERLAPS) 1/650 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/650 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/650 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (OVERLAPS) 570/1220 variables, 650/794 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 152/946 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 569/1515 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1515 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 650/652 places, 570/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62531 ms. Remains : 650/652 places, 570/572 transitions.
Stuttering acceptance computed with spot in 574 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-00
Product exploration explored 100000 steps with 20000 reset in 1298 ms.
Product exploration explored 100000 steps with 20000 reset in 1347 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 11 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (199 resets) in 518 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 510357 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 510357 steps, saw 92389 distinct states, run finished after 3009 ms. (steps per millisecond=169 ) properties seen :0
[2025-06-02 17:39:57] [INFO ] Invariant cache hit.
[2025-06-02 17:39:57] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 553/650 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 570/1220 variables, 650/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 152/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 553/650 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:57] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:57] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 570/1220 variables, 650/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 152/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1220 variables, 1/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1220 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1220 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1058ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 570/570 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 650 transition count 554
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 634 transition count 554
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 634 transition count 538
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 618 transition count 538
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 617 transition count 537
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 617 transition count 537
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 585 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 584 transition count 524
Free-agglomeration rule applied 163 times.
Iterating global reduction 2 with 163 rules applied. Total rules applied 295 place count 584 transition count 361
Reduce places removed 163 places and 0 transitions.
Graph (complete) has 852 edges and 421 vertex of which 117 are kept as prefixes of interest. Removing 304 places using SCC suffix rule.0 ms
Discarding 304 places :
Also discarding 244 output transitions
Drop transitions (Output transitions of discarded places.) removed 244 transitions
Iterating post reduction 2 with 164 rules applied. Total rules applied 459 place count 117 transition count 117
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 491 place count 117 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 492 place count 116 transition count 84
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 80 edges and 72 vertex of which 30 / 72 are part of one of the 2 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 4 with 81 rules applied. Total rules applied 573 place count 44 transition count 48
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 78 rules applied. Total rules applied 651 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 653 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 653 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 657 place count 4 transition count 4
Applied a total of 657 rules in 85 ms. Remains 4 /650 variables (removed 646) and now considering 4/570 (removed 566) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 4/650 places, 4/570 transitions.
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 650 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 570/570 transitions.
Applied a total of 0 rules in 14 ms. Remains 650 /650 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2025-06-02 17:39:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:59] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-06-02 17:39:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:39:59] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:40:01] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2025-06-02 17:40:01] [INFO ] Invariant cache hit.
[2025-06-02 17:40:01] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (OVERLAPS) 1/650 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:15] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:15] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:16] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:16] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:16] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:16] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:17] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:17] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/650 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 569 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 650/1220 variables, and 144 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/650 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/649 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (OVERLAPS) 1/650 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/650 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/650 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (OVERLAPS) 570/1220 variables, 650/794 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1220 variables, 152/946 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 569/1515 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 1515 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 62457 ms. Remains : 650/650 places, 570/570 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (201 resets) in 316 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 508910 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 508910 steps, saw 92263 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2025-06-02 17:41:04] [INFO ] Invariant cache hit.
[2025-06-02 17:41:04] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 553/650 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 570/1220 variables, 650/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 152/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 553/650 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:05] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:05] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 570/1220 variables, 650/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 152/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1220 variables, 1/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1220 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1220 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 650/650 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 954ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 650/650 places, 570/570 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 650 transition count 554
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 634 transition count 554
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 634 transition count 538
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 618 transition count 538
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 617 transition count 537
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 617 transition count 537
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 585 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 584 transition count 524
Free-agglomeration rule applied 163 times.
Iterating global reduction 2 with 163 rules applied. Total rules applied 295 place count 584 transition count 361
Reduce places removed 163 places and 0 transitions.
Graph (complete) has 852 edges and 421 vertex of which 117 are kept as prefixes of interest. Removing 304 places using SCC suffix rule.0 ms
Discarding 304 places :
Also discarding 244 output transitions
Drop transitions (Output transitions of discarded places.) removed 244 transitions
Iterating post reduction 2 with 164 rules applied. Total rules applied 459 place count 117 transition count 117
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 491 place count 117 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 492 place count 116 transition count 84
Reduce places removed 44 places and 0 transitions.
Graph (trivial) has 80 edges and 72 vertex of which 30 / 72 are part of one of the 2 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 4 with 81 rules applied. Total rules applied 573 place count 44 transition count 48
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 78 rules applied. Total rules applied 651 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 653 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 653 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 657 place count 4 transition count 4
Applied a total of 657 rules in 109 ms. Remains 4 /650 variables (removed 646) and now considering 4/570 (removed 566) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 4/650 places, 4/570 transitions.
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 1199 ms.
Product exploration explored 100000 steps with 20000 reset in 1241 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 650/650 places, 570/570 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 650 transition count 570
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 16 place count 650 transition count 570
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 650 transition count 570
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 49 place count 633 transition count 553
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 66 place count 633 transition count 553
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 98 place count 633 transition count 569
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 98 rules in 123 ms. Remains 633 /650 variables (removed 17) and now considering 569/570 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:41:09] [INFO ] Redundant transitions in 34 ms returned []
Running 568 sub problems to find dead transitions.
// Phase 1: matrix 569 rows 633 cols
[2025-06-02 17:41:09] [INFO ] Computed 136 invariants in 3 ms
[2025-06-02 17:41:09] [INFO ] State equation strengthened by 216 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/633 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:23] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:23] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:23] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:23] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:25] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 2 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 16/152 constraints. Problems are: Problem set: 64 solved, 504 unsolved
(s324 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 0.0timeout
)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/633 variables, 0/152 constraints. Problems are: Problem set: 64 solved, 504 unsolved
SMT process timed out in 30125ms, After SMT, problems are : Problem set: 64 solved, 504 unsolved
Search for dead transitions found 64 dead transitions in 30127ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 633/650 places, 505/570 transitions.
Graph (complete) has 1552 edges and 633 vertex of which 585 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.2 ms
Discarding 48 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 585 transition count 529
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 35 ms. Remains 585 /633 variables (removed 48) and now considering 529/505 (removed -24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 585/650 places, 529/570 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30351 ms. Remains : 585/650 places, 529/570 transitions.
Built C files in :
/tmp/ltsmin12601967836640141749
[2025-06-02 17:41:39] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12601967836640141749
Running compilation step : cd /tmp/ltsmin12601967836640141749;'/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 1017 ms.
Running link step : cd /tmp/ltsmin12601967836640141749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12601967836640141749;'/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/stateBased11124991829210771057.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 650 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 650/650 places, 570/570 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 649 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 649 transition count 569
Applied a total of 2 rules in 32 ms. Remains 649 /650 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 649 cols
[2025-06-02 17:41:54] [INFO ] Computed 136 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:55] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-06-02 17:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:41:55] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:41:56] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2025-06-02 17:41:56] [INFO ] Invariant cache hit.
[2025-06-02 17:41:56] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:11] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:11] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:11] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:11] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:12] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:12] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:12] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:12] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/1218 variables, and 144 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/649 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (OVERLAPS) 569/1218 variables, 649/793 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 152/945 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 568/1513 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1513 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 649/650 places, 569/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61745 ms. Remains : 649/650 places, 569/570 transitions.
Built C files in :
/tmp/ltsmin10849912502532423031
[2025-06-02 17:42:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10849912502532423031
Running compilation step : cd /tmp/ltsmin10849912502532423031;'/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 876 ms.
Running link step : cd /tmp/ltsmin10849912502532423031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10849912502532423031;'/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/stateBased1529574495242058570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 17:43:11] [INFO ] Flatten gal took : 32 ms
[2025-06-02 17:43:11] [INFO ] Flatten gal took : 28 ms
[2025-06-02 17:43:11] [INFO ] Time to serialize gal into /tmp/LTL813941669191201013.gal : 5 ms
[2025-06-02 17:43:11] [INFO ] Time to serialize properties into /tmp/LTL5133787796819914589.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL813941669191201013.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17567611061745645429.hoa' '-atoms' '/tmp/LTL5133787796819914589.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5133787796819914589.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17567611061745645429.hoa
Detected timeout of ITS tools.
[2025-06-02 17:43:26] [INFO ] Flatten gal took : 26 ms
[2025-06-02 17:43:26] [INFO ] Flatten gal took : 23 ms
[2025-06-02 17:43:26] [INFO ] Time to serialize gal into /tmp/LTL5890635171537409681.gal : 5 ms
[2025-06-02 17:43:27] [INFO ] Time to serialize properties into /tmp/LTL7257511852108546106.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5890635171537409681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7257511852108546106.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((p252==0)&&(p555==1))"))||((X(X("((p555==0)||(p252==1))")))&&(F("(p629==0)")))))))
Formula 0 simplified : XX(F!"((p252==0)&&(p555==1))" & (XX!"((p555==0)||(p252==1))" | G!"(p629==0)"))
Detected timeout of ITS tools.
[2025-06-02 17:43:42] [INFO ] Flatten gal took : 22 ms
[2025-06-02 17:43:42] [INFO ] Applying decomposition
[2025-06-02 17:43:42] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1421685223333037065.txt' '-o' '/tmp/graph1421685223333037065.bin' '-w' '/tmp/graph1421685223333037065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1421685223333037065.bin' '-l' '-1' '-v' '-w' '/tmp/graph1421685223333037065.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:43:42] [INFO ] Decomposing Gal with order
[2025-06-02 17:43:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:43:42] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-02 17:43:42] [INFO ] Flatten gal took : 75 ms
[2025-06-02 17:43:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-02 17:43:42] [INFO ] Time to serialize gal into /tmp/LTL15789492393924273845.gal : 10 ms
[2025-06-02 17:43:42] [INFO ] Time to serialize properties into /tmp/LTL13993302028983191248.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15789492393924273845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13993302028983191248.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((i9.u97.p252==0)&&(i12.i2.i2.u187.p555==1))"))||((X(X("((i12.i2.i2.u187.p555==0)||(i9.u97.p252==1))")))&&(F("(i14.u218.p62...168
Formula 0 simplified : XX(F!"((i9.u97.p252==0)&&(i12.i2.i2.u187.p555==1))" & (XX!"((i12.i2.i2.u187.p555==0)||(i9.u97.p252==1))" | G!"(i14.u218.p629==0)"))
Reverse transition relation is NOT exact ! Due to transitions i2.u78.t129, i4.u102.t111, i6.i0.i5.u126.t93, i8.u150.t75, i11.u173.t57, i13.u196.t39, i14.u2...275
Computing Next relation with stutter on 7.8311e+10 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
696 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.03238,339252,1,0,826681,2984,7683,1.3207e+06,554,8704,955321
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-832-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-LTLCardinality-00 finished in 303646 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) U X((F(G((p0 U p1)))||G(p2))))))'
Support contains 5 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 30 ms. Remains 649 /652 variables (removed 3) and now considering 569/572 (removed 3) transitions.
[2025-06-02 17:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:43:51] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-02 17:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:43:51] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:43:52] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2025-06-02 17:43:52] [INFO ] Invariant cache hit.
[2025-06-02 17:43:52] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:07] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:07] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:07] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:08] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:08] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:08] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:08] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:09] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 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 649/1218 variables, and 144 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/649 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (OVERLAPS) 569/1218 variables, 649/793 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 152/945 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 568/1513 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1513 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 649/652 places, 569/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61626 ms. Remains : 649/652 places, 569/572 transitions.
Stuttering acceptance computed with spot in 477 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-02
Product exploration explored 100000 steps with 504 reset in 590 ms.
Product exploration explored 100000 steps with 502 reset in 644 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 296 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (199 resets) in 314 ms. (126 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
[2025-06-02 17:44:55] [INFO ] Invariant cache hit.
[2025-06-02 17:44:55] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 190/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 454/649 variables, 131/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 569/1218 variables, 649/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 152/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1218 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1218 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1218/1218 variables, and 937 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 190/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 454/649 variables, 131/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 569/1218 variables, 649/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 152/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1218 variables, 2/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1218 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1218 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 939 constraints, problems are : Problem set: 0 solved, 2 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1228ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 169 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=28 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 11 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 576 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Support contains 5 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 569/569 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 649 transition count 553
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 633 transition count 553
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 633 transition count 537
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 617 transition count 537
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 126 place count 586 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 585 transition count 525
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 585 transition count 525
Applied a total of 129 rules in 83 ms. Remains 585 /649 variables (removed 64) and now considering 525/569 (removed 44) transitions.
// Phase 1: matrix 525 rows 585 cols
[2025-06-02 17:44:57] [INFO ] Computed 136 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:44:57] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-02 17:44:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:44:58] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-02 17:44:59] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:44:59] [INFO ] Redundant transitions in 13 ms returned []
Running 520 sub problems to find dead transitions.
[2025-06-02 17:44:59] [INFO ] Invariant cache hit.
[2025-06-02 17:44:59] [INFO ] State equation strengthened by 220 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 525/1110 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 220/941 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 941 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 525/1110 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 220/941 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 520/1461 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 1461 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in SI_LTL mode, iteration 1 : 585/649 places, 525/569 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62500 ms. Remains : 585/649 places, 525/569 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 330 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (202 resets) in 309 ms. (129 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2025-06-02 17:46:00] [INFO ] Invariant cache hit.
[2025-06-02 17:46:00] [INFO ] State equation strengthened by 220 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 417/585 variables, 131/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 525/1110 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 220/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1110 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 220/220 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 417/585 variables, 131/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 525/1110 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 220/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1110 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 942 constraints, problems are : Problem set: 0 solved, 1 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 906ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 525/525 transitions.
Free-agglomeration rule applied 161 times.
Iterating global reduction 0 with 161 rules applied. Total rules applied 161 place count 585 transition count 364
Reduce places removed 161 places and 0 transitions.
Graph (complete) has 857 edges and 424 vertex of which 283 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.0 ms
Discarding 141 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Iterating post reduction 0 with 162 rules applied. Total rules applied 323 place count 283 transition count 268
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 353 place count 283 transition count 238
Applied a total of 353 rules in 34 ms. Remains 283 /585 variables (removed 302) and now considering 238/525 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 283/585 places, 238/525 transitions.
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 9325 steps (1 resets) in 28 ms. (321 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 540 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 514 reset in 526 ms.
Product exploration explored 100000 steps with 513 reset in 632 ms.
Built C files in :
/tmp/ltsmin610249536917815620
[2025-06-02 17:46:03] [INFO ] Computing symmetric may disable matrix : 525 transitions.
[2025-06-02 17:46:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:46:03] [INFO ] Computing symmetric may enable matrix : 525 transitions.
[2025-06-02 17:46:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:46:04] [INFO ] Computing Do-Not-Accords matrix : 525 transitions.
[2025-06-02 17:46:04] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:46:04] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin610249536917815620
Running compilation step : cd /tmp/ltsmin610249536917815620;'/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 1227 ms.
Running link step : cd /tmp/ltsmin610249536917815620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin610249536917815620;'/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/stateBased15424076752499430497.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 525/525 transitions.
Applied a total of 0 rules in 23 ms. Remains 585 /585 variables (removed 0) and now considering 525/525 (removed 0) transitions.
[2025-06-02 17:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:19] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-06-02 17:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:19] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-02 17:46:21] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:46:21] [INFO ] Redundant transitions in 6 ms returned []
Running 520 sub problems to find dead transitions.
[2025-06-02 17:46:21] [INFO ] Invariant cache hit.
[2025-06-02 17:46:21] [INFO ] State equation strengthened by 220 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 525/1110 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 220/941 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 941 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 525/1110 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 220/941 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 520/1461 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 1461 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62478 ms. Remains : 585/585 places, 525/525 transitions.
Built C files in :
/tmp/ltsmin8419625412633448010
[2025-06-02 17:47:21] [INFO ] Computing symmetric may disable matrix : 525 transitions.
[2025-06-02 17:47:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:47:21] [INFO ] Computing symmetric may enable matrix : 525 transitions.
[2025-06-02 17:47:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:47:21] [INFO ] Computing Do-Not-Accords matrix : 525 transitions.
[2025-06-02 17:47:21] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:47:21] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8419625412633448010
Running compilation step : cd /tmp/ltsmin8419625412633448010;'/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 1226 ms.
Running link step : cd /tmp/ltsmin8419625412633448010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8419625412633448010;'/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/stateBased12531926763838679083.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 17:47:36] [INFO ] Flatten gal took : 31 ms
[2025-06-02 17:47:36] [INFO ] Flatten gal took : 29 ms
[2025-06-02 17:47:36] [INFO ] Time to serialize gal into /tmp/LTL11724761705734745671.gal : 4 ms
[2025-06-02 17:47:36] [INFO ] Time to serialize properties into /tmp/LTL18444896821618511226.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11724761705734745671.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4921929478364191653.hoa' '-atoms' '/tmp/LTL18444896821618511226.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18444896821618511226.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4921929478364191653.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2025-06-02 17:47:51] [INFO ] Flatten gal took : 23 ms
[2025-06-02 17:47:51] [INFO ] Flatten gal took : 22 ms
[2025-06-02 17:47:51] [INFO ] Time to serialize gal into /tmp/LTL4037681914705819422.gal : 4 ms
[2025-06-02 17:47:51] [INFO ] Time to serialize properties into /tmp/LTL3525884222936975123.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4037681914705819422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3525884222936975123.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(p565==1)"))U(X((F(G(("(p565==1)")U("((p116==0)||(p719==1))"))))||(G("((p607==0)||(p237==1))")))))))
Formula 0 simplified : X(F!"(p565==1)" R X(GF(!"(p565==1)" R !"((p116==0)||(p719==1))") & F!"((p607==0)||(p237==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2025-06-02 17:48:06] [INFO ] Flatten gal took : 53 ms
[2025-06-02 17:48:06] [INFO ] Applying decomposition
[2025-06-02 17:48:07] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph475450178783235374.txt' '-o' '/tmp/graph475450178783235374.bin' '-w' '/tmp/graph475450178783235374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph475450178783235374.bin' '-l' '-1' '-v' '-w' '/tmp/graph475450178783235374.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:48:07] [INFO ] Decomposing Gal with order
[2025-06-02 17:48:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:48:07] [INFO ] Removed a total of 708 redundant transitions.
[2025-06-02 17:48:07] [INFO ] Flatten gal took : 38 ms
[2025-06-02 17:48:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 46 ms.
[2025-06-02 17:48:07] [INFO ] Time to serialize gal into /tmp/LTL12001325627165748022.gal : 7 ms
[2025-06-02 17:48:07] [INFO ] Time to serialize properties into /tmp/LTL1934071671484941514.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12001325627165748022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1934071671484941514.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(i0.i1.i2.u185.p565==1)"))U(X((F(G(("(i0.i1.i2.u185.p565==1)")U("((i3.u57.p116==0)||(i14.i1.i1.u230.p719==1))"))))||(G("((i11...196
Formula 0 simplified : X(F!"(i0.i1.i2.u185.p565==1)" R X(GF(!"(i0.i1.i2.u185.p565==1)" R !"((i3.u57.p116==0)||(i14.i1.i1.u230.p719==1))") & F!"((i11.u199.p...184
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
6 unique states visited
5 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
732 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.39466,266484,1,0,508550,564,5726,1.31204e+06,205,2038,455454
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-LTLCardinality-02 finished in 264727 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 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 652 transition count 557
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 637 transition count 557
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 637 transition count 542
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 622 transition count 542
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 619 transition count 539
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 619 transition count 539
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 587 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 586 transition count 526
Applied a total of 132 rules in 58 ms. Remains 586 /652 variables (removed 66) and now considering 526/572 (removed 46) transitions.
// Phase 1: matrix 526 rows 586 cols
[2025-06-02 17:48:16] [INFO ] Computed 136 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:48:16] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-02 17:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:48:16] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-02 17:48:18] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:48:18] [INFO ] Redundant transitions in 2 ms returned []
Running 521 sub problems to find dead transitions.
[2025-06-02 17:48:18] [INFO ] Invariant cache hit.
[2025-06-02 17:48:18] [INFO ] State equation strengthened by 220 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 526/1112 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 220/942 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1112/1112 variables, and 942 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 526/1112 variables, 586/722 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 220/942 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 521/1463 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1112/1112 variables, and 1463 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 586/586 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Starting structural reductions in SI_LTL mode, iteration 1 : 586/652 places, 526/572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62378 ms. Remains : 586/652 places, 526/572 transitions.
Stuttering acceptance computed with spot in 55 ms :[p0]
Running random walk in product with property : Parking-PT-832-LTLCardinality-03
Stuttering criterion allowed to conclude after 216 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-03 finished in 62460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||X(p2)))))'
Support contains 5 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 20 ms. Remains 649 /652 variables (removed 3) and now considering 569/572 (removed 3) transitions.
// Phase 1: matrix 569 rows 649 cols
[2025-06-02 17:49:18] [INFO ] Computed 136 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:49:18] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-06-02 17:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:49:19] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:49:20] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2025-06-02 17:49:20] [INFO ] Invariant cache hit.
[2025-06-02 17:49:20] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:34] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:34] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:35] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:35] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:35] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:35] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:36] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:49:36] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 1.0)
(s586 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/1218 variables, and 144 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/649 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (OVERLAPS) 569/1218 variables, 649/793 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 152/945 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 568/1513 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1513 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 649/652 places, 569/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61737 ms. Remains : 649/652 places, 569/572 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : Parking-PT-832-LTLCardinality-07
Product exploration explored 100000 steps with 33297 reset in 1364 ms.
Product exploration explored 100000 steps with 33402 reset in 1400 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 335 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 33642 steps (166 resets) in 326 ms. (102 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 16 factoid took 635 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 569/569 transitions.
Applied a total of 0 rules in 15 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2025-06-02 17:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:50:25] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-06-02 17:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:50:25] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:50:26] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2025-06-02 17:50:26] [INFO ] Invariant cache hit.
[2025-06-02 17:50:26] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:41] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:41] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:41] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:42] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:42] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:42] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:42] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:43] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/1218 variables, and 144 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/649 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (OVERLAPS) 569/1218 variables, 649/793 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 152/945 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 568/1513 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1513 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in LTL mode , in 1 iterations and 61726 ms. Remains : 649/649 places, 569/569 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 324 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 39254 steps (195 resets) in 276 ms. (141 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F p1), (F (NOT p0))]
Knowledge based reduction with 16 factoid took 653 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 33452 reset in 1355 ms.
Product exploration explored 100000 steps with 33436 reset in 1403 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 649 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 649/649 places, 569/569 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 649 transition count 569
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 15 place count 649 transition count 569
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 649 transition count 569
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 634 transition count 554
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 634 transition count 554
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 93 place count 634 transition count 570
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 93 rules in 42 ms. Remains 634 /649 variables (removed 15) and now considering 570/569 (removed -1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:51:31] [INFO ] Redundant transitions in 2 ms returned []
Running 569 sub problems to find dead transitions.
// Phase 1: matrix 570 rows 634 cols
[2025-06-02 17:51:31] [INFO ] Computed 136 invariants in 2 ms
[2025-06-02 17:51:31] [INFO ] State equation strengthened by 215 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (OVERLAPS) 1/634 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:45] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:45] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 2 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/634 variables, 16/152 constraints. Problems are: Problem set: 64 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/634 variables, 0/152 constraints. Problems are: Problem set: 64 solved, 505 unsolved
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 64 solved, 505 unsolved
Search for dead transitions found 64 dead transitions in 30091ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 634/649 places, 506/569 transitions.
Graph (complete) has 1553 edges and 634 vertex of which 586 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 586 transition count 530
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 23 ms. Remains 586 /634 variables (removed 48) and now considering 530/506 (removed -24) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 586/649 places, 530/569 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30167 ms. Remains : 586/649 places, 530/569 transitions.
Built C files in :
/tmp/ltsmin17374644369902600717
[2025-06-02 17:52:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17374644369902600717
Running compilation step : cd /tmp/ltsmin17374644369902600717;'/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 888 ms.
Running link step : cd /tmp/ltsmin17374644369902600717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17374644369902600717;'/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/stateBased4760813162962530524.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 649 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 649/649 places, 569/569 transitions.
Applied a total of 0 rules in 14 ms. Remains 649 /649 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 649 cols
[2025-06-02 17:52:16] [INFO ] Computed 136 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:52:17] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-06-02 17:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:52:17] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:52:18] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2025-06-02 17:52:18] [INFO ] Invariant cache hit.
[2025-06-02 17:52:18] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:33] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:33] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:33] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:33] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:34] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:34] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:34] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:34] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 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 649/1218 variables, and 144 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/649 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (OVERLAPS) 569/1218 variables, 649/793 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 152/945 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 568/1513 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1513 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Finished structural reductions in LTL mode , in 1 iterations and 61720 ms. Remains : 649/649 places, 569/569 transitions.
Built C files in :
/tmp/ltsmin16134743698989676484
[2025-06-02 17:53:18] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16134743698989676484
Running compilation step : cd /tmp/ltsmin16134743698989676484;'/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 927 ms.
Running link step : cd /tmp/ltsmin16134743698989676484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16134743698989676484;'/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/stateBased9228354442823819451.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 17:53:33] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:53:33] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:53:33] [INFO ] Time to serialize gal into /tmp/LTL17038404688571545389.gal : 3 ms
[2025-06-02 17:53:33] [INFO ] Time to serialize properties into /tmp/LTL852236720166716125.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17038404688571545389.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17740390741362098878.hoa' '-atoms' '/tmp/LTL852236720166716125.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL852236720166716125.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17740390741362098878.hoa
Detected timeout of ITS tools.
[2025-06-02 17:53:48] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:53:48] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:53:48] [INFO ] Time to serialize gal into /tmp/LTL2646838087727827031.gal : 3 ms
[2025-06-02 17:53:48] [INFO ] Time to serialize properties into /tmp/LTL6328878796041719768.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2646838087727827031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6328878796041719768.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("((p671==0)||(p19==1))")U(G(("(p225==1)")||(X("((p722==0)||(p154==1))"))))))
Formula 0 simplified : !"((p671==0)||(p19==1))" R F(!"(p225==1)" & X!"((p722==0)||(p154==1))")
Detected timeout of ITS tools.
[2025-06-02 17:54:03] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:54:03] [INFO ] Applying decomposition
[2025-06-02 17:54:03] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16582717424222215142.txt' '-o' '/tmp/graph16582717424222215142.bin' '-w' '/tmp/graph16582717424222215142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16582717424222215142.bin' '-l' '-1' '-v' '-w' '/tmp/graph16582717424222215142.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:54:03] [INFO ] Decomposing Gal with order
[2025-06-02 17:54:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:54:04] [INFO ] Removed a total of 50 redundant transitions.
[2025-06-02 17:54:04] [INFO ] Flatten gal took : 26 ms
[2025-06-02 17:54:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 17:54:04] [INFO ] Time to serialize gal into /tmp/LTL2682151305990674511.gal : 6 ms
[2025-06-02 17:54:04] [INFO ] Time to serialize properties into /tmp/LTL4308422161405032248.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2682151305990674511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4308422161405032248.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((("((i15.u223.p671==0)||(i12.u9.p19==1))")U(G(("(i5.u90.p225==1)")||(X("((i16.u235.p722==0)||(i4.u65.p154==1))"))))))
Formula 0 simplified : !"((i15.u223.p671==0)||(i12.u9.p19==1))" R F(!"(i5.u90.p225==1)" & X!"((i16.u235.p722==0)||(i4.u65.p154==1))")
Reverse transition relation is NOT exact ! Due to transitions i4.u78.t129, i5.u102.t111, i8.u125.t93, i9.u148.t75, i10.u171.t57, i11.u194.t39, i13.u216.t21...269
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Treatment of property Parking-PT-832-LTLCardinality-07 finished in 300521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 651 transition count 556
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 636 transition count 556
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 636 transition count 540
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 620 transition count 540
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 617 transition count 537
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 617 transition count 537
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 132 place count 585 transition count 505
Applied a total of 132 rules in 37 ms. Remains 585 /652 variables (removed 67) and now considering 505/572 (removed 67) transitions.
// Phase 1: matrix 505 rows 585 cols
[2025-06-02 17:54:19] [INFO ] Computed 136 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:54:19] [INFO ] Implicit Places using invariants in 248 ms returned []
[2025-06-02 17:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:54:19] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:54:19] [INFO ] Redundant transitions in 2 ms returned []
Running 337 sub problems to find dead transitions.
[2025-06-02 17:54:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 721 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 337/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1058 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 585/652 places, 505/572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60766 ms. Remains : 585/652 places, 505/572 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-08
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 5 ms.
FORMULA Parking-PT-832-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-08 finished in 60845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(X(F((p1&&X(F(p2))))))))))'
Support contains 5 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 23 ms. Remains 649 /652 variables (removed 3) and now considering 569/572 (removed 3) transitions.
// Phase 1: matrix 569 rows 649 cols
[2025-06-02 17:55:19] [INFO ] Computed 136 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:55:20] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-02 17:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:55:20] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:55:21] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2025-06-02 17:55:21] [INFO ] Invariant cache hit.
[2025-06-02 17:55:21] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:36] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:36] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:36] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:36] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:37] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:37] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:37] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:37] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/1218 variables, and 144 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/649 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (OVERLAPS) 569/1218 variables, 649/793 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 152/945 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 568/1513 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1513 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 649/652 places, 569/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61739 ms. Remains : 649/652 places, 569/572 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-09
Stuttering criterion allowed to conclude after 175 steps with 0 reset in 3 ms.
FORMULA Parking-PT-832-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-09 finished in 62087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p0)))'
Support contains 1 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 21 ms. Remains 649 /652 variables (removed 3) and now considering 569/572 (removed 3) transitions.
[2025-06-02 17:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:56:22] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-06-02 17:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:56:22] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:56:23] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2025-06-02 17:56:23] [INFO ] Invariant cache hit.
[2025-06-02 17:56:23] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:37] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:38] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:38] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:38] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:38] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:39] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:39] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:39] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/1218 variables, and 144 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/649 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (OVERLAPS) 569/1218 variables, 649/793 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 152/945 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 568/1513 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1513 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 649/652 places, 569/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61738 ms. Remains : 649/652 places, 569/572 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-832-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-10 finished in 61885 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 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 651 transition count 555
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 635 transition count 555
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 635 transition count 539
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 619 transition count 539
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 616 transition count 536
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 616 transition count 536
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 132 place count 585 transition count 505
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 585 transition count 505
Applied a total of 133 rules in 47 ms. Remains 585 /652 variables (removed 67) and now considering 505/572 (removed 67) transitions.
// Phase 1: matrix 505 rows 585 cols
[2025-06-02 17:57:23] [INFO ] Computed 136 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:57:24] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-06-02 17:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:57:24] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:57:24] [INFO ] Redundant transitions in 2 ms returned []
Running 337 sub problems to find dead transitions.
[2025-06-02 17:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 721 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 337/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1058 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in SI_LTL mode, iteration 1 : 585/652 places, 505/572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60768 ms. Remains : 585/652 places, 505/572 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-11
Stuttering criterion allowed to conclude after 9332 steps with 48 reset in 55 ms.
FORMULA Parking-PT-832-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-11 finished in 60890 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 U p1)&&F(G(p2))))))'
Support contains 5 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 649 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 649 transition count 569
Applied a total of 6 rules in 20 ms. Remains 649 /652 variables (removed 3) and now considering 569/572 (removed 3) transitions.
// Phase 1: matrix 569 rows 649 cols
[2025-06-02 17:58:24] [INFO ] Computed 136 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:58:25] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-06-02 17:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:58:25] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-02 17:58:26] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2025-06-02 17:58:26] [INFO ] Invariant cache hit.
[2025-06-02 17:58:26] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:40] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:41] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:41] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:41] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:41] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:42] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:42] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:42] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/1218 variables, and 144 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/649 constraints, ReadFeed: 0/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 1/649 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/649 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (OVERLAPS) 569/1218 variables, 649/793 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 152/945 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1218 variables, 568/1513 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1513 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 649/649 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 649/652 places, 569/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61676 ms. Remains : 649/652 places, 569/572 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-13
Stuttering criterion allowed to conclude after 220 steps with 0 reset in 1 ms.
FORMULA Parking-PT-832-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-LTLCardinality-13 finished in 61929 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 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 651 transition count 555
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 635 transition count 555
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 635 transition count 539
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 619 transition count 539
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 617 transition count 537
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 617 transition count 537
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 132 place count 585 transition count 505
Applied a total of 132 rules in 36 ms. Remains 585 /652 variables (removed 67) and now considering 505/572 (removed 67) transitions.
// Phase 1: matrix 505 rows 585 cols
[2025-06-02 17:59:26] [INFO ] Computed 136 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:59:27] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-06-02 17:59:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:59:27] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:59:27] [INFO ] Redundant transitions in 2 ms returned []
Running 337 sub problems to find dead transitions.
[2025-06-02 17:59:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:35] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 505/1090 variables, 585/722 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 722 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 505/1090 variables, 585/722 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 337/1059 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1059 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in SI_LTL mode, iteration 1 : 585/652 places, 505/572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60769 ms. Remains : 585/652 places, 505/572 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-832-LTLCardinality-15
Product exploration explored 100000 steps with 511 reset in 530 ms.
Product exploration explored 100000 steps with 513 reset in 564 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 55 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (204 resets) in 334 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540232 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540232 steps, saw 95742 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2025-06-02 18:00:32] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/99 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/161 variables, 40/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/194 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 41/235 variables, 37/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/274 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/274 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/1090 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 34/136 constraints, State Equation: 147/585 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/99 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/161 variables, 40/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/194 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 41/235 variables, 37/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/274 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/276 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/276 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/278 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/282 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/282 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/290 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/290 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 78/368 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/368 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 100/468 variables, 86/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/468 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/468 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 78/546 variables, 52/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/546 variables, 26/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/1090 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 68/136 constraints, State Equation: 293/585 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 10 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-06-02 18:00:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:00:32] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-06-02 18:00:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:00:33] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:00:33] [INFO ] Redundant transitions in 2 ms returned []
Running 337 sub problems to find dead transitions.
[2025-06-02 18:00: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/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:41] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 505/1090 variables, 585/722 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 722 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 505/1090 variables, 585/722 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 337/1059 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1059 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60775 ms. Remains : 585/585 places, 505/505 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (201 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559268 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559268 steps, saw 97856 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2025-06-02 18:01:36] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/99 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/161 variables, 40/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/194 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 41/235 variables, 37/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/274 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/274 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/1090 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 34/136 constraints, State Equation: 147/585 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/99 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/161 variables, 40/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/194 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 41/235 variables, 37/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 39/274 variables, 26/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/276 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/276 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/278 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/282 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/282 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/290 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/290 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 78/368 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/368 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 100/468 variables, 86/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/468 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/468 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 78/546 variables, 52/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/546 variables, 26/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/546 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/1090 variables, and 362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 68/136 constraints, State Equation: 293/585 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 118 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 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 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 511 reset in 532 ms.
Product exploration explored 100000 steps with 508 reset in 575 ms.
Built C files in :
/tmp/ltsmin4389464846578003322
[2025-06-02 18:01:38] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2025-06-02 18:01:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:01:38] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2025-06-02 18:01:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:01:38] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2025-06-02 18:01:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:01:38] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4389464846578003322
Running compilation step : cd /tmp/ltsmin4389464846578003322;'/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 1171 ms.
Running link step : cd /tmp/ltsmin4389464846578003322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin4389464846578003322;'/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/stateBased7568876389938526632.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 19 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-06-02 18:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:01:54] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-02 18:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:01:54] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:01:54] [INFO ] Redundant transitions in 2 ms returned []
Running 337 sub problems to find dead transitions.
[2025-06-02 18:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:02] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 505/1090 variables, 585/722 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 722 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 505/1090 variables, 585/722 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 337/1059 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1059 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60720 ms. Remains : 585/585 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin8459179709253768876
[2025-06-02 18:02:54] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2025-06-02 18:02:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:02:54] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2025-06-02 18:02:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:02:54] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2025-06-02 18:02:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:02:54] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8459179709253768876
Running compilation step : cd /tmp/ltsmin8459179709253768876;'/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 1116 ms.
Running link step : cd /tmp/ltsmin8459179709253768876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8459179709253768876;'/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/stateBased14415910167626225195.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:03:09] [INFO ] Flatten gal took : 21 ms
[2025-06-02 18:03:09] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:03:09] [INFO ] Time to serialize gal into /tmp/LTL4768052406721307133.gal : 3 ms
[2025-06-02 18:03:09] [INFO ] Time to serialize properties into /tmp/LTL16582304720710214534.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4768052406721307133.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7235814140659783659.hoa' '-atoms' '/tmp/LTL16582304720710214534.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16582304720710214534.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7235814140659783659.hoa
Detected timeout of ITS tools.
[2025-06-02 18:03:24] [INFO ] Flatten gal took : 27 ms
[2025-06-02 18:03:24] [INFO ] Flatten gal took : 19 ms
[2025-06-02 18:03:24] [INFO ] Time to serialize gal into /tmp/LTL14314150130649934128.gal : 3 ms
[2025-06-02 18:03:24] [INFO ] Time to serialize properties into /tmp/LTL13740414208798402718.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14314150130649934128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13740414208798402718.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p243==0)||(p655==1))"))))
Formula 0 simplified : FG!"((p243==0)||(p655==1))"
Detected timeout of ITS tools.
[2025-06-02 18:03:39] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:03:39] [INFO ] Applying decomposition
[2025-06-02 18:03:39] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16698904484048085956.txt' '-o' '/tmp/graph16698904484048085956.bin' '-w' '/tmp/graph16698904484048085956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16698904484048085956.bin' '-l' '-1' '-v' '-w' '/tmp/graph16698904484048085956.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:03:39] [INFO ] Decomposing Gal with order
[2025-06-02 18:03:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:03:40] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-02 18:03:40] [INFO ] Flatten gal took : 34 ms
[2025-06-02 18:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 4 ms.
[2025-06-02 18:03:40] [INFO ] Time to serialize gal into /tmp/LTL12022675492925119368.gal : 4 ms
[2025-06-02 18:03:40] [INFO ] Time to serialize properties into /tmp/LTL14763782188069848351.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12022675492925119368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14763782188069848351.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i0.i0.u93.p243==0)||(i14.u217.p655==1))"))))
Formula 0 simplified : FG!"((i0.i0.i0.u93.p243==0)||(i14.u217.p655==1))"
Reverse transition relation is NOT exact ! Due to transitions i14.t410_t425, i14.t403_t425, i14.u217.t21, Intersection with reachable at each step enabled...205
Computing Next relation with stutter on 7.8311e+10 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
757 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.63831,280764,1,0,608564,723,6733,1.15261e+06,289,2219,680737
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-LTLCardinality-15 finished in 262832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||X(p2)))))'
Found a Lengthening insensitive property : Parking-PT-832-LTLCardinality-07
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 652 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 652/652 places, 572/572 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 651 transition count 556
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 636 transition count 556
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 636 transition count 540
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 620 transition count 540
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 617 transition count 537
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 617 transition count 537
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 132 place count 585 transition count 505
Applied a total of 132 rules in 40 ms. Remains 585 /652 variables (removed 67) and now considering 505/572 (removed 67) transitions.
// Phase 1: matrix 505 rows 585 cols
[2025-06-02 18:03:49] [INFO ] Computed 136 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:03:50] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-02 18:03:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:03:50] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2025-06-02 18:03:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 721 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 337/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1058 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LI_LTL mode, iteration 1 : 585/652 places, 505/572 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60730 ms. Remains : 585/652 places, 505/572 transitions.
Running random walk in product with property : Parking-PT-832-LTLCardinality-07
Product exploration explored 100000 steps with 33370 reset in 741 ms.
Product exploration explored 100000 steps with 33280 reset in 798 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 655 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 36312 steps (185 resets) in 239 ms. (151 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F p1), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 937 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 12 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-06-02 18:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:04:54] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-06-02 18:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:04:55] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2025-06-02 18:04:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 721 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 337/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 2)
(t1 0)
(t2 2)
(t3 0)
(t4 2)
(t5 1)
(t6 2)
(t7 1)
(t8 2)
(t9 1)
(t10 0)
(t11 2)
(t12 0)
(t13 2)
(t14 0)
(t15 2)
(t16 0)
(t17 2)
(t18 1)
(t19 0)
(t20 2)
(t21 1)
(t22 2)
(t23 0)
(t24 2)
(t25 1)
(t26 2)
(t27 3)
(t28 0)
(t29 1)
(t30 1)
(t31 1)
(t32 1)
(t33 1)
(t34 2)
(t35 1)
(t36 1)
(t37 0)
(t38 1)
(t39 2)
(t40 1)
(t41 1)
(t42 1)
(t43 0)
(t44 1)
(t45 2)
(t46 0)
(t47 1)
(t48 0)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 3)
(t55 0)
(t56 1)
(t57 0)
(t58 1)
(t59 1)
(t60 1)
(t61 2)
(t62 1)
(t63 2)
(t64 0)
(t65 1)
(t66 0)
(t67 1)
(t68 1)
(t69 1)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 1)
(t75 1)
(t76 1)
(t77 1)
(t78 2)
(t79 2)
(t80 2)
(t81 2)
(t82 2)
(t83 1)
(t84 1)
(t85 2)
(t86 2)
(t87 1)
(t88 1)
(t89 1)
(t90 1)
(t91 1)
(t92 2)
(t93 2)
(t94 1)
(t95 2)
(t96 1)
(t97 1)
(t98 1)
(t99 1)
(t100 2)
(t101 1)
(t102 2)
(t103 1)
(t104 1)
(t105 1)
(t106 1)
(t107 2)
(t108 1)
(t109 2)
(t110 1)
(t111 2)
(t112 1)
(t113 1)
(t114 2)
(t115 1)
(t116 2)
(t117 1)
(t118 2)
(t119 1)
(t120 1)
(t121 1)
(t122 1)
(t123 1)
(t124 1)
(t125 1)
(t126 1)
(t127 1)
(t128 1)
(t129 1)
(t130 0)
(t131 0)
(t132 1)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 1)
(t138 1)
(t139 0)
(t140 2)
(t141 1)
(t142 0)
(t143 0)
(t144 1)
(t145 1)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 1)
(t151 1)
(t152 0)
(t153 1)
(t154 1)
(t155 2)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 1)
(t161 1)
(t162 1)
(t163 1)
(t164 1)
(t165 1)
(t166 1)
(t167 1)
(t168 1)
(t169 1)
(t170 1)
(t171 1)
(t172 1)
(t173 1)
(t174 1)
(t175 1)
(t176 1)
(t177 1)
(t178 1)
(t179 1)
(t180 1)
(t181 1)
(t182 1)
(t183 1)
(t184 1)
(t185 1)
(t186 1)
(t187 1)
(t188 1)
(t189 1)
(t190 1)
(t191 1)
(t192 1)
(t193 1)
(t194 1)
(t195 1)
(t196 1)
(t197 1)
(t198 1)
(t199 1)
(t200 1)
(t201 1)
(t202 1)
(t203 1)
(t204 1)
(t205 1)
(t206 1)
(t207 1)
(t208 1)
(t209 1)
(t210 1)
(t211 1)
(t212 1)
(t213 1)
(t214 1)
(t215 1)
(t216 1)
(t217 1)
(t218 1)
(t219 1)
(t220 1)
(t221 1)
(t222 1)
(t223 1)
(t224 1)
(t225 1)
(t226 1)
(t227 1)
(t228 1)
(t229 1)
(t230 1)
(t231 1)
(t232 1)
(t233 1)
(t234 1)
(t235 1)
(t236 1)
(t237 1)
(t238 1)
(t239 1)
(t240 1)
(t241 1)
(t242 1)
(t243 1)
(t244 1)
(t245 1)
(t246 1)
(t247 1)
(t248 1)
(t249 1)
(t250 1)
(t251 1)
(t252 1)
(t253 1)
(t254 1)
(t255 1)
(t256 1)
(t257 1)
(t258 1)
timeout
(t259 1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1058 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in LTL mode , in 1 iterations and 60750 ms. Remains : 585/585 places, 505/505 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 594 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 35771 steps (181 resets) in 227 ms. (156 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F p1), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 997 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 33280 reset in 750 ms.
Product exploration explored 100000 steps with 33365 reset in 802 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 21 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:05:59] [INFO ] Redundant transitions in 3 ms returned []
Running 337 sub problems to find dead transitions.
[2025-06-02 18:05:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 337 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 1090/1090 variables, and 721 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 337/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1058 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60099 ms. Remains : 585/585 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin12442620485017673846
[2025-06-02 18:06:59] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12442620485017673846
Running compilation step : cd /tmp/ltsmin12442620485017673846;'/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 776 ms.
Running link step : cd /tmp/ltsmin12442620485017673846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12442620485017673846;'/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/stateBased2358582911069683009.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 505/505 transitions.
Applied a total of 0 rules in 13 ms. Remains 585 /585 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-06-02 18:07:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:15] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-02 18:07:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:15] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2025-06-02 18:07: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/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 337 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 1090/1090 variables, and 721 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 8/585 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 505/1090 variables, 585/721 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 337/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1058 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in LTL mode , in 1 iterations and 60726 ms. Remains : 585/585 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin10231133041773169287
[2025-06-02 18:08:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10231133041773169287
Running compilation step : cd /tmp/ltsmin10231133041773169287;'/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 764 ms.
Running link step : cd /tmp/ltsmin10231133041773169287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10231133041773169287;'/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/stateBased11149949933098432746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:08:30] [INFO ] Flatten gal took : 20 ms
[2025-06-02 18:08:30] [INFO ] Flatten gal took : 13 ms
[2025-06-02 18:08:30] [INFO ] Time to serialize gal into /tmp/LTL10170538140012202308.gal : 2 ms
[2025-06-02 18:08:30] [INFO ] Time to serialize properties into /tmp/LTL17297798490453448041.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10170538140012202308.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15180834470497546467.hoa' '-atoms' '/tmp/LTL17297798490453448041.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17297798490453448041.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15180834470497546467.hoa
Detected timeout of ITS tools.
[2025-06-02 18:08:45] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:08:45] [INFO ] Flatten gal took : 14 ms
[2025-06-02 18:08:45] [INFO ] Time to serialize gal into /tmp/LTL2203381103530641716.gal : 1 ms
[2025-06-02 18:08:45] [INFO ] Time to serialize properties into /tmp/LTL1983678624744739559.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2203381103530641716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1983678624744739559.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("((p671==0)||(p19==1))")U(G(("(p225==1)")||(X("((p722==0)||(p154==1))"))))))
Formula 0 simplified : !"((p671==0)||(p19==1))" R F(!"(p225==1)" & X!"((p722==0)||(p154==1))")
Detected timeout of ITS tools.
[2025-06-02 18:09:00] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:09:00] [INFO ] Applying decomposition
[2025-06-02 18:09:00] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4382569028663969325.txt' '-o' '/tmp/graph4382569028663969325.bin' '-w' '/tmp/graph4382569028663969325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4382569028663969325.bin' '-l' '-1' '-v' '-w' '/tmp/graph4382569028663969325.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:09:01] [INFO ] Decomposing Gal with order
[2025-06-02 18:09:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:09:01] [INFO ] Removed a total of 112 redundant transitions.
[2025-06-02 18:09:01] [INFO ] Flatten gal took : 55 ms
[2025-06-02 18:09:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 3 ms.
[2025-06-02 18:09:01] [INFO ] Time to serialize gal into /tmp/LTL14906914096995532653.gal : 6 ms
[2025-06-02 18:09:01] [INFO ] Time to serialize properties into /tmp/LTL18100720112162565485.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14906914096995532653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18100720112162565485.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((("((i13.u222.p671==0)||(i4.i1.i0.u9.p19==1))")U(G(("(i5.u90.p225==1)")||(X("((i14.i1.i1.u234.p722==0)||(i3.u68.p154==1))"))))))
Formula 0 simplified : !"((i13.u222.p671==0)||(i4.i1.i0.u9.p19==1))" R F(!"(i5.u90.p225==1)" & X!"((i14.i1.i1.u234.p722==0)||(i3.u68.p154==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
596 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.02668,252648,1,0,468011,455,4432,1.25344e+06,185,1123,326242
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property Parking-PT-832-LTLCardinality-07 finished in 318820 ms.
FORMULA Parking-PT-832-LTLCardinality-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-06-02 18:09:08] [INFO ] Flatten gal took : 15 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 1829229 ms.

BK_STOP 1748887748494

--------------------
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="Parking-PT-832"
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 Parking-PT-832, 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 r142-tall-174876812600435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-832.tgz
mv Parking-PT-832 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;