Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074500891.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is HouseConstruction-PT-02000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074500891
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.6K Mar 7 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Mar 7 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Mar 7 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 7 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 7 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 13K Mar 3 18:30 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-02000-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-02000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779778106638

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-02000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 06:48:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 06:48:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 06:48:27] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2026-05-26 06:48:27] [INFO ] Transformed 26 places.
[2026-05-26 06:48:27] [INFO ] Transformed 18 transitions.
[2026-05-26 06:48:27] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HouseConstruction-PT-02000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-02000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-02000-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 18 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3595434802996662192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12311068594817915555.kers'
[2026-05-26 06:48:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3595434802996662192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12311068594817915555.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:48:28] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12311068594817915555.kers
Total runtime 1 ms.
[2026-05-26 06:48:28] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-26 06:48:28] [INFO ] Invariant cache hit.
[2026-05-26 06:48:28] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 06:48:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 32 constraints, problems are : Problem set: 0 solved, 17 unsolved in 777 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 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
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 49 constraints, problems are : Problem set: 0 solved, 17 unsolved in 497 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1295ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1309ms
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1651 ms. Remains : 25/26 places, 18/18 transitions.
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.
[2026-05-26 06:48:29] [INFO ] Invariant cache hit.
[2026-05-26 06:48:29] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 06:48:29] [INFO ] Invariant cache hit.
[2026-05-26 06:48:29] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 21 out of 25 places after structural reductions.
[2026-05-26 06:48:29] [INFO ] Flatten gal took : 14 ms
[2026-05-26 06:48:29] [INFO ] Flatten gal took : 5 ms
[2026-05-26 06:48:30] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 40028 steps (8 resets) in 71 ms. (555 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 8/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 1/8 properties
BEST_FIRST walk for 3940 steps (8 resets) in 8 ms. (437 steps per ms) remains 0/1 properties
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.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(((X(F(p1))&&F(p2))||G(F(p1)))))))))'
Support contains 5 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.
[2026-05-26 06:48:30] [INFO ] Invariant cache hit.
[2026-05-26 06:48:30] [INFO ] Implicit Places using invariants in 39 ms returned [3, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 22/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(((X(F(p1))&&F(p2))||G(F(p1)))))))))'
Stuttering acceptance computed with spot in 790 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-01
Product exploration explored 100000 steps with 9263 reset in 317 ms.
Product exploration explored 100000 steps with 9230 reset in 158 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)...)
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 23 states, 61 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40030 steps (8 resets) in 24 ms. (1601 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5617671422383202668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2800269325108202307.kers'
[2026-05-26 06:48:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5617671422383202668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2800269325108202307.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:48:32] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2800269325108202307.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/37 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/39 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/37 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/39 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 4 ms.
Knowledge based reduction with 4 factoid took 2294 ms. Reduced automaton from 23 states, 61 edges and 3 AP (stutter insensitive) to 21 states, 58 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 824 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false]
Knowledge-based reduction took 3710 ms.
Stuttering acceptance computed with spot in 885 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false]
Support contains 5 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 17 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 14 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 14 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 12 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 10 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 9 transition count 8
Applied a total of 13 rules in 77 ms. Remains 9 /22 variables (removed 13) and now considering 8/18 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6874113892317896498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2378346950488245634.kers'
[2026-05-26 06:48:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6874113892317896498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2378346950488245634.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 9 cols 17 entries
Finished phase 1 with 7 SingleSign rule and 1 generalized
[2026-05-26 06:48:36] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2378346950488245634.kers
Total runtime 0 ms.
[2026-05-26 06:48:36] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-26 06:48:36] [INFO ] Invariant cache hit.
[2026-05-26 06:48:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2026-05-26 06:48:36] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-26 06:48:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/17 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 10 constraints, problems are : Problem set: 0 solved, 7 unsolved in 65 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/16 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/17 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 78 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 9/22 places, 8/18 transitions.
Computed a total of 9 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 8
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)...)
Knowledge based reduction with 20 factoid took 305 ms. Reduced automaton from 21 states, 58 edges and 3 AP (stutter insensitive) to 21 states, 58 edges and 3 AP (stutter insensitive).
RANDOM walk for 40028 steps (8 resets) in 195 ms. (204 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
[2026-05-26 06:48:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/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) 8/14 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/17 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/9 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/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) 8/14 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/17 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 37 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=12 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 2 ms.
Knowledge based reduction with 20 factoid took 487 ms. Reduced automaton from 21 states, 58 edges and 3 AP (stutter insensitive) to 21 states, 58 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 843 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false]
Knowledge-based reduction took 2063 ms.
Stuttering acceptance computed with spot in 822 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 822 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 20250 reset in 84 ms.
Product exploration explored 100000 steps with 20312 reset in 83 ms.
Built C files in :
/tmp/ltsmin4435065033209770098
[2026-05-26 06:48:40] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2026-05-26 06:48:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:48:40] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2026-05-26 06:48:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:48:40] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2026-05-26 06:48:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:48:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4435065033209770098
Running compilation step : cd /tmp/ltsmin4435065033209770098;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 197 ms.
Running link step : cd /tmp/ltsmin4435065033209770098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4435065033209770098;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14186444931561117739.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-26 06:48:55] [INFO ] Invariant cache hit.
[2026-05-26 06:48:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-26 06:48:55] [INFO ] Invariant cache hit.
[2026-05-26 06:48:55] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-26 06:48:55] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 9/9 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin2192727375323895919
[2026-05-26 06:48:55] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2026-05-26 06:48:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:48:55] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2026-05-26 06:48:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:48:55] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2026-05-26 06:48:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:48:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2192727375323895919
Running compilation step : cd /tmp/ltsmin2192727375323895919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin2192727375323895919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2192727375323895919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11874029660643948567.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 06:49:11] [INFO ] Flatten gal took : 3 ms
[2026-05-26 06:49:11] [INFO ] Flatten gal took : 1 ms
[2026-05-26 06:49:11] [INFO ] Time to serialize gal into /tmp/LTL12489281581896854488.gal : 1 ms
[2026-05-26 06:49:11] [INFO ] Time to serialize properties into /tmp/LTL9282079282696221169.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12489281581896854488.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15787157395217522775.hoa' '-atoms' '/tmp/LTL9282079282696221169.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9282079282696221169.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15787157395217522775.hoa
Detected timeout of ITS tools.
[2026-05-26 06:49:26] [INFO ] Flatten gal took : 1 ms
[2026-05-26 06:49:26] [INFO ] Flatten gal took : 0 ms
[2026-05-26 06:49:26] [INFO ] Time to serialize gal into /tmp/LTL5784038557209732458.gal : 0 ms
[2026-05-26 06:49:26] [INFO ] Time to serialize properties into /tmp/LTL1906587142786745985.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5784038557209732458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1906587142786745985.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(p17>=3)")||(X(X(X((G(F("(p10<=p21)")))||((X(F("(p10<=p21)")))&&(F("(p12>p7)"))))))))))
Formula 0 simplified : F(!"(p17>=3)" & XXX(FG!"(p10<=p21)" & (XG!"(p10<=p21)" | G!"(p12>p7)")))
Detected timeout of ITS tools.
[2026-05-26 06:49:41] [INFO ] Flatten gal took : 1 ms
[2026-05-26 06:49:41] [INFO ] Applying decomposition
[2026-05-26 06:49:41] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5978504232241518255.txt' '-o' '/tmp/graph5978504232241518255.bin' '-w' '/tmp/graph5978504232241518255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5978504232241518255.bin' '-l' '-1' '-v' '-w' '/tmp/graph5978504232241518255.weights' '-q' '0' '-e' '0.001'
[2026-05-26 06:49:41] [INFO ] Decomposing Gal with order
[2026-05-26 06:49:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 06:49:41] [INFO ] Flatten gal took : 63 ms
[2026-05-26 06:49:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-26 06:49:41] [INFO ] Time to serialize gal into /tmp/LTL7749929277615952419.gal : 0 ms
[2026-05-26 06:49:41] [INFO ] Time to serialize properties into /tmp/LTL12500292416899596923.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7749929277615952419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12500292416899596923.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(gu1.p17>=3)")||(X(X(X((G(F("(gu2.p10<=gu2.p21)")))||((X(F("(gu2.p10<=gu2.p21)")))&&(F("(gu0.p12>gu0.p7)"))))))))))
Formula 0 simplified : F(!"(gu1.p17>=3)" & XXX(FG!"(gu2.p10<=gu2.p21)" & (XG!"(gu2.p10<=gu2.p21)" | G!"(gu0.p12>gu0.p7)")))
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-02000-LTLCardinality-01 finished in 85805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(G(p1) U (F(p2)||X(p3)))))'
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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2438989731515882159.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6363886531749672332.kers'
[2026-05-26 06:49:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2438989731515882159.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6363886531749672332.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:49:56] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6363886531749672332.kers
Total runtime 2 ms.
[2026-05-26 06:49:56] [INFO ] Implicit Places using invariants in 41 ms returned [9, 13, 19]
[2026-05-26 06:49:56] [INFO ] Actually due to overlaps returned [9, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15802905987096225724.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5755989307095446906.kers'
[2026-05-26 06:49:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15802905987096225724.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5755989307095446906.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:49:56] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5755989307095446906.kers
Total runtime 0 ms.
[2026-05-26 06:49:56] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-26 06:49:56] [INFO ] Invariant cache hit.
[2026-05-26 06:49:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 82 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 128 ms. Remains : 22/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(G(p1) U (F(p2)||X(p3)))))'
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), true, (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-02 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(p1)))))'
Support contains 2 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17489647558753994098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10756055830572958270.kers'
[2026-05-26 06:49:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17489647558753994098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10756055830572958270.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:49:56] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10756055830572958270.kers
Total runtime 0 ms.
[2026-05-26 06:49:56] [INFO ] Implicit Places using invariants in 46 ms returned [3, 9, 13, 19]
[2026-05-26 06:49:56] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10643061496778492618.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13645750033455254771.kers'
[2026-05-26 06:49:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10643061496778492618.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13645750033455254771.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 21 cols 41 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:49:56] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13645750033455254771.kers
Total runtime 1 ms.
[2026-05-26 06:49:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-26 06:49:56] [INFO ] Invariant cache hit.
[2026-05-26 06:49:56] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 87 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 149 ms. Remains : 21/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(p1)))))'
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 48 ms.
Product exploration explored 100000 steps with 33333 reset in 48 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)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 10 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 53 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLCardinality-03 finished in 491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 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 11 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 7 transition count 4
Applied a total of 6 rules in 208 ms. Remains 7 /25 variables (removed 18) and now considering 4/18 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13120843431497837156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15545038046896816290.kers'
[2026-05-26 06:49:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13120843431497837156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15545038046896816290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 7 cols 11 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-05-26 06:49:57] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15545038046896816290.kers
Total runtime 0 ms.
[2026-05-26 06:49:57] [INFO ] Implicit Places using invariants in 43 ms returned [3, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/25 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 5/25 places, 4/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-04
Stuttering criterion allowed to conclude after 8000 steps with 0 reset in 10 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-04 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(p1) U ((p2&&X(p1))||X(G(p1)))))))'
Support contains 5 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3348544239151119149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9175323674419424463.kers'
[2026-05-26 06:49:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3348544239151119149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9175323674419424463.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:49:57] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9175323674419424463.kers
Total runtime 0 ms.
[2026-05-26 06:49:57] [INFO ] Implicit Places using invariants in 47 ms returned [3, 9, 13, 19]
[2026-05-26 06:49:57] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13237966546134056047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15347318386354602473.kers'
[2026-05-26 06:49:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13237966546134056047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15347318386354602473.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 21 cols 41 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:49:57] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15347318386354602473.kers
Total runtime 0 ms.
[2026-05-26 06:49:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-26 06:49:57] [INFO ] Invariant cache hit.
[2026-05-26 06:49:57] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 96 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 154 ms. Remains : 21/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(p1) U ((p2&&X(p1))||X(G(p1)))))))'
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-06 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&(F(p1)||G(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.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12583332455708116782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6729105239784045405.kers'
[2026-05-26 06:49:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12583332455708116782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6729105239784045405.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:49:58] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6729105239784045405.kers
Total runtime 0 ms.
[2026-05-26 06:49:58] [INFO ] Implicit Places using invariants in 43 ms returned [3, 9, 13]
[2026-05-26 06:49:58] [INFO ] Actually due to overlaps returned [3, 9]
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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10577277587801301548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11303120741614545857.kers'
[2026-05-26 06:49:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10577277587801301548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11303120741614545857.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:49:58] [INFO ] Computed 4 invariants in 5 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11303120741614545857.kers
Total runtime 6 ms.
[2026-05-26 06:49:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-26 06:49:58] [INFO ] Invariant cache hit.
[2026-05-26 06:49:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 80 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 125 ms. Remains : 22/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&(F(p1)||G(p2))))))'
Stuttering acceptance computed with spot in 165 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-08 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 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 17 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
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 16 transition count 10
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 13 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 12 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 15 place count 8 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 16 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 6 transition count 5
Applied a total of 18 rules in 39 ms. Remains 6 /25 variables (removed 19) and now considering 5/18 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-84442384782442018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12983720093568378464.kers'
[2026-05-26 06:49:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-84442384782442018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12983720093568378464.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 6 cols 11 entries
Finished phase 1 with 4 SingleSign rule and 1 generalized
[2026-05-26 06:49:58] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12983720093568378464.kers
Total runtime 0 ms.
[2026-05-26 06:49:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-26 06:49:58] [INFO ] Invariant cache hit.
[2026-05-26 06:49:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-26 06:49:58] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-26 06:49:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/11 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 63 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 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
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/11 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 6/25 places, 5/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-09
Product exploration explored 100000 steps with 5925 reset in 69 ms.
Product exploration explored 100000 steps with 6060 reset in 63 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
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)...)
Knowledge based reduction with 11 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40028 steps (8 resets) in 16 ms. (2354 steps per ms) remains 2/4 properties
BEST_FIRST walk for 4493 steps (1 resets) in 8 ms. (499 steps per ms) remains 0/2 properties
Knowledge based reduction with 11 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 392 ms.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2026-05-26 06:49:59] [INFO ] Invariant cache hit.
[2026-05-26 06:49:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 06:49:59] [INFO ] Invariant cache hit.
[2026-05-26 06:49:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-26 06:49:59] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
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)...)
Knowledge based reduction with 11 factoid took 43 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40028 steps (8 resets) in 12 ms. (3079 steps per ms) remains 2/4 properties
BEST_FIRST walk for 922 steps (0 resets) in 5 ms. (153 steps per ms) remains 0/2 properties
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 371 ms.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 6031 reset in 61 ms.
Product exploration explored 100000 steps with 6011 reset in 64 ms.
Built C files in :
/tmp/ltsmin11549447520105344814
[2026-05-26 06:49:59] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2026-05-26 06:49:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:49:59] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2026-05-26 06:49:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:49:59] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2026-05-26 06:49:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:49:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11549447520105344814
Running compilation step : cd /tmp/ltsmin11549447520105344814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin11549447520105344814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin11549447520105344814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1545333169074217693.hoa' '--buchi-type=spotba'
LTSmin run took 53 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-02000-LTLCardinality-09 finished in 1902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Support contains 2 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-838682258137912282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1539897922129290379.kers'
[2026-05-26 06:50:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-838682258137912282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1539897922129290379.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:50:00] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1539897922129290379.kers
Total runtime 0 ms.
[2026-05-26 06:50:00] [INFO ] Implicit Places using invariants in 83 ms returned [3, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 22/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-10
Product exploration explored 100000 steps with 1718 reset in 91 ms.
Product exploration explored 100000 steps with 1706 reset in 97 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)...)
Knowledge based reduction with 5 factoid took 58 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40028 steps (8 resets) in 11 ms. (3335 steps per ms) remains 1/1 properties
BEST_FIRST walk for 422 steps (0 resets) in 4 ms. (84 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 60 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 114 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3898183279281261483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17613901638556551318.kers'
[2026-05-26 06:50:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3898183279281261483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17613901638556551318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:50:00] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17613901638556551318.kers
Total runtime 1 ms.
[2026-05-26 06:50:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Negative knowledge disproves property using: (F p1)
Knowledge-based reduction took 315 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-10 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLCardinality-10 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((p0&&X((p0 U (p1||G(p0))))))))&&(F(p2)||G(p1))))'
Support contains 5 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1105598013837290879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1283400739533719998.kers'
[2026-05-26 06:50:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1105598013837290879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1283400739533719998.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:50:00] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1283400739533719998.kers
Total runtime 0 ms.
[2026-05-26 06:50:00] [INFO ] Implicit Places using invariants in 29 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 22/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((p0&&X((p0 U (p1||G(p0))))))))&&(F(p2)||G(p1))))'
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-11
Product exploration explored 100000 steps with 3300 reset in 84 ms.
Product exploration explored 100000 steps with 3491 reset in 103 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)...)
Knowledge based reduction with 11 factoid took 102 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40028 steps (8 resets) in 10 ms. (3638 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16191004155318516215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-359563325383713508.kers'
[2026-05-26 06:50:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16191004155318516215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-359563325383713508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:50:01] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-359563325383713508.kers
Total runtime 0 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/39 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 60 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 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
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/39 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 28 constraints, problems are : Problem set: 0 solved, 2 unsolved in 87 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 27 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 0 ms.
Knowledge based reduction with 11 factoid took 148 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2026-05-26 06:50:02] [INFO ] Invariant cache hit.
[2026-05-26 06:50:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 06:50:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-26 06:50:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 06:50:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 06:50:02] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-26 06:50:02] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 06:50:02] [INFO ] Added : 17 causal constraints over 4 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 769 ms.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 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.
[2026-05-26 06:50:02] [INFO ] Invariant cache hit.
[2026-05-26 06:50:02] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-26 06:50:02] [INFO ] Invariant cache hit.
[2026-05-26 06:50:02] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 06:50:02] [INFO ] Invariant cache hit.
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 420 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
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 289 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 734ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 734ms
Finished structural reductions in LTL mode , in 1 iterations and 800 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)...)
Knowledge based reduction with 4 factoid took 40 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40028 steps (8 resets) in 8 ms. (4447 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/4 properties
[2026-05-26 06:50:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/39 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 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
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/39 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 28 constraints, problems are : Problem set: 0 solved, 2 unsolved in 92 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 196ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 1 ms.
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2026-05-26 06:50:03] [INFO ] Invariant cache hit.
[2026-05-26 06:50:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-26 06:50:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-26 06:50:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 06:50:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 06:50:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-26 06:50:03] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 06:50:03] [INFO ] Added : 17 causal constraints over 4 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 664 ms.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3644 reset in 82 ms.
Product exploration explored 100000 steps with 3358 reset in 110 ms.
Spot run failed in 83 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13409573692527165936
[2026-05-26 06:50:04] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13409573692527165936
Running compilation step : cd /tmp/ltsmin13409573692527165936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin13409573692527165936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin13409573692527165936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10519163731999197404.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-02000-LTLCardinality-11 finished in 3625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(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 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14154559288682074498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5804831906952902273.kers'
[2026-05-26 06:50:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14154559288682074498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5804831906952902273.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:50:04] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5804831906952902273.kers
Total runtime 0 ms.
[2026-05-26 06:50:04] [INFO ] Implicit Places using invariants in 27 ms returned [3, 9, 13]
[2026-05-26 06:50:04] [INFO ] Actually due to overlaps returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3417109201541453048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5608245060636800408.kers'
[2026-05-26 06:50:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3417109201541453048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5608245060636800408.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:50:04] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5608245060636800408.kers
Total runtime 0 ms.
[2026-05-26 06:50:04] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-26 06:50:04] [INFO ] Invariant cache hit.
[2026-05-26 06:50:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 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 80 ms. Remains : 22/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-12 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 5 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10684456875571672782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10080789850288388294.kers'
[2026-05-26 06:50:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10684456875571672782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10080789850288388294.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:50:04] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10080789850288388294.kers
Total runtime 6 ms.
[2026-05-26 06:50:04] [INFO ] Implicit Places using invariants in 31 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 22/25 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-13
Product exploration explored 100000 steps with 6405 reset in 70 ms.
Product exploration explored 100000 steps with 6450 reset in 88 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)...)
Knowledge based reduction with 7 factoid took 37 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40028 steps (8 resets) in 5 ms. (6671 steps per ms) remains 1/1 properties
BEST_FIRST walk for 229 steps (0 resets) in 4 ms. (45 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 48 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 115 ms :[(NOT p1), (NOT p1)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2694012414450370892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12462126697446267790.kers'
[2026-05-26 06:50:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2694012414450370892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12462126697446267790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 06:50:05] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12462126697446267790.kers
Total runtime 0 ms.
[2026-05-26 06:50:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Negative knowledge disproves property using: (F p1)
Knowledge-based reduction took 292 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLCardinality-13 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 6 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 18 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 15 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 13 transition count 10
Applied a total of 10 rules in 3 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18182619848620249680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-295903787741285098.kers'
[2026-05-26 06:50:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18182619848620249680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-295903787741285098.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 13 cols 25 entries
Finished phase 1 with 9 SingleSign rule and 1 generalized
[2026-05-26 06:50:05] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-295903787741285098.kers
Total runtime 0 ms.
[2026-05-26 06:50:05] [INFO ] Implicit Places using invariants in 22 ms returned [5, 7, 9]
[2026-05-26 06:50:05] [INFO ] Actually due to overlaps returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 10/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 10 transition count 10
Applied a total of 1 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/10 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14362885377448414341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1447183350348943176.kers'
[2026-05-26 06:50:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14362885377448414341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1447183350348943176.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 10 cols 19 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-26 06:50:05] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1447183350348943176.kers
Total runtime 0 ms.
[2026-05-26 06:50:05] [INFO ] Implicit Places using invariants in 13 ms returned []
[2026-05-26 06:50:05] [INFO ] Invariant cache hit.
[2026-05-26 06:50:05] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 10/25 places, 10/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-14
Product exploration explored 100000 steps with 562 reset in 93 ms.
Product exploration explored 100000 steps with 566 reset in 96 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 10
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)...)
Property proved to be false by K+ with min(phi)
Knowledge based reduction with 11 factoid took 18 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 44 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLCardinality-14 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 21 transition count 9
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 14 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 13 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 9 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 8 transition count 6
Applied a total of 26 rules in 118 ms. Remains 8 /25 variables (removed 17) and now considering 6/18 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10480666538837377953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9512998998788635109.kers'
[2026-05-26 06:50:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10480666538837377953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9512998998788635109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 8 cols 14 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-05-26 06:50:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9512998998788635109.kers
Total runtime 0 ms.
[2026-05-26 06:50:05] [INFO ] Implicit Places using invariants in 18 ms returned [0, 5]
[2026-05-26 06:50:05] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/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 6 transition count 6
Applied a total of 1 rules in 0 ms. Remains 6 /7 variables (removed 1) and now considering 6/6 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16812585683938239015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14521215033421397125.kers'
[2026-05-26 06:50:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16812585683938239015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14521215033421397125.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 6 cols 11 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-26 06:50:05] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14521215033421397125.kers
Total runtime 6 ms.
[2026-05-26 06:50:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-26 06:50:06] [INFO ] Invariant cache hit.
[2026-05-26 06:50:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 6/25 places, 6/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLCardinality-15 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(((X(F(p1))&&F(p2))||G(F(p1)))))))))'
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 06:50:06] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6901891439568784560
[2026-05-26 06:50:06] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2026-05-26 06:50:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:50:06] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2026-05-26 06:50:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:50:06] [INFO ] Applying decomposition
[2026-05-26 06:50:06] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2026-05-26 06:50:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:50:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6901891439568784560
Running compilation step : cd /tmp/ltsmin6901891439568784560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 06:50:06] [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.202604301425/bin/convert-linux64' '-i' '/tmp/graph1664802098872329640.txt' '-o' '/tmp/graph1664802098872329640.bin' '-w' '/tmp/graph1664802098872329640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1664802098872329640.bin' '-l' '-1' '-v' '-w' '/tmp/graph1664802098872329640.weights' '-q' '0' '-e' '0.001'
[2026-05-26 06:50:06] [INFO ] Decomposing Gal with order
[2026-05-26 06:50:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 06:50:06] [INFO ] Flatten gal took : 2 ms
[2026-05-26 06:50:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 06:50:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality18372219694226402846.gal : 2 ms
[2026-05-26 06:50:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality13178894558576542225.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18372219694226402846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13178894558576542225.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(("(gi1.gi2.gu5.p17>=3)")||(X(X(X(((X(F("(gu7.p10<=gu7.p21)")))&&(F("(gu2.p12>gu2.p7)")))||(G(F("(gu7.p10<=gu7.p21)"))))))))))
Formula 0 simplified : F(!"(gi1.gi2.gu5.p17>=3)" & XXX(FG!"(gu7.p10<=gu7.p21)" & (XG!"(gu7.p10<=gu7.p21)" | G!"(gu2.p12>gu2.p7)")))
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin6901891439568784560;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6901891439568784560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X(((X(<>((LTLAPp1==true)))&&<>((LTLAPp2==true)))||[](<>((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 07:10:48] [INFO ] Flatten gal took : 81 ms
[2026-05-26 07:10:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality5307609536141359630.gal : 38 ms
[2026-05-26 07:10:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality15827233940432546759.ltl : 8 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5307609536141359630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15827233940432546759.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(("(p17>=3)")||(X(X(X(((X(F("(p10<=p21)")))&&(F("(p12>p7)")))||(G(F("(p10<=p21)"))))))))))
Formula 0 simplified : F(!"(p17>=3)" & XXX(FG!"(p10<=p21)" & (XG!"(p10<=p21)" | G!"(p12>p7)")))
Detected timeout of ITS tools.
[2026-05-26 07:31:36] [INFO ] Flatten gal took : 137 ms
[2026-05-26 07:31:36] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-26 07:31:37] [INFO ] Transformed 25 places.
[2026-05-26 07:31:37] [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
[2026-05-26 07:31:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality12134302753747576756.gal : 1 ms
[2026-05-26 07:31:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality739432502562734451.ltl : 5 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12134302753747576756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality739432502562734451.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(p17>=3)")||(X(X(X(((X(F("(p10<=p21)")))&&(F("(p12>p7)")))||(G(F("(p10<=p21)"))))))))))
Formula 0 simplified : F(!"(p17>=3)" & XXX(FG!"(p10<=p21)" & (XG!"(p10<=p21)" | G!"(p12>p7)")))

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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