Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590500827.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is UtilityControlRoom-PT-Z2T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590500827
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 17K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 64K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 308K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 93K May 29 14:33 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 UtilityControlRoom-PT-Z2T4N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749274935330

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T4N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 05:42:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 05:42:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 05:42:16] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2025-06-07 05:42:16] [INFO ] Transformed 140 places.
[2025-06-07 05:42:16] [INFO ] Transformed 216 transitions.
[2025-06-07 05:42:16] [INFO ] Parsed PT model containing 140 places and 216 transitions and 680 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 17 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2025-06-07 05:42:17] [INFO ] Computed 19 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:42:17] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-07 05:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:42:17] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-07 05:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 159 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7459 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 176/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 176 unsolved in 13644 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21211ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 21229ms
Finished structural reductions in LTL mode , in 1 iterations and 21668 ms. Remains : 140/140 places, 184/184 transitions.
Support contains 132 out of 140 places after structural reductions.
[2025-06-07 05:42:39] [INFO ] Flatten gal took : 35 ms
[2025-06-07 05:42:39] [INFO ] Flatten gal took : 16 ms
[2025-06-07 05:42:39] [INFO ] Input system was already deterministic with 184 transitions.
RANDOM walk for 40000 steps (8 resets) in 1803 ms. (22 steps per ms) remains 6/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
[2025-06-07 05:42:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 107/324 variables, and 7 constraints, problems are : Problem set: 6 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 7/19 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||(p0&&(p1 U (G(p1)||(p1&&G(!p2))))))) U G(p3)))'
Support contains 81 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 13 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2025-06-07 05:42:40] [INFO ] Computed 19 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:42:40] [INFO ] Implicit Places using invariants in 65 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 591 ms :[(NOT p3), true, (NOT p3), (AND (NOT p0) p3), (AND p3 (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), p2, (NOT p1), (AND (NOT p0) p2 p3), (AND p2 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-00
Product exploration explored 100000 steps with 33272 reset in 521 ms.
Product exploration explored 100000 steps with 33500 reset in 430 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) p0)), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p3 p2 p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p3 (NOT p1) p0))), (X (AND (NOT p3) (NOT p1) p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) p2 p1 p0))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (NOT (AND p3 p0))), (X (NOT (AND p3 p2 (NOT p1) p0))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND p3 p2 p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) p2 p1 p0)))), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p2 (NOT p1) p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 45 factoid took 338 ms. Reduced automaton from 10 states, 43 edges and 4 AP (stutter insensitive) to 10 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 373 ms :[(NOT p3), true, (NOT p3), (AND (NOT p0) p3), (AND (NOT p0) p3 (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), p2, (NOT p1), (AND (NOT p0) p2 p3), (AND p2 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 486 ms. (82 steps per ms) remains 5/27 properties
BEST_FIRST walk for 40001 steps (8 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/5 properties
// Phase 1: matrix 168 rows 123 cols
[2025-06-07 05:42:43] [INFO ] Computed 18 invariants in 1 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/123 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 1 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/123 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 141 constraints, problems are : Problem set: 1 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 205ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) p0)), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p3) (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p3 p2 p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p3 (NOT p1) p0))), (X (AND (NOT p3) (NOT p1) p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) p2 p1 p0))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (NOT (AND p3 p0))), (X (NOT (AND p3 p2 (NOT p1) p0))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 p0)))), (X (X (NOT (AND p3 p2 p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) p2 p1 p0)))), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 p2 (NOT p1) p0)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F p1), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p3) p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p3) p1 (NOT p2)))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F p3), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p3 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p3) p1 (NOT p2)))), (F (NOT (OR p0 (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p1) p2))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR (NOT p0) p3 (NOT p1) p2))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR p1 p2))), (F (NOT (AND p0 (NOT p3) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p3) p1 (NOT p2))))
Knowledge based reduction with 46 factoid took 942 ms. Reduced automaton from 10 states, 43 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-00 finished in 3957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&F((G(p1)&&X((p2||X((X(G(p3)) U (p2&&X(G(p3)))))))))))))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2025-06-07 05:42:44] [INFO ] Computed 19 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:42:44] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-07 05:42:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:42:44] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-07 05:42:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 159 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7065 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 176/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 176 unsolved in 13531 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20639ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 20640ms
Finished structural reductions in LTL mode , in 1 iterations and 20865 ms. Remains : 140/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 628 ms :[(NOT p0), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-03
Product exploration explored 100000 steps with 1 reset in 232 ms.
Stack based approach found an accepted trace after 2877 steps with 0 reset with depth 2878 and stack size 2878 in 8 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-03 finished in 21774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F((F(p2)&&G(p1)))))'
Support contains 82 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 132 transition count 176
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 33 place count 123 transition count 168
Applied a total of 33 rules in 27 ms. Remains 123 /140 variables (removed 17) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-06-07 05:43:06] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:43:06] [INFO ] Implicit Places using invariants in 78 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/140 places, 168/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 122/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-05
Product exploration explored 100000 steps with 1 reset in 201 ms.
Product exploration explored 100000 steps with 0 reset in 357 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 509 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND p1 p0 (NOT p2)), false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 1/10 properties
BEST_FIRST walk for 956 steps (0 resets) in 7 ms. (119 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 901 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND p1 p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND p1 p0 (NOT p2)), false, false]
// Phase 1: matrix 168 rows 122 cols
[2025-06-07 05:43:09] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:43:09] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2025-06-07 05:43:09] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-07 05:43:10] [INFO ] Computed and/alt/rep : 144/208/144 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 05:43:10] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-07 05:43:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:43:10] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-07 05:43:10] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-07 05:43:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:43:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2025-06-07 05:43:10] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-06-07 05:43:10] [INFO ] Computed and/alt/rep : 144/208/144 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 05:43:10] [INFO ] Added : 2 causal constraints over 1 iterations in 37 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 82 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-06-07 05:43:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:43:10] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 05:43:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:43:10] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:43:10] [INFO ] Redundant transitions in 4 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-07 05:43:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 8/122 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 168/290 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 139 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5159 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 8/122 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 168/290 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 144/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 283 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5867 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11047ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 11048ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11205 ms. Remains : 122/122 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X p0))]
False Knowledge obtained : [(X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 833 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND p1 p0 (NOT p2)), false, false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/10 properties
BEST_FIRST walk for 956 steps (0 resets) in 5 ms. (159 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X p0))]
False Knowledge obtained : [(X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 1330 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND p1 p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND p1 p0 (NOT p2)), false, false]
[2025-06-07 05:43:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:43:25] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-07 05:43:25] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-06-07 05:43:25] [INFO ] Computed and/alt/rep : 144/208/144 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 05:43:25] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-07 05:43:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:43:25] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-07 05:43:25] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-06-07 05:43:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:43:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2025-06-07 05:43:25] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-06-07 05:43:25] [INFO ] Computed and/alt/rep : 144/208/144 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-07 05:43:26] [INFO ] Added : 2 causal constraints over 1 iterations in 34 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p1 (NOT p0) (NOT p2)), (AND p1 p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 4 reset in 200 ms.
Product exploration explored 100000 steps with 3 reset in 401 ms.
Built C files in :
/tmp/ltsmin14197414222992406636
[2025-06-07 05:43:27] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2025-06-07 05:43:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:43:27] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2025-06-07 05:43:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:43:27] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2025-06-07 05:43:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:43:27] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14197414222992406636
Running compilation step : cd /tmp/ltsmin14197414222992406636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 496 ms.
Running link step : cd /tmp/ltsmin14197414222992406636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin14197414222992406636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14586705659796487942.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 82 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 168/168 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-06-07 05:43:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:43:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 05:43:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:43:42] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:43:42] [INFO ] Redundant transitions in 5 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-07 05:43:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 8/122 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 168/290 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 139 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5064 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 8/122 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 168/290 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 144/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 283 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6148 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11239ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 11240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11390 ms. Remains : 122/122 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin17958252672412334361
[2025-06-07 05:43:53] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2025-06-07 05:43:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:43:53] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2025-06-07 05:43:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:43:53] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2025-06-07 05:43:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:43:53] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17958252672412334361
Running compilation step : cd /tmp/ltsmin17958252672412334361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 311 ms.
Running link step : cd /tmp/ltsmin17958252672412334361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17958252672412334361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11161534413656741706.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 05:44:08] [INFO ] Flatten gal took : 9 ms
[2025-06-07 05:44:08] [INFO ] Flatten gal took : 8 ms
[2025-06-07 05:44:08] [INFO ] Time to serialize gal into /tmp/LTL4648618452538170018.gal : 4 ms
[2025-06-07 05:44:08] [INFO ] Time to serialize properties into /tmp/LTL7967024478040612222.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4648618452538170018.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7762477100015623644.hoa' '-atoms' '/tmp/LTL7967024478040612222.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7967024478040612222.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7762477100015623644.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 05:44:23] [INFO ] Flatten gal took : 8 ms
[2025-06-07 05:44:23] [INFO ] Flatten gal took : 7 ms
[2025-06-07 05:44:23] [INFO ] Time to serialize gal into /tmp/LTL16366334176363171019.gal : 1 ms
[2025-06-07 05:44:23] [INFO ] Time to serialize properties into /tmp/LTL7341274500422800873.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16366334176363171019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7341274500422800873.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(((((DoSecuring_0_0+DoSecuring_0_1)+(DoSecuring_1_0+DoSecuring_1_1))+((DoSecuring_2_0+DoSecuring_2_1)+(DoSecuring_3_0+DoSecuring...1800
Formula 0 simplified : (!"(((((DoSecuring_0_0+DoSecuring_0_1)+(DoSecuring_1_0+DoSecuring_1_1))+((DoSecuring_2_0+DoSecuring_2_1)+(DoSecuring_3_0+DoSecuring_...1791
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 05:44:38] [INFO ] Flatten gal took : 7 ms
[2025-06-07 05:44:38] [INFO ] Applying decomposition
[2025-06-07 05:44:38] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13514272768983568403.txt' '-o' '/tmp/graph13514272768983568403.bin' '-w' '/tmp/graph13514272768983568403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13514272768983568403.bin' '-l' '-1' '-v' '-w' '/tmp/graph13514272768983568403.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:44:39] [INFO ] Decomposing Gal with order
[2025-06-07 05:44:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:44:39] [INFO ] Removed a total of 156 redundant transitions.
[2025-06-07 05:44:39] [INFO ] Flatten gal took : 100 ms
[2025-06-07 05:44:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 6 ms.
[2025-06-07 05:44:39] [INFO ] Time to serialize gal into /tmp/LTL1730623332445359645.gal : 3 ms
[2025-06-07 05:44:39] [INFO ] Time to serialize properties into /tmp/LTL9050788677623189803.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1730623332445359645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9050788677623189803.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("(((((gu1.DoSecuring_0_0+gu1.DoSecuring_0_1)+(gu1.DoSecuring_1_0+gu1.DoSecuring_1_1))+((gu1.DoSecuring_2_0+gu1.DoSecuring_2_1)+(g...2192
Formula 0 simplified : (!"(((((gu1.DoSecuring_0_0+gu1.DoSecuring_0_1)+(gu1.DoSecuring_1_0+gu1.DoSecuring_1_1))+((gu1.DoSecuring_2_0+gu1.DoSecuring_2_1)+(gu...2183
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-05 finished in 108080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&G(p1))||(p2&&X(G(!p1))))))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 10 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2025-06-07 05:44:54] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:44:54] [INFO ] Implicit Places using invariants in 64 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p1) (NOT p0)), (AND p1 (NOT p0)), false, (NOT p1), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-06 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(X(G(p1)) U (p2||X((X(p2) U (p2&&X(p2))))))))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 11 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2025-06-07 05:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:44:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-07 05:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:44:54] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5807 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 160/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 303 constraints, problems are : Problem set: 0 solved, 160 unsolved in 9001 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14834ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14834ms
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15035 ms. Remains : 124/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-11 finished in 15338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 140 transition count 169
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 38 rules applied. Total rules applied 53 place count 125 transition count 146
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 77 place count 109 transition count 138
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 77 place count 109 transition count 122
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 109 place count 93 transition count 122
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 141 place count 77 transition count 106
Applied a total of 141 rules in 30 ms. Remains 77 /140 variables (removed 63) and now considering 106/184 (removed 78) transitions.
// Phase 1: matrix 106 rows 77 cols
[2025-06-07 05:45:09] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:10] [INFO ] Implicit Places using invariants in 69 ms returned [43, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/140 places, 106/184 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 67 transition count 98
Applied a total of 16 rules in 5 ms. Remains 67 /75 variables (removed 8) and now considering 98/106 (removed 8) transitions.
// Phase 1: matrix 98 rows 67 cols
[2025-06-07 05:45:10] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:10] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 05:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:10] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/140 places, 98/184 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 67/140 places, 98/184 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 165 ms.
Stack based approach found an accepted trace after 1039 steps with 0 reset with depth 1040 and stack size 1039 in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-12 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((G(p1)&&X(G(p0)))))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 6 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2025-06-07 05:45:10] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 05:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:10] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5906 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 160/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 303 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8940 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14877ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14877ms
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15052 ms. Remains : 124/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-13 finished in 15243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 140 transition count 158
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 64 place count 114 transition count 146
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 64 place count 114 transition count 132
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 92 place count 100 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 98 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 98 transition count 130
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 128 place count 82 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 82 transition count 112
Applied a total of 130 rules in 21 ms. Remains 82 /140 variables (removed 58) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 82 cols
[2025-06-07 05:45:25] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:25] [INFO ] Implicit Places using invariants in 69 ms returned [48, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/140 places, 112/184 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 64 transition count 96
Applied a total of 32 rules in 4 ms. Remains 64 /80 variables (removed 16) and now considering 96/112 (removed 16) transitions.
// Phase 1: matrix 96 rows 64 cols
[2025-06-07 05:45:25] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:25] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 05:45:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:25] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/140 places, 96/184 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 64/140 places, 96/184 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-14
Product exploration explored 100000 steps with 1 reset in 205 ms.
Stack based approach found an accepted trace after 1564 steps with 0 reset with depth 1565 and stack size 1561 in 5 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-14 finished in 557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 5 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2025-06-07 05:45:26] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:26] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-07 05:45:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:26] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:45:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5872 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 160/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 303 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8733 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14628ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14629ms
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14844 ms. Remains : 124/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N08-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-07 05:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:45:42] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2025-06-07 05:45:42] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-07 05:45:42] [INFO ] Computed and/alt/rep : 144/216/144 causal constraints (skipped 16 transitions) in 11 ms.
[2025-06-07 05:45:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:45:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-07 05:45:42] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-07 05:45:42] [INFO ] Computed and/alt/rep : 144/216/144 causal constraints (skipped 16 transitions) in 11 ms.
[2025-06-07 05:45:42] [INFO ] Added : 16 causal constraints over 4 iterations in 66 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 168/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-06-07 05:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:42] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-07 05:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:45:42] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:45:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5806 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 160/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 303 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8770 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14601ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14602ms
Finished structural reductions in LTL mode , in 1 iterations and 14807 ms. Remains : 124/124 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-07 05:45:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:45:58] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2025-06-07 05:45:58] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-07 05:45:58] [INFO ] Computed and/alt/rep : 144/216/144 causal constraints (skipped 16 transitions) in 11 ms.
[2025-06-07 05:45:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:45:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2025-06-07 05:45:58] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-07 05:45:58] [INFO ] Computed and/alt/rep : 144/216/144 causal constraints (skipped 16 transitions) in 16 ms.
[2025-06-07 05:45:58] [INFO ] Added : 16 causal constraints over 4 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 221 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 168/168 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 124 transition count 184
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 124 transition count 184
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 48 place count 124 transition count 192
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 64 place count 124 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 123 transition count 160
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 123 transition count 160
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 116 transition count 153
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 116 transition count 153
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 94 place count 102 transition count 125
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 108 place count 102 transition count 125
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 122 place count 88 transition count 111
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 136 place count 88 transition count 111
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 150 place count 88 transition count 97
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 150 rules in 25 ms. Remains 88 /124 variables (removed 36) and now considering 97/168 (removed 71) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:45:59] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
// Phase 1: matrix 97 rows 88 cols
[2025-06-07 05:45:59] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:45:59] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:45:59] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 8/88 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:46:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:46:00] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:46:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:46:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:46:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:46:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:46:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:46:00] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 8/29 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 97/185 variables, 88/117 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/117 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/117 constraints. Problems are: Problem set: 44 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 117 constraints, problems are : Problem set: 44 solved, 44 unsolved in 2126 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 42/88 variables, 19/21 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 8/29 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 97/185 variables, 88/117 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 44/161 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/161 constraints. Problems are: Problem set: 44 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/161 constraints. Problems are: Problem set: 44 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 161 constraints, problems are : Problem set: 44 solved, 44 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 44/88 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3735ms problems are : Problem set: 44 solved, 44 unsolved
Search for dead transitions found 44 dead transitions in 3735ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 88/124 places, 53/168 transitions.
Graph (complete) has 124 edges and 88 vertex of which 54 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 53 /88 variables (removed 35) and now considering 53/53 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/124 places, 53/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3769 ms. Remains : 53/124 places, 53/168 transitions.
Built C files in :
/tmp/ltsmin12194281162277839519
[2025-06-07 05:46:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12194281162277839519
Running compilation step : cd /tmp/ltsmin12194281162277839519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin12194281162277839519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12194281162277839519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1414284545765669763.hoa' '--buchi-type=spotba'
LTSmin run took 1689 ms.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N08-LTLCardinality-15 finished in 39085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F((F(p2)&&G(p1)))))'
[2025-06-07 05:46:05] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14948128267562952685
[2025-06-07 05:46:05] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2025-06-07 05:46:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:46:05] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2025-06-07 05:46:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:46:05] [INFO ] Applying decomposition
[2025-06-07 05:46:05] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2025-06-07 05:46:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:46:05] [INFO ] Flatten gal took : 9 ms
[2025-06-07 05:46:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14948128267562952685
Running compilation step : cd /tmp/ltsmin14948128267562952685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9596825920953350281.txt' '-o' '/tmp/graph9596825920953350281.bin' '-w' '/tmp/graph9596825920953350281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9596825920953350281.bin' '-l' '-1' '-v' '-w' '/tmp/graph9596825920953350281.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:46:05] [INFO ] Decomposing Gal with order
[2025-06-07 05:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:46:05] [INFO ] Removed a total of 130 redundant transitions.
[2025-06-07 05:46:05] [INFO ] Flatten gal took : 40 ms
[2025-06-07 05:46:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2025-06-07 05:46:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality15960642982563568108.gal : 2 ms
[2025-06-07 05:46:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality3613845557429415836.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15960642982563568108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3613845557429415836.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((("(((((gu1.DoSecuring_0_0+gu1.DoSecuring_0_1)+(gu1.DoSecuring_1_0+gu1.DoSecuring_1_1))+((gu1.DoSecuring_2_0+gu1.DoSecuring_2_1)+(g...2264
Formula 0 simplified : (!"(((((gu1.DoSecuring_0_0+gu1.DoSecuring_0_1)+(gu1.DoSecuring_1_0+gu1.DoSecuring_1_1))+((gu1.DoSecuring_2_0+gu1.DoSecuring_2_1)+(gu...2255
Compilation finished in 351 ms.
Running link step : cd /tmp/ltsmin14948128267562952685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14948128267562952685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true))&&<>((<>((LTLAPp2==true))&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Initializing POR dependencies: labels 187, guards 184
pins2lts-mc-linux64( 3/ 8), 0.155: LTL layer: formula: (((LTLAPp0==true) U (LTLAPp1==true))&&<>((<>((LTLAPp2==true))&&[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 3/ 8), 0.155: "(((LTLAPp0==true) U (LTLAPp1==true))&&<>((<>((LTLAPp2==true))&&[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.156: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.214: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.227: There are 188 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.227: State length is 141, there are 198 groups
pins2lts-mc-linux64( 0/ 8), 0.227: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.227: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.227: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.227: Visible groups: 0 / 198, labels: 3 / 188
pins2lts-mc-linux64( 0/ 8), 0.227: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.227: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.300: [Blue] ~28 levels ~960 states ~3488 transitions
pins2lts-mc-linux64( 6/ 8), 0.323: [Blue] ~28 levels ~1920 states ~4488 transitions
pins2lts-mc-linux64( 6/ 8), 0.372: [Blue] ~28 levels ~3840 states ~6720 transitions
pins2lts-mc-linux64( 6/ 8), 0.466: [Blue] ~28 levels ~7680 states ~11112 transitions
pins2lts-mc-linux64( 6/ 8), 0.726: [Blue] ~28 levels ~15360 states ~20680 transitions
pins2lts-mc-linux64( 6/ 8), 1.152: [Blue] ~28 levels ~30720 states ~40280 transitions
pins2lts-mc-linux64( 6/ 8), 2.003: [Blue] ~28 levels ~61440 states ~80376 transitions
pins2lts-mc-linux64( 6/ 8), 3.468: [Blue] ~28 levels ~122880 states ~161008 transitions
pins2lts-mc-linux64( 1/ 8), 6.424: [Blue] ~30085 levels ~245760 states ~1226776 transitions
pins2lts-mc-linux64( 1/ 8), 10.761: [Blue] ~60045 levels ~491520 states ~2437168 transitions
pins2lts-mc-linux64( 1/ 8), 19.107: [Blue] ~119690 levels ~983040 states ~4940816 transitions
pins2lts-mc-linux64( 1/ 8), 35.943: [Blue] ~238277 levels ~1966080 states ~10019112 transitions
pins2lts-mc-linux64( 1/ 8), 74.599: [Blue] ~473320 levels ~3932160 states ~20565176 transitions
pins2lts-mc-linux64( 1/ 8), 147.128: [Blue] ~939263 levels ~7864320 states ~42451056 transitions
pins2lts-mc-linux64( 1/ 8), 300.859: [Blue] ~1860711 levels ~15728640 states ~88126512 transitions
pins2lts-mc-linux64( 1/ 8), 618.616: [Blue] ~3684623 levels ~31457280 states ~183226384 transitions
pins2lts-mc-linux64( 2/ 8), 825.783: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 825.865:
pins2lts-mc-linux64( 0/ 8), 825.865: Explored 37107888 states 199568076 transitions, fanout: 5.378
pins2lts-mc-linux64( 0/ 8), 825.865: Total exploration time 825.620 sec (825.560 sec minimum, 825.576 sec on average)
pins2lts-mc-linux64( 0/ 8), 825.865: States per second: 44945, Transitions per second: 241719
pins2lts-mc-linux64( 0/ 8), 825.865:
pins2lts-mc-linux64( 0/ 8), 825.865: State space has 66436044 states, 7607380 are accepting
pins2lts-mc-linux64( 0/ 8), 825.865: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 825.865: blue states: 37107888 (55.86%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 825.865: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 825.865: all-red states: 7607380 (11.45%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 825.865:
pins2lts-mc-linux64( 0/ 8), 825.865: Total memory used for local state coloring: 414.0MB
pins2lts-mc-linux64( 0/ 8), 825.865:
pins2lts-mc-linux64( 0/ 8), 825.865: Queue width: 8B, total height: 27131334, memory: 207.00MB
pins2lts-mc-linux64( 0/ 8), 825.865: Tree memory: 762.9MB, 12.0 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 825.865: Tree fill ratio (roots/leafs): 49.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 825.865: Stored 185 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 825.865: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 825.865: Est. total memory use: 969.9MB (~1231.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14948128267562952685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true))&&<>((<>((LTLAPp2==true))&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14948128267562952685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true))&&<>((<>((LTLAPp2==true))&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-07 06:07:21] [INFO ] Flatten gal took : 9 ms
[2025-06-07 06:07:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality4435172384883943289.gal : 2 ms
[2025-06-07 06:07:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality18411254321919967335.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4435172384883943289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18411254321919967335.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((("(((((DoSecuring_0_0+DoSecuring_0_1)+(DoSecuring_1_0+DoSecuring_1_1))+((DoSecuring_2_0+DoSecuring_2_1)+(DoSecuring_3_0+DoSecuring...1800
Formula 0 simplified : (!"(((((DoSecuring_0_0+DoSecuring_0_1)+(DoSecuring_1_0+DoSecuring_1_1))+((DoSecuring_2_0+DoSecuring_2_1)+(DoSecuring_3_0+DoSecuring_...1791
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
69 unique states visited
19 strongly connected components in search stack
69 transitions explored
51 items max in DFS search stack
81553 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,815.557,4769148,1,0,321,2.41277e+07,26,99,2701,2.49142e+07,706
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N08-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2353128 ms.

BK_STOP 1749277289889

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z2T4N08, 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 r240-tall-174915590500827"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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