Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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-32000-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-32000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748812830513

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-32000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 21:20:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 21:20:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 21:20:32] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2025-06-01 21:20:32] [INFO ] Transformed 26 places.
[2025-06-01 21:20:32] [INFO ] Transformed 18 transitions.
[2025-06-01 21:20:32] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-32000-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-13 FALSE 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 10 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 21:20:32] [INFO ] Computed 8 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:32] [INFO ] Implicit Places using invariants in 203 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 243 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 25/26 places, 18/18 transitions.
Support contains 23 out of 25 places after structural reductions.
[2025-06-01 21:20:32] [INFO ] Flatten gal took : 16 ms
[2025-06-01 21:20:32] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:20:32] [INFO ] Input system was already deterministic with 18 transitions.
Reduction of identical properties reduced properties to check from 23 to 21
RANDOM walk for 128004 steps (0 resets) in 259 ms. (492 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 2/2 properties
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 21:20:32] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/23 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/40 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/43 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 32 constraints, problems are : Problem set: 0 solved, 2 unsolved in 143 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/23 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/40 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/43 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 34 constraints, problems are : Problem set: 0 solved, 2 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 63970 steps, including 0 resets, run visited all 2 properties in 452 ms. (steps per millisecond=141 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 456 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 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' '!(G(F(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 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 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3 transition count 3
Applied a total of 3 rules in 6754 ms. Remains 3 /25 variables (removed 22) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2025-06-01 21:20:41] [INFO ] Computed 0 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-01 21:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:20:41] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-01 21:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43 ms.
Refiners :[State Equation: 3/3 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 52 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/25 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6922 ms. Remains : 3/25 places, 3/18 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-00
Product exploration explored 100000 steps with 15655 reset in 250 ms.
Product exploration explored 100000 steps with 12851 reset in 238 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 128004 steps (0 resets) in 45 ms. (2782 steps per ms) remains 1/1 properties
BEST_FIRST walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-00 finished in 8160 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(((F(p0) U X(p1)) U (p2||X(p2))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 21:20:42] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:42] [INFO ] Implicit Places using invariants in 42 ms returned [8, 12, 19]
[2025-06-01 21:20:42] [INFO ] Actually due to overlaps returned [8, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 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 21:20:42] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:42] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-01 21:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-01
Product exploration explored 100000 steps with 3495 reset in 114 ms.
Product exploration explored 100000 steps with 3569 reset in 111 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 p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 381 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1)]
RANDOM walk for 128004 steps (0 resets) in 151 ms. (842 steps per ms) remains 6/6 properties
BEST_FIRST walk for 1056 steps (0 resets) in 6 ms. (150 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 14 factoid took 424 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-01 finished in 1866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 5931 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-01 21:20:50] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-01 21:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:20:50] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-01 21:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 27 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 50 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 81ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6071 ms. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 73 ms.
Product exploration explored 100000 steps with 1 reset in 147 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-02 finished in 6384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p1)||p0))||(X(X(!p1))&&p2))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-01 21:20:50] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:50] [INFO ] Implicit Places using invariants in 147 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 149 ms. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), false, false, (AND (NOT p0) (NOT p2) (NOT p1)), false, false]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-03
Product exploration explored 100000 steps with 1230 reset in 173 ms.
Product exploration explored 100000 steps with 1267 reset in 171 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 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 p2) p1), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2) p1)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 42 factoid took 20 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-03 finished in 832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-01 21:20:51] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:51] [INFO ] Implicit Places using invariants in 70 ms returned [8, 12, 19]
[2025-06-01 21:20:51] [INFO ] Actually due to overlaps returned [8, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 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 21:20:51] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-01 21:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-04
Product exploration explored 100000 steps with 2622 reset in 192 ms.
Product exploration explored 100000 steps with 2610 reset in 136 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) (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 105 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 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 128004 steps (0 resets) in 18 ms. (6737 steps per ms) remains 1/1 properties
BEST_FIRST walk for 473 steps (0 resets) in 22 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 197 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 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-06-01 21:20:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 21:20:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 21:20:52] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 21:20:52] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 21:20:53] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 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 21:20:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 21:20:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:20:53] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 21:20:53] [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 229 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 214 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 451ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 451ms
Finished structural reductions in LTL mode , in 1 iterations and 504 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 : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 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 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 128004 steps (0 resets) in 19 ms. (6400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 702 steps (0 resets) in 5 ms. (117 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 118 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 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-06-01 21:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 21:20:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-01 21:20:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 21:20:54] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 21:20:54] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2636 reset in 104 ms.
Product exploration explored 100000 steps with 2627 reset in 110 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 12 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 12 transition count 11
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 12 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 11 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 11 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 12 ms. Remains 11 /22 variables (removed 11) and now considering 10/18 (removed 8) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:20:55] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 11 cols
[2025-06-01 21:20:55] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 2 (OVERLAPS) 10/20 variables, 10/12 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/21 variables, 1/13 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 13 constraints, problems are : Problem set: 6 solved, 3 unsolved in 81 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 10/17 variables, 7/9 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 3/12 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/21 variables, 4/16 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 16 constraints, problems are : Problem set: 6 solved, 3 unsolved in 71 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 6 solved, 3 unsolved
Search for dead transitions found 6 dead transitions in 165ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 4/18 transitions.
Graph (complete) has 6 edges and 11 vertex of which 6 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 5 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 2 ms. Remains 4 /11 variables (removed 7) and now considering 3/4 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/22 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 4/22 places, 3/18 transitions.
Built C files in :
/tmp/ltsmin9367593580219182360
[2025-06-01 21:20:55] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9367593580219182360
Running compilation step : cd /tmp/ltsmin9367593580219182360;'/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 253 ms.
Running link step : cd /tmp/ltsmin9367593580219182360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin9367593580219182360;'/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/stateBased4986324045552041182.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-01 21:21:10] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:21:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-01 21:21:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:21:10] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 21:21:10] [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 235 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 202 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 442ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 442ms
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5441065777832483730
[2025-06-01 21:21:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5441065777832483730
Running compilation step : cd /tmp/ltsmin5441065777832483730;'/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 79 ms.
Running link step : cd /tmp/ltsmin5441065777832483730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5441065777832483730;'/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/stateBased4060798742782260234.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 21:21:26] [INFO ] Flatten gal took : 7 ms
[2025-06-01 21:21:26] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:21:26] [INFO ] Time to serialize gal into /tmp/LTL5873411099564311940.gal : 1 ms
[2025-06-01 21:21:26] [INFO ] Time to serialize properties into /tmp/LTL14625677158719115403.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5873411099564311940.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14615118001916899213.hoa' '-atoms' '/tmp/LTL14625677158719115403.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/LTL14625677158719115403.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14615118001916899213.hoa
Detected timeout of ITS tools.
[2025-06-01 21:21:41] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:21:41] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:21:41] [INFO ] Time to serialize gal into /tmp/LTL14152731832862959201.gal : 1 ms
[2025-06-01 21:21:41] [INFO ] Time to serialize properties into /tmp/LTL13195754161843812919.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/LTL14152731832862959201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13195754161843812919.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(("(p11>=1)")||(F("((p19>=1)&&(p20>=1))"))))))
Formula 0 simplified : XX(!"(p11>=1)" & G!"((p19>=1)&&(p20>=1))")
Detected timeout of ITS tools.
[2025-06-01 21:21:56] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:21:56] [INFO ] Applying decomposition
[2025-06-01 21:21:56] [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/graph7542498152914885614.txt' '-o' '/tmp/graph7542498152914885614.bin' '-w' '/tmp/graph7542498152914885614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7542498152914885614.bin' '-l' '-1' '-v' '-w' '/tmp/graph7542498152914885614.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:21:56] [INFO ] Decomposing Gal with order
[2025-06-01 21:21:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:21:56] [INFO ] Flatten gal took : 36 ms
[2025-06-01 21:21:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 21:21:56] [INFO ] Time to serialize gal into /tmp/LTL13801052335283447522.gal : 1 ms
[2025-06-01 21:21:56] [INFO ] Time to serialize properties into /tmp/LTL13970824153620164142.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/LTL13801052335283447522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13970824153620164142.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i2.u2.p11>=1)")||(F("((u6.p19>=1)&&(u6.p20>=1))"))))))
Formula 0 simplified : XX(!"(i2.u2.p11>=1)" & G!"((u6.p19>=1)&&(u6.p20>=1))")
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-32000-LTLFireability-04 finished in 79961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((p1&&F(!p2))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-01 21:22:11] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:11] [INFO ] Implicit Places using invariants in 45 ms returned [8, 12, 18]
[2025-06-01 21:22:11] [INFO ] Actually due to overlaps returned [8, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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 21:22:11] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-01 21:22:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:11] [INFO ] Implicit Places using invariants and state equation in 30 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 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, p2]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-LTLFireability-05 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(X(p0))&&G(p1))||G(p0))))||(p1&&X(!p2)&&F(((X(X(p0))&&G(p1))||G(p0)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-01 21:22:11] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:11] [INFO ] Implicit Places using invariants in 33 ms returned [8, 12, 18]
[2025-06-01 21:22:11] [INFO ] Actually due to overlaps returned [8, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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 21:22:11] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-01 21:22:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:11] [INFO ] Implicit Places using invariants and state equation in 36 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/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 674 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-06
Product exploration explored 100000 steps with 3091 reset in 150 ms.
Product exploration explored 100000 steps with 2702 reset in 206 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 p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 171 ms. Reduced automaton from 14 states, 66 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 128009 steps (0 resets) in 25 ms. (4923 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
[2025-06-01 21:22:13] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 17/36 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 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 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 17/36 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 27 constraints, problems are : Problem set: 0 solved, 3 unsolved in 96 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 96074 steps, including 2 resets, run visited all 3 properties in 521 ms. (steps per millisecond=184 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 521 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 30 factoid took 394 ms. Reduced automaton from 7 states, 25 edges and 2 AP (stutter sensitive) to 7 states, 25 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-01 21:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-01 21:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 21:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 192 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 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/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 178 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 374ms
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 21/21 places, 18/18 transitions.
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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 186 ms. Reduced automaton from 7 states, 25 edges and 2 AP (stutter sensitive) to 7 states, 25 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 128004 steps (0 resets) in 25 ms. (4923 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
[2025-06-01 21:22:16] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 17/36 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 3 unsolved in 58 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 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 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 17/36 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 27 constraints, problems are : Problem set: 0 solved, 3 unsolved in 69 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 96070 steps, including 2 resets, run visited all 3 properties in 343 ms. (steps per millisecond=280 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 343 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 434 ms. Reduced automaton from 7 states, 25 edges and 2 AP (stutter sensitive) to 7 states, 25 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1058 reset in 159 ms.
Product exploration explored 100000 steps with 1093 reset in 161 ms.
Built C files in :
/tmp/ltsmin7606210347624269754
[2025-06-01 21:22:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7606210347624269754
Running compilation step : cd /tmp/ltsmin7606210347624269754;'/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 94 ms.
Running link step : cd /tmp/ltsmin7606210347624269754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7606210347624269754;'/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/stateBased446192164733750848.hoa' '--buchi-type=spotba'
LTSmin run took 5976 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-32000-LTLFireability-06 finished in 13057 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&&X(X((!p1||G(p2))))) U (G((p0&&X(X((!p1||G(p2))))))||(X(X((!p1||G(p2))))&&p3)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-01 21:22:24] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:24] [INFO ] Implicit Places using invariants in 28 ms returned [8, 12, 18]
[2025-06-01 21:22:24] [INFO ] Actually due to overlaps returned [8, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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 21:22:24] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:24] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-01 21:22:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2))), true, (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-07
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-LTLFireability-07 finished in 348 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) U p1) U p2)||X(p3)))'
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-01 21:22:25] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:25] [INFO ] Implicit Places using invariants in 28 ms returned [8, 12]
[2025-06-01 21:22:25] [INFO ] Actually due to overlaps returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 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 21:22:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 21:22:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:25] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p2) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-09
Product exploration explored 100000 steps with 18044 reset in 89 ms.
Product exploration explored 100000 steps with 17678 reset in 84 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 p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT p3)), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 132 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 128004 steps (0 resets) in 15 ms. (8000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 5838 steps (0 resets) in 9 ms. (583 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT p3)), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0)]
Knowledge based reduction with 21 factoid took 340 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
[2025-06-01 21:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 21:22:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-01 21:22:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 21:22:27] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 21:22:27] [INFO ] Added : 17 causal constraints over 4 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-01 21:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 21:22:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 21:22:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 21:22:27] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 21:22:27] [INFO ] Added : 17 causal constraints over 4 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-01 21:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 21:22:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 21:22:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 21:22:27] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 21:22:27] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 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 21:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 21:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:27] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 21:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 187 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 209 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 399ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 400ms
Finished structural reductions in LTL mode , in 1 iterations and 448 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 p0) (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 248 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 128004 steps (0 resets) in 16 ms. (7529 steps per ms) remains 6/6 properties
BEST_FIRST walk for 5155 steps (0 resets) in 11 ms. (429 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 10 factoid took 797 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
[2025-06-01 21:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 21:22:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 21:22:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 21:22:29] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 21:22:29] [INFO ] Added : 17 causal constraints over 4 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-01 21:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 21:22:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 21:22:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 21:22:29] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 21:22:29] [INFO ] Added : 17 causal constraints over 4 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-01 21:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 21:22:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 21:22:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 21:22:29] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 21:22:29] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 7858 reset in 91 ms.
Product exploration explored 100000 steps with 7799 reset in 87 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 8 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 22 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 22 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 19 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 19 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 19 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 17 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 17 transition count 13
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 19 rules in 8 ms. Remains 17 /22 variables (removed 5) and now considering 13/18 (removed 5) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:22:30] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 17 cols
[2025-06-01 21:22:30] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 2 (OVERLAPS) 13/29 variables, 16/20 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/30 variables, 1/21 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 21 constraints, problems are : Problem set: 4 solved, 8 unsolved in 114 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 3/4 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 13/28 variables, 15/19 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 8/27 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/30 variables, 2/29 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/29 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/30 variables, 0/29 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 29 constraints, problems are : Problem set: 4 solved, 8 unsolved in 128 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 8/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 4 solved, 8 unsolved
Search for dead transitions found 4 dead transitions in 246ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 17/22 places, 9/18 transitions.
Graph (complete) has 15 edges and 17 vertex of which 13 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 13 /17 variables (removed 4) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/22 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 13/22 places, 9/18 transitions.
Built C files in :
/tmp/ltsmin17773986499918388345
[2025-06-01 21:22:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17773986499918388345
Running compilation step : cd /tmp/ltsmin17773986499918388345;'/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 96 ms.
Running link step : cd /tmp/ltsmin17773986499918388345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17773986499918388345;'/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/stateBased14390016468394031928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 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 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-01 21:22:45] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:45] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-01 21:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:22:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 21:22:45] [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 212 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 210 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 428ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 428ms
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin4254669351651469039
[2025-06-01 21:22:46] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4254669351651469039
Running compilation step : cd /tmp/ltsmin4254669351651469039;'/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 83 ms.
Running link step : cd /tmp/ltsmin4254669351651469039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4254669351651469039;'/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/stateBased1588828885001097186.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 21:23:01] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:23:01] [INFO ] Flatten gal took : 1 ms
[2025-06-01 21:23:01] [INFO ] Time to serialize gal into /tmp/LTL5984834692483451011.gal : 0 ms
[2025-06-01 21:23:01] [INFO ] Time to serialize properties into /tmp/LTL6643536024686432041.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5984834692483451011.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11453960672288295113.hoa' '-atoms' '/tmp/LTL6643536024686432041.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6643536024686432041.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11453960672288295113.hoa
Detected timeout of ITS tools.
[2025-06-01 21:23:16] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:23:16] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:23:16] [INFO ] Time to serialize gal into /tmp/LTL11517707677079158689.gal : 1 ms
[2025-06-01 21:23:16] [INFO ] Time to serialize properties into /tmp/LTL4379109629999860365.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/LTL11517707677079158689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4379109629999860365.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 : !(((((F("((p8>=1)&&(p9>=1))"))U("((((p21>=1)&&(p23>=1))&&((p27>=1)&&(p26>=1)))&&(p25>=1))"))U("(p5>=1)"))||(X("((p11>=1)||((p21>=1)&&(...169
Formula 0 simplified : ((G!"((p8>=1)&&(p9>=1))" R !"((((p21>=1)&&(p23>=1))&&((p27>=1)&&(p26>=1)))&&(p25>=1))") R !"(p5>=1)") & X!"((p11>=1)||((p21>=1)&&(p2...163
Detected timeout of ITS tools.
[2025-06-01 21:23:31] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:23:31] [INFO ] Applying decomposition
[2025-06-01 21:23:31] [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/graph2361103779531528398.txt' '-o' '/tmp/graph2361103779531528398.bin' '-w' '/tmp/graph2361103779531528398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2361103779531528398.bin' '-l' '-1' '-v' '-w' '/tmp/graph2361103779531528398.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:23:31] [INFO ] Decomposing Gal with order
[2025-06-01 21:23:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:23:31] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:23:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 21:23:31] [INFO ] Time to serialize gal into /tmp/LTL1219392442229425773.gal : 1 ms
[2025-06-01 21:23:31] [INFO ] Time to serialize properties into /tmp/LTL7739348396591043678.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/LTL1219392442229425773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7739348396591043678.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((((F("((i0.u2.p8>=1)&&(i1.u3.p9>=1))"))U("((((i3.u7.p21>=1)&&(i3.u6.p23>=1))&&((u5.p27>=1)&&(i3.u6.p26>=1)))&&(i4.u8.p25>=1))"))U("...232
Formula 0 simplified : ((G!"((i0.u2.p8>=1)&&(i1.u3.p9>=1))" R !"((((i3.u7.p21>=1)&&(i3.u6.p23>=1))&&((u5.p27>=1)&&(i3.u6.p26>=1)))&&(i4.u8.p25>=1))") R !"(...226
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-32000-LTLFireability-09 finished in 81405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(X(G(!p1)))) U (p2&&X(F(p0)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-01 21:23:46] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:23:46] [INFO ] Implicit Places using invariants in 36 ms returned [8, 12, 18]
[2025-06-01 21:23:46] [INFO ] Actually due to overlaps returned [8, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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 21:23:46] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:23:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 21:23:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:23:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p2)), p1, (NOT p0), p1, true, p1]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-LTLFireability-10 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 6 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 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 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 5560 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-01 21:23:52] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:23:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 21:23:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:23:52] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:23:52] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-01 21:23:52] [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 25 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 32 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 62ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5666 ms. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 36 ms.
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-12 finished in 5822 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(G(!p0))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 9 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 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 9 transition count 7
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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 7 transition count 6
Applied a total of 5 rules in 1 ms. Remains 7 /25 variables (removed 18) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2025-06-01 21:23:52] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:23:52] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-01 21:23:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:23:52] [INFO ] Implicit Places using invariants and state equation in 23 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 21:23:52] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-01 21:23:52] [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 47 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 74 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 140ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND (NOT p2) p1)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 119 ms.
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 p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 15 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-14 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||G(F(!p0))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 14 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 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 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 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 2 with 2 rules applied. Total rules applied 7 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 9 transition count 6
Applied a total of 8 rules in 26250 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2025-06-01 21:24:19] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:24:19] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-01 21:24:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:24:19] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:24:19] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-01 21:24:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 9/9 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/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26520 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) p0), p0, p0]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-15
Product exploration explored 100000 steps with 3389 reset in 93 ms.
Product exploration explored 100000 steps with 2164 reset in 109 ms.
Computed a total of 9 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-15 finished in 26893 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)))))'
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) U p1) U p2)||X(p3)))'
[2025-06-01 21:24:20] [INFO ] Flatten gal took : 1 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15519793141127355084
[2025-06-01 21:24:20] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2025-06-01 21:24:20] [INFO ] Applying decomposition
[2025-06-01 21:24:20] [INFO ] Flatten gal took : 1 ms
[2025-06-01 21:24:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:24:20] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2025-06-01 21:24:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:24:20] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2025-06-01 21:24:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:24:20] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15519793141127355084
Running compilation step : cd /tmp/ltsmin15519793141127355084;'/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'
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/graph13545305448128853449.txt' '-o' '/tmp/graph13545305448128853449.bin' '-w' '/tmp/graph13545305448128853449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13545305448128853449.bin' '-l' '-1' '-v' '-w' '/tmp/graph13545305448128853449.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:24:20] [INFO ] Decomposing Gal with order
[2025-06-01 21:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:24:20] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 21:24:20] [INFO ] Time to serialize gal into /tmp/LTLFireability17665131513789262480.gal : 15 ms
[2025-06-01 21:24:20] [INFO ] Time to serialize properties into /tmp/LTLFireability9769433926534373547.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/LTLFireability17665131513789262480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9769433926534373547.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(("(i4.u3.p11>=1)")||(F("((i2.u6.p19>=1)&&(i2.u6.p20>=1))"))))))
Formula 0 simplified : XX(!"(i4.u3.p11>=1)" & G!"((i2.u6.p19>=1)&&(i2.u6.p20>=1))")
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin15519793141127355084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15519793141127355084;'/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)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: X(X(((LTLAPp0==true)||<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: "X(X(((LTLAPp0==true)||<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.095: DFS-FIFO for weak LTL, using special progress label 25
pins2lts-mc-linux64( 0/ 8), 0.095: There are 26 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.095: State length is 26, there are 22 groups
pins2lts-mc-linux64( 0/ 8), 0.095: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.095: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.095: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.095: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 4.741: ~104 levels ~960 states ~6488 transitions
pins2lts-mc-linux64( 6/ 8), 5.028: ~211 levels ~1920 states ~15160 transitions
pins2lts-mc-linux64( 6/ 8), 5.433: ~425 levels ~3840 states ~34504 transitions
pins2lts-mc-linux64( 0/ 8), 13.237: ~887 levels ~7680 states ~79352 transitions
pins2lts-mc-linux64( 0/ 8), 16.978: ~1761 levels ~15360 states ~159896 transitions
pins2lts-mc-linux64( 0/ 8), 17.681: ~3520 levels ~30720 states ~320280 transitions
pins2lts-mc-linux64( 6/ 8), 21.583: ~7054 levels ~61440 states ~677672 transitions
pins2lts-mc-linux64( 6/ 8), 22.895: ~14166 levels ~122880 states ~1388832 transitions
pins2lts-mc-linux64( 6/ 8), 24.299: ~28368 levels ~245760 states ~2827176 transitions
pins2lts-mc-linux64( 6/ 8), 25.696: ~56888 levels ~491520 states ~5764000 transitions
pins2lts-mc-linux64( 6/ 8), 27.829: ~113851 levels ~983040 states ~11579312 transitions
pins2lts-mc-linux64( 6/ 8), 32.345: ~227860 levels ~1966080 states ~23276496 transitions
pins2lts-mc-linux64( 0/ 8), 39.194: ~383999 levels ~3932160 states ~40434848 transitions
pins2lts-mc-linux64( 0/ 8), 42.733: ~383999 levels ~7864320 states ~48709144 transitions
pins2lts-mc-linux64( 0/ 8), 50.966: ~383999 levels ~15728640 states ~68085848 transitions
pins2lts-mc-linux64( 0/ 8), 68.412: ~383999 levels ~31457280 states ~106919776 transitions
pins2lts-mc-linux64( 0/ 8), 104.040: ~383999 levels ~62914560 states ~184256576 transitions
pins2lts-mc-linux64( 0/ 8), 177.052: ~383999 levels ~125829120 states ~339435904 transitions
pins2lts-mc-linux64( 0/ 8), 326.238: ~383999 levels ~251658240 states ~650114280 transitions
pins2lts-mc-linux64( 0/ 8), 716.190: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 716.212:
pins2lts-mc-linux64( 0/ 8), 716.212: mean standard work distribution: 173.2% (states) 173.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 716.212:
pins2lts-mc-linux64( 0/ 8), 716.212: Explored 125229608 states 316724013 transitions, fanout: 2.529
pins2lts-mc-linux64( 0/ 8), 716.212: Total exploration time 716.100 sec (716.060 sec minimum, 716.078 sec on average)
pins2lts-mc-linux64( 0/ 8), 716.212: States per second: 174877, Transitions per second: 442290
pins2lts-mc-linux64( 0/ 8), 716.212:
pins2lts-mc-linux64( 0/ 8), 716.212: Progress states detected: 3
pins2lts-mc-linux64( 0/ 8), 716.212: Redundant explorations: -6.6964
pins2lts-mc-linux64( 0/ 8), 716.212:
pins2lts-mc-linux64( 0/ 8), 716.212: Queue width: 8B, total height: 768014, memory: 5.86MB
pins2lts-mc-linux64( 0/ 8), 716.212: Tree memory: 1162.8MB, 9.1 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 716.212: Tree fill ratio (roots/leafs): 99.0%/54.0%
pins2lts-mc-linux64( 0/ 8), 716.212: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 716.212: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 716.212: Est. total memory use: 1168.6MB (~1029.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15519793141127355084;'/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)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15519793141127355084;'/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)))))' '--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 21:45:36] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:45:36] [INFO ] Time to serialize gal into /tmp/LTLFireability12793483969266472959.gal : 1 ms
[2025-06-01 21:45:36] [INFO ] Time to serialize properties into /tmp/LTLFireability18206017700278912286.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/LTLFireability12793483969266472959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18206017700278912286.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(("(p11>=1)")||(F("((p19>=1)&&(p20>=1))"))))))
Formula 0 simplified : XX(!"(p11>=1)" & G!"((p19>=1)&&(p20>=1))")
Detected timeout of ITS tools.
[2025-06-01 22:06:53] [INFO ] Flatten gal took : 1 ms
[2025-06-01 22:06:53] [INFO ] Input system was already deterministic with 18 transitions.
[2025-06-01 22:06:53] [INFO ] Transformed 25 places.
[2025-06-01 22:06:53] [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 22:06:53] [INFO ] Time to serialize gal into /tmp/LTLFireability6885480188464363384.gal : 0 ms
[2025-06-01 22:06:53] [INFO ] Time to serialize properties into /tmp/LTLFireability3041084757791359994.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/LTLFireability6885480188464363384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3041084757791359994.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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(("(p11>=1)")||(F("((p19>=1)&&(p20>=1))"))))))
Formula 0 simplified : XX(!"(p11>=1)" & G!"((p19>=1)&&(p20>=1))")

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-32000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is HouseConstruction-PT-32000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422300252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-32000.tgz
mv HouseConstruction-PT-32000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;