Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-08000-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-08000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748807351368

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-08000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 19:49:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 19:49:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 19:49:13] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2025-06-01 19:49:13] [INFO ] Transformed 26 places.
[2025-06-01 19:49:13] [INFO ] Transformed 18 transitions.
[2025-06-01 19:49:13] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HouseConstruction-PT-08000-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 7 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2025-06-01 19:49:13] [INFO ] Computed 8 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:13] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-01 19:49:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 19:49:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 490 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 51 constraints, problems are : Problem set: 0 solved, 17 unsolved in 394 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 915ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 930ms
Finished structural reductions in LTL mode , in 1 iterations and 1260 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 23 out of 26 places after structural reductions.
[2025-06-01 19:49:14] [INFO ] Flatten gal took : 16 ms
[2025-06-01 19:49:14] [INFO ] Flatten gal took : 5 ms
[2025-06-01 19:49:14] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 64016 steps (8 resets) in 54 ms. (1163 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 149 ms. (26 steps per ms) remains 34/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 7/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 5/5 properties
[2025-06-01 19:49:15] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 17/41 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/44 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 5 unsolved in 72 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 17/41 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/44 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 39 constraints, problems are : Problem set: 0 solved, 5 unsolved in 146 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 83 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=41 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 9103 ms.
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 14 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 5 place count 14 transition count 6
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 15 place count 8 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 16 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 6 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 19 place count 5 transition count 5
Applied a total of 19 rules in 502 ms. Remains 5 /26 variables (removed 21) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 5 cols
[2025-06-01 19:49:25] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:25] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-01 19:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:49:25] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-01 19:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 51 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 652 ms. Remains : 5/26 places, 5/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-00
Stuttering criterion allowed to conclude after 40000 steps with 0 reset in 144 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-00 finished in 1037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F((p1&&(p1 U (G((p1||X(G(p2))))||(p2&&(p1||X(G(p2))))))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 19:49:26] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:26] [INFO ] Implicit Places using invariants in 37 ms returned [9, 13, 19]
[2025-06-01 19:49:26] [INFO ] Actually due to overlaps returned [9, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-01 19:49:26] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-01 19:49:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-01
Product exploration explored 100000 steps with 20829 reset in 140 ms.
Product exploration explored 100000 steps with 20833 reset in 171 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 475 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 64020 steps (8 resets) in 53 ms. (1185 steps per ms) remains 3/5 properties
BEST_FIRST walk for 37170 steps (8 resets) in 86 ms. (427 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (G p0))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F p1), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 14 factoid took 707 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2025-06-01 19:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:49:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 19:49:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 19:49:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:49:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 19:49:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 19:49:28] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 19:49:28] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-01 19:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 19:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:28] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 19:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 230 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 199 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 435ms
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 197 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 64017 steps (8 resets) in 52 ms. (1207 steps per ms) remains 5/5 properties
BEST_FIRST walk for 12800 steps (3 resets) in 22 ms. (556 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F p1), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 10 factoid took 447 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2025-06-01 19:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:49:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 19:49:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 19:49:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:49:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 19:49:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 19:49:30] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 19:49:30] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 15014 reset in 62 ms.
Product exploration explored 100000 steps with 15020 reset in 73 ms.
Built C files in :
/tmp/ltsmin145950688712482136
[2025-06-01 19:49:31] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin145950688712482136
Running compilation step : cd /tmp/ltsmin145950688712482136;'/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 276 ms.
Running link step : cd /tmp/ltsmin145950688712482136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin145950688712482136;'/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/stateBased9491175326533269495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-01 19:49:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:46] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-01 19:49:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:49:46] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 19:49:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 230 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 203 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 437ms
Finished structural reductions in LTL mode , in 1 iterations and 556 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin12906248917295234169
[2025-06-01 19:49:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12906248917295234169
Running compilation step : cd /tmp/ltsmin12906248917295234169;'/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 92 ms.
Running link step : cd /tmp/ltsmin12906248917295234169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12906248917295234169;'/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/stateBased12181713663160114339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 19:50:02] [INFO ] Flatten gal took : 2 ms
[2025-06-01 19:50:02] [INFO ] Flatten gal took : 2 ms
[2025-06-01 19:50:02] [INFO ] Time to serialize gal into /tmp/LTL17146766899978658502.gal : 1 ms
[2025-06-01 19:50:02] [INFO ] Time to serialize properties into /tmp/LTL7062910346205087410.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/LTL17146766899978658502.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12739045989255961056.hoa' '-atoms' '/tmp/LTL7062910346205087410.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/LTL7062910346205087410.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12739045989255961056.hoa
Detected timeout of ITS tools.
[2025-06-01 19:50:17] [INFO ] Flatten gal took : 2 ms
[2025-06-01 19:50:17] [INFO ] Flatten gal took : 2 ms
[2025-06-01 19:50:17] [INFO ] Time to serialize gal into /tmp/LTL14313582942619220075.gal : 1 ms
[2025-06-01 19:50:17] [INFO ] Time to serialize properties into /tmp/LTL11181971560471701942.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/LTL14313582942619220075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11181971560471701942.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(X("(p17<=p4)")))&&(F(("(p4>p26)")&&(("(p4>p26)")U((G(("(p4>p26)")||(X(G("(p20<3)")))))||(("(p20<3)")&&(("(p4>p26)")||(X(G("(p20<...169
Formula 0 simplified : XX!"(p17<=p4)" | G(!"(p4>p26)" | (!"(p4>p26)" R (F(!"(p4>p26)" & XF!"(p20<3)") & (!"(p20<3)" | (!"(p4>p26)" & XF!"(p20<3)")))))
Detected timeout of ITS tools.
[2025-06-01 19:50:32] [INFO ] Flatten gal took : 5 ms
[2025-06-01 19:50:32] [INFO ] Applying decomposition
[2025-06-01 19:50:32] [INFO ] Flatten gal took : 3 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/graph5614657224368254444.txt' '-o' '/tmp/graph5614657224368254444.bin' '-w' '/tmp/graph5614657224368254444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5614657224368254444.bin' '-l' '-1' '-v' '-w' '/tmp/graph5614657224368254444.weights' '-q' '0' '-e' '0.001'
[2025-06-01 19:50:32] [INFO ] Decomposing Gal with order
[2025-06-01 19:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 19:50:32] [INFO ] Flatten gal took : 37 ms
[2025-06-01 19:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 19:50:32] [INFO ] Time to serialize gal into /tmp/LTL2651510568687238013.gal : 1 ms
[2025-06-01 19:50:32] [INFO ] Time to serialize properties into /tmp/LTL15228599932582360452.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/LTL2651510568687238013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15228599932582360452.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X("(gu1.p17<=gu1.p4)")))&&(F(("(gu1.p4>gu1.p26)")&&(("(gu1.p4>gu1.p26)")U((G(("(gu1.p4>gu1.p26)")||(X(G("(gu6.p20<3)")))))||(("(...221
Formula 0 simplified : XX!"(gu1.p17<=gu1.p4)" | G(!"(gu1.p4>gu1.p26)" | (!"(gu1.p4>gu1.p26)" R (F(!"(gu1.p4>gu1.p26)" & XF!"(gu6.p20<3)") & (!"(gu6.p20<3)"...202
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-08000-LTLCardinality-01 finished in 81615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X(p0)))&&F(p1)&&(p0||F(p2)))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 19:50:47] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:47] [INFO ] Implicit Places using invariants in 42 ms returned [3, 9, 13, 19]
[2025-06-01 19:50:47] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-01 19:50:47] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-01 19:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), true, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-02
Product exploration explored 100000 steps with 611 reset in 159 ms.
Product exploration explored 100000 steps with 523 reset in 152 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p0)), (X (X (NOT p1))), (X (X p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 315 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p0)]
RANDOM walk for 64016 steps (8 resets) in 17 ms. (3556 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/2 properties
[2025-06-01 19:50:49] [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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/36 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 44 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 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) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/36 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8011 steps, including 0 resets, run visited all 1 properties in 35 ms. (steps per millisecond=228 )
Parikh walk visited 1 properties in 37 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p0)), (X (X (NOT p1))), (X (X p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 11 factoid took 528 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p0)]
[2025-06-01 19:50:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:50:50] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p0)), (X (X (NOT p1))), (X (X p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 11 factoid took 549 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-02 finished in 3019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 10 transition count 7
Applied a total of 9 rules in 1 ms. Remains 10 /26 variables (removed 16) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2025-06-01 19:50:50] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:50] [INFO ] Implicit Places using invariants in 21 ms returned [4, 8]
[2025-06-01 19:50:50] [INFO ] Actually due to overlaps returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/26 places, 7/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2025-06-01 19:50:50] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:50] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-01 19:50:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:50] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/26 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 8/26 places, 7/18 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-03
Product exploration explored 100000 steps with 1844 reset in 138 ms.
Product exploration explored 100000 steps with 1869 reset in 143 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-03 finished in 634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 19 transition count 6
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 25 place count 10 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 25 place count 10 transition count 5
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 27 place count 9 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 6 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 3 transition count 2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 2 transition count 2
Applied a total of 37 rules in 403 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-01 19:50:51] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:51] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 19:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:51] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:50:51] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-01 19:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[State Equation: 2/2 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 553 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-05
Stuttering criterion allowed to conclude after 20370 steps with 312 reset in 10 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-05 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(X(X(F(p1)))))||(p2 U (p3||G(p2))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 0 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 19:50:51] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:51] [INFO ] Implicit Places using invariants in 34 ms returned [3, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1) p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G p3)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 25 ms. Reduced automaton from 10 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-06 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2025-06-01 19:50:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:52] [INFO ] Implicit Places using invariants in 26 ms returned [3, 9, 13, 19]
[2025-06-01 19:50:52] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 0 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-01 19:50:52] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:52] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-01 19:50:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-07
Product exploration explored 100000 steps with 348 reset in 141 ms.
Product exploration explored 100000 steps with 345 reset in 163 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 64016 steps (8 resets) in 9 ms. (6401 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3205 steps (0 resets) in 6 ms. (457 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 19:50:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-07 finished in 1536 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((X(p0)||(F(p1)&&G(p2)))) U p3))'
Support contains 8 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 0 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 19:50:54] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:54] [INFO ] Implicit Places using invariants in 26 ms returned [3, 9, 13, 19]
[2025-06-01 19:50:54] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 0 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-01 19:50:54] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-01 19:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p2) p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-08
Product exploration explored 100000 steps with 28592 reset in 76 ms.
Product exploration explored 100000 steps with 28607 reset in 78 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X p1), (X (NOT (AND (NOT p3) p2))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (G (NOT p2))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 535 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p3), (AND (NOT p0) p2), (AND (NOT p2) (NOT p0)), true, (AND p0 (NOT p2))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 64016 steps (8 resets) in 21 ms. (2909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2025-06-01 19:50:55] [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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/34 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/36 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/38 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 2 unsolved in 52 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/34 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/36 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/38 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/39 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 100 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 42 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p2))), (X p1), (X (NOT (AND (NOT p3) p2))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p2)))), (X (X p1)), (F (OR (G p3) (G (NOT p3)))), (F (G (NOT p2))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F p3), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (AND p0 (NOT p3)) (AND p2 (NOT p3))))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2)))
Knowledge based reduction with 29 factoid took 657 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-08 finished in 2361 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((p0 U (G(p0)||(X(p1)&&(p0||F(p2)))))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 19:50:56] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:56] [INFO ] Implicit Places using invariants in 30 ms returned [3, 9, 13]
[2025-06-01 19:50:56] [INFO ] Actually due to overlaps returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 0 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-01 19:50:56] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-01 19:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:56] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 61 ms.
Product exploration explored 100000 steps with 33333 reset in 61 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 12 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-09 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1&&X(p0))||X(G(p0)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 19:50:57] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:57] [INFO ] Implicit Places using invariants in 48 ms returned [9, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-10 finished in 133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p1)))||(p2&&X(G((p2||G(p3))))))))'
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2025-06-01 19:50:57] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:57] [INFO ] Implicit Places using invariants in 46 ms returned [9, 13, 20]
[2025-06-01 19:50:57] [INFO ] Actually due to overlaps returned [9, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-01 19:50:57] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-01 19:50:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 23/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 398 ms :[true, (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-11 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&G(p1))||(p2&&(p3 U G(p1)))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 11 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 7 transition count 6
Applied a total of 5 rules in 382 ms. Remains 7 /26 variables (removed 19) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2025-06-01 19:50:58] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-01 19:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:58] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:50:58] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-01 19:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 76 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/13 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 102 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 7/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-12
Stuttering criterion allowed to conclude after 48000 steps with 0 reset in 50 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-LTLCardinality-12 finished in 866 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)||X(G(p1)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 19:50:58] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:58] [INFO ] Implicit Places using invariants in 29 ms returned [3, 9, 13, 19]
[2025-06-01 19:50:58] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-01 19:50:58] [INFO ] Computed 3 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:58] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-01 19:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:50:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-13
Product exploration explored 100000 steps with 296 reset in 159 ms.
Product exploration explored 100000 steps with 298 reset in 141 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 64016 steps (8 resets) in 8 ms. (7112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 7131 steps (0 resets) in 10 ms. (648 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2025-06-01 19:50:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:50:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 19:50:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 19:50:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:50:59] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 19:50:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 19:50:59] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 19:50:59] [INFO ] Added : 17 causal constraints over 4 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 12
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 15 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 13 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 13 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 10 transition count 7
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 22 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 7 transition count 6
Applied a total of 24 rules in 360 ms. Remains 7 /21 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2025-06-01 19:51:00] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-01 19:51:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:00] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:51:00] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-01 19:51:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 51 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/13 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 588 ms. Remains : 7/21 places, 6/18 transitions.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 64016 steps (8 resets) in 24 ms. (2560 steps per ms) remains 3/3 properties
BEST_FIRST walk for 1975 steps (0 resets) in 6 ms. (282 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2025-06-01 19:51:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:51:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 19:51:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 19:51:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 19:51:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 19:51:01] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-01 19:51:01] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 19:51:01] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1522 reset in 76 ms.
Product exploration explored 100000 steps with 1502 reset in 84 ms.
Built C files in :
/tmp/ltsmin11855822224812734267
[2025-06-01 19:51:01] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-01 19:51:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:01] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-01 19:51:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:01] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-01 19:51:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11855822224812734267
Running compilation step : cd /tmp/ltsmin11855822224812734267;'/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 77 ms.
Running link step : cd /tmp/ltsmin11855822224812734267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11855822224812734267;'/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/stateBased10129669600092482717.hoa' '--buchi-type=spotba'
LTSmin run took 4785 ms.
FORMULA HouseConstruction-PT-08000-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-08000-LTLCardinality-13 finished in 7691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(G(X(p0)) U (p0 U p1))||p2))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 0 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 19:51:06] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:06] [INFO ] Implicit Places using invariants in 25 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, p0, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1), p1]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 48 ms.
Product exploration explored 100000 steps with 33333 reset in 59 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 11 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-08000-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-08000-LTLCardinality-14 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 11 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 7 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 12 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 14 place count 5 transition count 4
Applied a total of 14 rules in 367 ms. Remains 5 /26 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2025-06-01 19:51:07] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-01 19:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:51:07] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-01 19:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 51 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 523 ms. Remains : 5/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-08000-LTLCardinality-15
Product exploration explored 100000 steps with 3143 reset in 76 ms.
Product exploration explored 100000 steps with 3051 reset in 77 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 64016 steps (8 resets) in 10 ms. (5819 steps per ms) remains 2/2 properties
BEST_FIRST walk for 351 steps (0 resets) in 7 ms. (43 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-01 19:51:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-01 19:51:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:51:08] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-01 19:51:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 46 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 64016 steps (8 resets) in 9 ms. (6401 steps per ms) remains 2/2 properties
BEST_FIRST walk for 166 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 208 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3359 reset in 68 ms.
Product exploration explored 100000 steps with 3243 reset in 77 ms.
Built C files in :
/tmp/ltsmin16323073532419421090
[2025-06-01 19:51:09] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2025-06-01 19:51:09] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:09] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2025-06-01 19:51:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:09] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2025-06-01 19:51:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16323073532419421090
Running compilation step : cd /tmp/ltsmin16323073532419421090;'/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 60 ms.
Running link step : cd /tmp/ltsmin16323073532419421090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16323073532419421090;'/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/stateBased5647145771268885173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-01 19:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:24] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-01 19:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 19:51:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 19:51:24] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-01 19:51: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/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 5/5 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin16764411886638457069
[2025-06-01 19:51:24] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2025-06-01 19:51:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:24] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2025-06-01 19:51:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:24] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2025-06-01 19:51:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:51:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16764411886638457069
Running compilation step : cd /tmp/ltsmin16764411886638457069;'/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 67 ms.
Running link step : cd /tmp/ltsmin16764411886638457069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16764411886638457069;'/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/stateBased5672508836605115205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 19:51:39] [INFO ] Flatten gal took : 2 ms
[2025-06-01 19:51:39] [INFO ] Flatten gal took : 1 ms
[2025-06-01 19:51:39] [INFO ] Time to serialize gal into /tmp/LTL8918079674984956028.gal : 1 ms
[2025-06-01 19:51:39] [INFO ] Time to serialize properties into /tmp/LTL10189952792472438447.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/LTL8918079674984956028.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11193016007968359295.hoa' '-atoms' '/tmp/LTL10189952792472438447.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/LTL10189952792472438447.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11193016007968359295.hoa
Detected timeout of ITS tools.
[2025-06-01 19:51:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 19:51:54] [INFO ] Flatten gal took : 1 ms
[2025-06-01 19:51:54] [INFO ] Time to serialize gal into /tmp/LTL14225929937199383893.gal : 0 ms
[2025-06-01 19:51:54] [INFO ] Time to serialize properties into /tmp/LTL15759734085312917432.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/LTL14225929937199383893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15759734085312917432.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("(p20<3)"))&&(F("(p19<=p12)")))))
Formula 0 simplified : F(G!"(p20<3)" | G!"(p19<=p12)")
Detected timeout of ITS tools.
[2025-06-01 19:52:09] [INFO ] Flatten gal took : 1 ms
[2025-06-01 19:52:09] [INFO ] Applying decomposition
[2025-06-01 19:52:09] [INFO ] Flatten gal took : 0 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/graph11589951798040734715.txt' '-o' '/tmp/graph11589951798040734715.bin' '-w' '/tmp/graph11589951798040734715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11589951798040734715.bin' '-l' '-1' '-v' '-w' '/tmp/graph11589951798040734715.weights' '-q' '0' '-e' '0.001'
[2025-06-01 19:52:09] [INFO ] Decomposing Gal with order
[2025-06-01 19:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 19:52:09] [INFO ] Flatten gal took : 1 ms
[2025-06-01 19:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 19:52:09] [INFO ] Time to serialize gal into /tmp/LTL4873265960497070692.gal : 0 ms
[2025-06-01 19:52:09] [INFO ] Time to serialize properties into /tmp/LTL3863722112366801477.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/LTL4873265960497070692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3863722112366801477.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 : !((G((F("(gu1.p20<3)"))&&(F("(gu0.p19<=gu0.p12)")))))
Formula 0 simplified : F(G!"(gu1.p20<3)" | G!"(gu0.p19<=gu0.p12)")
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-08000-LTLCardinality-15 finished in 78161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F((p1&&(p1 U (G((p1||X(G(p2))))||(p2&&(p1||X(G(p2))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
[2025-06-01 19:52:25] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin498080646212990610
[2025-06-01 19:52:25] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2025-06-01 19:52:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:52:25] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2025-06-01 19:52:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:52:25] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2025-06-01 19:52:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 19:52:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin498080646212990610
Running compilation step : cd /tmp/ltsmin498080646212990610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 19:52:25] [INFO ] Applying decomposition
[2025-06-01 19:52:25] [INFO ] Flatten gal took : 1 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/graph17997670392567139948.txt' '-o' '/tmp/graph17997670392567139948.bin' '-w' '/tmp/graph17997670392567139948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17997670392567139948.bin' '-l' '-1' '-v' '-w' '/tmp/graph17997670392567139948.weights' '-q' '0' '-e' '0.001'
[2025-06-01 19:52:25] [INFO ] Decomposing Gal with order
[2025-06-01 19:52:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 19:52:25] [INFO ] Flatten gal took : 2 ms
[2025-06-01 19:52:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 19:52:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality11720439369342302712.gal : 1 ms
[2025-06-01 19:52:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality13661531243663822191.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/LTLCardinality11720439369342302712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13661531243663822191.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...299
Read 2 LTL properties
Checking formula 0 : !(((X(X("(gu6.p17<=gu6.p4)")))&&(F(("(gu6.p4>gu6.p26)")&&(("(gu6.p4>gu6.p26)")U((G(("(gu6.p4>gu6.p26)")||(X(G("(gu5.p20<3)")))))||(("(...221
Formula 0 simplified : XX!"(gu6.p17<=gu6.p4)" | G(!"(gu6.p4>gu6.p26)" | (!"(gu6.p4>gu6.p26)" R (F(!"(gu6.p4>gu6.p26)" & XF!"(gu5.p20<3)") & (!"(gu5.p20<3)"...202
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin498080646212990610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin498080646212990610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X((LTLAPp0==true)))&&<>(((LTLAPp1==true)&&((LTLAPp1==true) U ([](((LTLAPp1==true)||X([]((LTLAPp2==true)))))||((LTLAPp2==true)&&((LTLAPp1==true)||X([]((LTLAPp2==true))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: (X(X((LTLAPp0==true)))&&<>(((LTLAPp1==true)&&((LTLAPp1==true) U ([](((LTLAPp1==true)||X([]((LTLAPp2==true)))))||((LTLAPp2==true)&&((LTLAPp1==true)||X([]((LTLAPp2==true))))))))))
pins2lts-mc-linux64( 0/ 8), 0.002: "(X(X((LTLAPp0==true)))&&<>(((LTLAPp1==true)&&((LTLAPp1==true) U ([](((LTLAPp1==true)||X([]((LTLAPp2==true)))))||((LTLAPp2==true)&&((LTLAPp1==true)||X([]((LTLAPp2==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: buchi has 9 states
pins2lts-mc-linux64( 0/ 8), 0.060: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 27, there are 37 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.144: [Blue] ~82 levels ~960 states ~1912 transitions
pins2lts-mc-linux64( 5/ 8), 0.185: [Blue] ~149 levels ~1920 states ~2984 transitions
pins2lts-mc-linux64( 1/ 8), 0.269: [Blue] ~291 levels ~3840 states ~6928 transitions
pins2lts-mc-linux64( 5/ 8), 0.525: [Blue] ~631 levels ~7680 states ~12664 transitions
pins2lts-mc-linux64( 6/ 8), 0.867: [Blue] ~1288 levels ~15360 states ~26064 transitions
pins2lts-mc-linux64( 5/ 8), 1.273: [Blue] ~2492 levels ~30720 states ~50648 transitions
pins2lts-mc-linux64( 5/ 8), 1.808: [Blue] ~5006 levels ~61440 states ~101440 transitions
pins2lts-mc-linux64( 5/ 8), 2.876: [Blue] ~10201 levels ~122880 states ~206712 transitions
pins2lts-mc-linux64( 5/ 8), 4.309: [Blue] ~16002 levels ~245760 states ~418984 transitions
pins2lts-mc-linux64( 1/ 8), 6.314: [Blue] ~15917 levels ~491520 states ~1006000 transitions
pins2lts-mc-linux64( 5/ 8), 10.728: [Blue] ~16002 levels ~983040 states ~1776976 transitions
pins2lts-mc-linux64( 5/ 8), 16.836: [Blue] ~16002 levels ~1966080 states ~3643336 transitions
pins2lts-mc-linux64( 0/ 8), 23.935: [Blue] ~15945 levels ~3932160 states ~8425376 transitions
pins2lts-mc-linux64( 5/ 8), 30.712: [Blue] ~16002 levels ~7864320 states ~14057144 transitions
pins2lts-mc-linux64( 5/ 8), 39.459: [Blue] ~16002 levels ~15728640 states ~28633016 transitions
pins2lts-mc-linux64( 5/ 8), 58.944: [Blue] ~16002 levels ~31457280 states ~56463248 transitions
pins2lts-mc-linux64( 6/ 8), 74.828: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 74.927:
pins2lts-mc-linux64( 0/ 8), 74.927: Explored 26684922 states 58985628 transitions, fanout: 2.210
pins2lts-mc-linux64( 0/ 8), 74.927: Total exploration time 74.810 sec (74.750 sec minimum, 74.771 sec on average)
pins2lts-mc-linux64( 0/ 8), 74.927: States per second: 356703, Transitions per second: 788472
pins2lts-mc-linux64( 0/ 8), 74.927:
pins2lts-mc-linux64( 0/ 8), 74.927: State space has 13419099 states, 13366209 are accepting
pins2lts-mc-linux64( 0/ 8), 74.927: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 74.927: blue states: 26684922 (198.86%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 74.927: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 74.927: all-red states: 13366209 (99.61%), bogus 13221010 (98.52%)
pins2lts-mc-linux64( 0/ 8), 74.927:
pins2lts-mc-linux64( 0/ 8), 74.927: Total memory used for local state coloring: 1.9MB
pins2lts-mc-linux64( 0/ 8), 74.927:
pins2lts-mc-linux64( 0/ 8), 74.927: Queue width: 8B, total height: 127708, memory: 0.97MB
pins2lts-mc-linux64( 0/ 8), 74.927: Tree memory: 358.4MB, 28.0 B/state, compr.: 25.5%
pins2lts-mc-linux64( 0/ 8), 74.927: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 74.927: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 74.927: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 74.927: Est. total memory use: 359.4MB (~1025.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin498080646212990610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X((LTLAPp0==true)))&&<>(((LTLAPp1==true)&&((LTLAPp1==true) U ([](((LTLAPp1==true)||X([]((LTLAPp2==true)))))||((LTLAPp2==true)&&((LTLAPp1==true)||X([]((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin498080646212990610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X((LTLAPp0==true)))&&<>(((LTLAPp1==true)&&((LTLAPp1==true) U ([](((LTLAPp1==true)||X([]((LTLAPp2==true)))))||((LTLAPp2==true)&&((LTLAPp1==true)||X([]((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 20:13:29] [INFO ] Flatten gal took : 2 ms
[2025-06-01 20:13:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality806519266920535867.gal : 2 ms
[2025-06-01 20:13:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality4401952410655582503.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/LTLCardinality806519266920535867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4401952410655582503.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...296
Read 2 LTL properties
Checking formula 0 : !(((X(X("(p17<=p4)")))&&(F(("(p4>p26)")&&(("(p4>p26)")U((G(("(p4>p26)")||(X(G("(p20<3)")))))||(("(p20<3)")&&(("(p4>p26)")||(X(G("(p20<...169
Formula 0 simplified : XX!"(p17<=p4)" | G(!"(p4>p26)" | (!"(p4>p26)" R (F(!"(p4>p26)" & XF!"(p20<3)") & (!"(p20<3)" | (!"(p4>p26)" & XF!"(p20<3)")))))
Detected timeout of ITS tools.
[2025-06-01 20:34:35] [INFO ] Flatten gal took : 124 ms
[2025-06-01 20:34:35] [INFO ] Input system was already deterministic with 18 transitions.
[2025-06-01 20:34:35] [INFO ] Transformed 26 places.
[2025-06-01 20:34:35] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 20:34:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality6585777136113295144.gal : 4 ms
[2025-06-01 20:34:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality15796574616739979601.ltl : 7 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/LTLCardinality6585777136113295144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15796574616739979601.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(X("(p17<=p4)")))&&(F(("(p4>p26)")&&(("(p4>p26)")U((G(("(p4>p26)")||(X(G("(p20<3)")))))||(("(p20<3)")&&(("(p4>p26)")||(X(G("(p20<...169
Formula 0 simplified : XX!"(p17<=p4)" | G(!"(p4>p26)" | (!"(p4>p26)" R (F(!"(p4>p26)" & XF!"(p20<3)") & (!"(p20<3)" | (!"(p4>p26)" & XF!"(p20<3)")))))

BK_TIME_CONFINEMENT_REACHED

--------------------
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="HouseConstruction-PT-08000"
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 HouseConstruction-PT-08000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422300235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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