About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T4N08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 223975.00 | 0.00 | 0.00 | TFFTFFFFFFTFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590600891.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-Z4T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590600891
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 50K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 243K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 120K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 435K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 26K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 122K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 454K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K 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 255K 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-Z4T4N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749282242201
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-Z4T4N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 07:44:03] [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 07:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 07:44:03] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-06-07 07:44:03] [INFO ] Transformed 302 places.
[2025-06-07 07:44:03] [INFO ] Transformed 600 transitions.
[2025-06-07 07:44:03] [INFO ] Parsed PT model containing 302 places and 600 transitions and 1928 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 264 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 12 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2025-06-07 07:44:04] [INFO ] Computed 19 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:44:04] [INFO ] Implicit Places using invariants in 326 ms returned []
[2025-06-07 07:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:44:04] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 07:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 774/774 variables, and 321 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 464/785 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/774 variables, and 785 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Finished structural reductions in LTL mode , in 1 iterations and 61156 ms. Remains : 302/302 places, 472/472 transitions.
Support contains 264 out of 302 places after structural reductions.
[2025-06-07 07:45:05] [INFO ] Flatten gal took : 59 ms
[2025-06-07 07:45:05] [INFO ] Flatten gal took : 29 ms
[2025-06-07 07:45:05] [INFO ] Input system was already deterministic with 472 transitions.
RANDOM walk for 40000 steps (8 resets) in 1443 ms. (27 steps per ms) remains 6/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
[2025-06-07 07:45:06] [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 AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Real declared 260/774 variables, and 7 constraints, problems are : Problem set: 6 solved, 0 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 7/19 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-12 FALSE 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' '!((F(p0)&&F(p1)))'
Support contains 164 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
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 0 with 32 rules applied. Total rules applied 32 place count 286 transition count 456
Applied a total of 32 rules in 33 ms. Remains 286 /302 variables (removed 16) and now considering 456/472 (removed 16) transitions.
// Phase 1: matrix 456 rows 286 cols
[2025-06-07 07:45:06] [INFO ] Computed 19 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:45:07] [INFO ] Implicit Places using invariants in 528 ms returned [236, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 531 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/302 places, 456/472 transitions.
Applied a total of 0 rules in 17 ms. Remains 284 /284 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 581 ms. Remains : 284/302 places, 456/472 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-01
Product exploration explored 100000 steps with 16725 reset in 559 ms.
Product exploration explored 100000 steps with 16704 reset in 464 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), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 240 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 15 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 9 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 456 rows 284 cols
[2025-06-07 07:45:09] [INFO ] Computed 17 invariants in 8 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:45:09] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned sat
[2025-06-07 07:45:10] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2025-06-07 07:45: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 07:45:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2025-06-07 07:45:11] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2025-06-07 07:45:11] [INFO ] Computed and/alt/rep : 424/768/424 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-07 07:45:14] [INFO ] Added : 391 causal constraints over 79 iterations in 2826 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 128 out of 284 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 456/456 transitions.
Applied a total of 0 rules in 14 ms. Remains 284 /284 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2025-06-07 07:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:45:14] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-07 07:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:45:14] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:45:14] [INFO ] Redundant transitions in 36 ms returned []
Running 424 sub problems to find dead transitions.
[2025-06-07 07:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/740 variables, 284/301 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/740 variables, and 301 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 8/284 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 456/740 variables, 284/301 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 424/725 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/740 variables, and 725 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60512 ms. Remains : 284/284 places, 456/456 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 p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 23 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
[2025-06-07 07:46:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:46:15] [INFO ] [Real]Absence check using 17 positive place invariants in 62 ms returned sat
[2025-06-07 07:46:16] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2025-06-07 07:46:16] [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 07:46:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 46 ms returned sat
[2025-06-07 07:46:17] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2025-06-07 07:46:17] [INFO ] Computed and/alt/rep : 424/768/424 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-07 07:46:19] [INFO ] Added : 322 causal constraints over 65 iterations in 2111 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16668 reset in 422 ms.
Product exploration explored 100000 steps with 16700 reset in 465 ms.
Built C files in :
/tmp/ltsmin15760517541607515469
[2025-06-07 07:46:20] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2025-06-07 07:46:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 07:46:20] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2025-06-07 07:46:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 07:46:20] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2025-06-07 07:46:20] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 07:46:20] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15760517541607515469
Running compilation step : cd /tmp/ltsmin15760517541607515469;'/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 1052 ms.
Running link step : cd /tmp/ltsmin15760517541607515469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin15760517541607515469;'/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/stateBased5424720402570726802.hoa' '--buchi-type=spotba'
LTSmin run took 1808 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-01 finished in 76606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 9 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 115 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 115 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 91 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 91 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 67 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 67 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 67 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 67 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 59 transition count 56
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 559 place count 50 transition count 48
Applied a total of 559 rules in 45 ms. Remains 50 /302 variables (removed 252) and now considering 48/472 (removed 424) transitions.
// Phase 1: matrix 48 rows 50 cols
[2025-06-07 07:46:23] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:23] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 07:46:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:23] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:46:23] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-07 07:46:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 8/50 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 48/98 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 68 constraints, problems are : Problem set: 0 solved, 40 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 8/50 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 48/98 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 40/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 108 constraints, problems are : Problem set: 0 solved, 40 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1442ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/302 places, 48/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1584 ms. Remains : 50/302 places, 48/472 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-02
Product exploration explored 100000 steps with 86 reset in 244 ms.
Stack based approach found an accepted trace after 230 steps with 1 reset with depth 226 and stack size 226 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-02 finished in 1946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0))&&F(p1)) U X(p2))))'
Support contains 197 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2025-06-07 07:46:25] [INFO ] Computed 19 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:25] [INFO ] Implicit Places using invariants in 158 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 318 ms.
Product exploration explored 100000 steps with 33333 reset in 319 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 p1 p2 p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-03 finished in 1139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1))) U (p2&&(F(G(p3)) U p4))))'
Support contains 185 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
[2025-06-07 07:46:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:26] [INFO ] Implicit Places using invariants in 378 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 1 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 385 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p2) (NOT p4)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p4), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-04
Product exploration explored 100000 steps with 4588 reset in 497 ms.
Product exploration explored 100000 steps with 4773 reset in 515 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 p2) (NOT p0) (NOT p4) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p3) p0))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p3 p0))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p4) p0)))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p0)))), (X (AND (NOT p4) (NOT p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p4)))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p4) (NOT p3)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p4) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p4) (NOT p0)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p4) p3)))), (X (NOT p0)), (X p1), (X (AND (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p4) p0))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p0))))), (X (X (AND (NOT p4) (NOT p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p4) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p4) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p4) p3))))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 50 factoid took 349 ms. Reduced automaton from 7 states, 27 edges and 5 AP (stutter sensitive) to 7 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p2) (NOT p4)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p4), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 549 ms. (72 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
// Phase 1: matrix 472 rows 301 cols
[2025-06-07 07:46:29] [INFO ] Computed 18 invariants in 3 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/301 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/773 variables, 301/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/773 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 773/773 variables, and 319 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 301/773 variables, and 18 constraints, problems are : Problem set: 1 solved, 0 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p4) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p3) p0))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p3 p0))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p4) p0)))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p0)))), (X (AND (NOT p4) (NOT p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p4)))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p4) (NOT p3)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p4) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p4) (NOT p0)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p4) p3)))), (X (NOT p0)), (X p1), (X (AND (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p4) p0))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p0))))), (X (X (AND (NOT p4) (NOT p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p4) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p4) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p4) p3))))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p0)))), (G (OR (NOT p0) p3 p1))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2) p4))), (F p1), (F (NOT (OR (NOT p0) p3))), (F p0), (F (NOT (OR (NOT p0) (NOT p3) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR p4 (NOT p3))))), (F p3), (F (NOT (AND (NOT p0) (NOT p3)))), (F p4), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p4)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p4)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))))), (F (NOT (OR (NOT p0) p4))), (F (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p4) (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p4))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR (NOT p2) p4)))]
Knowledge based reduction with 51 factoid took 1316 ms. Reduced automaton from 7 states, 27 edges and 5 AP (stutter sensitive) to 7 states, 26 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) (NOT p4)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p4), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p2) (NOT p4)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p4), (AND (NOT p1) (NOT p3))]
[2025-06-07 07:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:46:31] [INFO ] [Real]Absence check using 18 positive place invariants in 201 ms returned sat
[2025-06-07 07:46:37] [INFO ] [Real]Absence check using state equation in 5701 ms returned sat
[2025-06-07 07:46:37] [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 07:46:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 95 ms returned sat
[2025-06-07 07:46:39] [INFO ] [Nat]Absence check using state equation in 1980 ms returned sat
[2025-06-07 07:46:39] [INFO ] Computed and/alt/rep : 464/712/464 causal constraints (skipped 0 transitions) in 25 ms.
[2025-06-07 07:46:39] [INFO ] Added : 11 causal constraints over 3 iterations in 208 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-07 07:46:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p4)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p4) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p3) p0))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p3 p0))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p4) p0)))), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p0)))), (X (AND (NOT p4) (NOT p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p4)))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p4) (NOT p3)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p4) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND p2 (NOT p4) (NOT p0)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p4) p3)))), (X (NOT p0)), (X p1), (X (AND (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p4) p0))))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p0))))), (X (X (AND (NOT p4) (NOT p0)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p4) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p4) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p4) p3))))), (X (X (NOT p0))), (X (X (AND (NOT p3) (NOT p0)))), (G (OR (NOT p0) p3 p1))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2) p4))), (F p1), (F (NOT (OR (NOT p0) p3))), (F p0), (F (NOT (OR (NOT p0) (NOT p3) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR p4 (NOT p3))))), (F p3), (F (NOT (AND (NOT p0) (NOT p3)))), (F p4), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p4)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p4)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))))), (F (NOT (OR (NOT p0) p4))), (F (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p4) (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p4))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR (NOT p2) p4))), (G (NOT p4))]
Property proved to be false thanks to negative knowledge :(G (NOT p4))
Knowledge based reduction with 51 factoid took 1489 ms. Reduced automaton from 7 states, 26 edges and 5 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-04 finished in 15237 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&&G(p1)) U X(G(p2))) U X(X(!p0))))'
Support contains 184 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2025-06-07 07:46:41] [INFO ] Computed 19 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:41] [INFO ] Implicit Places using invariants in 307 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 308 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 1 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 314 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 638 ms :[(OR (NOT p2) p0), p0, p0, p0, p0, true, p0, p0, p0, p0, (OR (NOT p2) p0), (OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1) p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-05 finished in 984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 115 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 115 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 91 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 91 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 67 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 67 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 67 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 67 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 59 transition count 56
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 3 with 16 rules applied. Total rules applied 558 place count 51 transition count 48
Applied a total of 558 rules in 36 ms. Remains 51 /302 variables (removed 251) and now considering 48/472 (removed 424) transitions.
// Phase 1: matrix 48 rows 51 cols
[2025-06-07 07:46:42] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:42] [INFO ] Implicit Places using invariants in 45 ms returned [0, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/302 places, 48/472 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 49 transition count 40
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 41 transition count 40
Applied a total of 16 rules in 3 ms. Remains 41 /49 variables (removed 8) and now considering 40/48 (removed 8) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-07 07:46:42] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 07:46:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:42] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/302 places, 40/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 41/302 places, 40/472 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 162 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-07 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' '!(((p0&&X(p1)) U X(G(!p1))))'
Support contains 3 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 9 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2025-06-07 07:46:42] [INFO ] Computed 19 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:43] [INFO ] Implicit Places using invariants in 248 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, p1, p1, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-08 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(X(X(X(G(p1)))))))))'
Support contains 3 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 10 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2025-06-07 07:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:43] [INFO ] Implicit Places using invariants in 237 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 254 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-09 finished in 581 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 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 115 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 115 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 91 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 91 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 67 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 67 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 67 transition count 64
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 526 place count 67 transition count 57
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 540 place count 60 transition count 57
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 557 place count 51 transition count 49
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 571 place count 44 transition count 42
Applied a total of 571 rules in 20 ms. Remains 44 /302 variables (removed 258) and now considering 42/472 (removed 430) transitions.
// Phase 1: matrix 42 rows 44 cols
[2025-06-07 07:46:43] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:43] [INFO ] Implicit Places using invariants in 37 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/302 places, 42/472 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 35 transition count 34
Applied a total of 16 rules in 2 ms. Remains 35 /43 variables (removed 8) and now considering 34/42 (removed 8) transitions.
// Phase 1: matrix 34 rows 35 cols
[2025-06-07 07:46:43] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-07 07:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:44] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/302 places, 34/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 123 ms. Remains : 35/302 places, 34/472 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 188 ms.
Stack based approach found an accepted trace after 123 steps with 0 reset with depth 124 and stack size 120 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-13 finished in 353 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 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 302 transition count 348
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 155 rules applied. Total rules applied 279 place count 178 transition count 317
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 279 place count 178 transition count 286
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 341 place count 147 transition count 286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 344 place count 144 transition count 283
Iterating global reduction 2 with 3 rules applied. Total rules applied 347 place count 144 transition count 283
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 349 place count 142 transition count 219
Iterating global reduction 2 with 2 rules applied. Total rules applied 351 place count 142 transition count 219
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 366 place count 127 transition count 204
Iterating global reduction 2 with 15 rules applied. Total rules applied 381 place count 127 transition count 204
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 396 place count 112 transition count 174
Iterating global reduction 2 with 15 rules applied. Total rules applied 411 place count 112 transition count 174
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 426 place count 97 transition count 144
Iterating global reduction 2 with 15 rules applied. Total rules applied 441 place count 97 transition count 144
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 456 place count 97 transition count 129
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 3 with 32 rules applied. Total rules applied 488 place count 81 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 489 place count 81 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 490 place count 80 transition count 95
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 492 place count 79 transition count 95
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 500 place count 71 transition count 87
Iterating global reduction 3 with 8 rules applied. Total rules applied 508 place count 71 transition count 87
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 516 place count 63 transition count 71
Iterating global reduction 3 with 8 rules applied. Total rules applied 524 place count 63 transition count 71
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 531 place count 56 transition count 64
Iterating global reduction 3 with 7 rules applied. Total rules applied 538 place count 56 transition count 64
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 545 place count 56 transition count 57
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 557 place count 50 transition count 51
Applied a total of 557 rules in 25 ms. Remains 50 /302 variables (removed 252) and now considering 51/472 (removed 421) transitions.
// Phase 1: matrix 51 rows 50 cols
[2025-06-07 07:46:44] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:44] [INFO ] Implicit Places using invariants in 38 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/302 places, 51/472 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 41 transition count 43
Applied a total of 16 rules in 2 ms. Remains 41 /49 variables (removed 8) and now considering 43/51 (removed 8) transitions.
// Phase 1: matrix 43 rows 41 cols
[2025-06-07 07:46:44] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:44] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 07:46:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/302 places, 43/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 41/302 places, 43/472 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 183 ms.
Stack based approach found an accepted trace after 349 steps with 0 reset with depth 350 and stack size 339 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-14 finished in 363 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(F(p0)))))'
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 5 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2025-06-07 07:46:44] [INFO ] Computed 19 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:44] [INFO ] Implicit Places using invariants in 225 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 227 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLCardinality-15
Product exploration explored 100000 steps with 25000 reset in 225 ms.
Product exploration explored 100000 steps with 25000 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2309 steps (0 resets) in 20 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 07:46:46] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:46] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-07 07:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:46] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 23417 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53633ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53635ms
Finished structural reductions in LTL mode , in 1 iterations and 54069 ms. Remains : 205/205 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 600 steps (0 resets) in 8 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 191 ms.
Product exploration explored 100000 steps with 25000 reset in 190 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 408
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 408
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 0 with 66 rules applied. Total rules applied 98 place count 205 transition count 432
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 130 place count 205 transition count 400
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 202 transition count 304
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 202 transition count 304
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 196 place count 142 transition count 206
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 256 place count 142 transition count 206
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 300 place count 98 transition count 156
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 344 place count 98 transition count 156
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 382 place count 98 transition count 118
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 388 place count 92 transition count 112
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 394 place count 92 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 400 place count 92 transition count 106
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 400 rules in 44 ms. Remains 92 /205 variables (removed 113) and now considering 106/376 (removed 270) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:47:41] [INFO ] Redundant transitions in 1 ms returned []
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 106 rows 92 cols
[2025-06-07 07:47:41] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 8/92 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:47:42] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:47:42] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:47:42] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:47:42] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:47:42] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:47:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:47:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:47:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 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 TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 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
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 8/26 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/26 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 106/198 variables, 92/118 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/118 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/118 constraints. Problems are: Problem set: 47 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 118 constraints, problems are : Problem set: 47 solved, 49 unsolved in 1982 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 43/92 variables, 18/18 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 8/26 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/26 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 106/198 variables, 92/118 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 49/167 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/167 constraints. Problems are: Problem set: 47 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/167 constraints. Problems are: Problem set: 47 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 167 constraints, problems are : Problem set: 47 solved, 49 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 49/96 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3565ms problems are : Problem set: 47 solved, 49 unsolved
Search for dead transitions found 47 dead transitions in 3566ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 92/205 places, 59/376 transitions.
Graph (complete) has 129 edges and 92 vertex of which 57 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 57 /92 variables (removed 35) and now considering 59/59 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/205 places, 59/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3629 ms. Remains : 57/205 places, 59/376 transitions.
Built C files in :
/tmp/ltsmin2434573104985927771
[2025-06-07 07:47:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2434573104985927771
Running compilation step : cd /tmp/ltsmin2434573104985927771;'/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 545 ms.
Running link step : cd /tmp/ltsmin2434573104985927771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2434573104985927771;'/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/stateBased93010053410220873.hoa' '--buchi-type=spotba'
LTSmin run took 145 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLCardinality-15 finished in 61527 ms.
All properties solved by simple procedures.
Total runtime 222495 ms.
BK_STOP 1749282466176
--------------------
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-Z4T4N08"
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-Z4T4N08, 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-174915590600891"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T4N08.tgz
mv UtilityControlRoom-PT-Z4T4N08 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 '
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 ;