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 | 865333.00 | 0.00 | 0.00 | FFFFFFTFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590600892.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590600892
=====================================================================
--------------------
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-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749282393353
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-06-07 07:46:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 07:46:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 07:46:35] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-06-07 07:46:35] [INFO ] Transformed 302 places.
[2025-06-07 07:46:35] [INFO ] Transformed 600 transitions.
[2025-06-07 07:46:35] [INFO ] Parsed PT model containing 302 places and 600 transitions and 1928 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2025-06-07 07:46:35] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 143 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 208 transition count 378
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 208 transition count 378
Applied a total of 188 rules in 53 ms. Remains 208 /302 variables (removed 94) and now considering 378/472 (removed 94) transitions.
// Phase 1: matrix 378 rows 208 cols
[2025-06-07 07:46:35] [INFO ] Computed 19 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:35] [INFO ] Implicit Places using invariants in 280 ms returned [151]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 320 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 207/302 places, 378/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 396 ms. Remains : 207/302 places, 378/472 transitions.
Support contains 143 out of 207 places after structural reductions.
[2025-06-07 07:46:36] [INFO ] Flatten gal took : 137 ms
[2025-06-07 07:46:36] [INFO ] Flatten gal took : 44 ms
[2025-06-07 07:46:36] [INFO ] Input system was already deterministic with 378 transitions.
Reduction of identical properties reduced properties to check from 34 to 30
RANDOM walk for 7723 steps (0 resets) in 498 ms. (15 steps per ms) remains 0/30 properties
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X(X((X((X(G(p1))||p0))&&G(p2)))))'
Support contains 56 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 376
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Applied a total of 4 rules in 15 ms. Remains 205 /207 variables (removed 2) and now considering 376/378 (removed 2) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 07:46:37] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:37] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-07 07:46:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:46:37] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:46:37] [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 24372 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 30039 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 54825ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 54841ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 376/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55499 ms. Remains : 205/207 places, 376/378 transitions.
Stuttering acceptance computed with spot in 433 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-01
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-01 finished in 56014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 40 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 164 place count 125 transition count 296
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 196 place count 125 transition count 264
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 199 place count 122 transition count 168
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 121 transition count 168
Applied a total of 203 rules in 52 ms. Remains 121 /207 variables (removed 86) and now considering 168/378 (removed 210) transitions.
// Phase 1: matrix 168 rows 121 cols
[2025-06-07 07:47:33] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:47:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 07:47:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:47:33] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:47:33] [INFO ] Redundant transitions in 4 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-07 07:47:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/121 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 168/289 variables, 121/138 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 138 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5644 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 8/121 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 168/289 variables, 121/138 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 136/274 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 274 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6141 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11857ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 11858ms
Starting structural reductions in SI_LTL mode, iteration 1 : 121/207 places, 168/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12121 ms. Remains : 121/207 places, 168/378 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-02
Product exploration explored 100000 steps with 5480 reset in 460 ms.
Stack based approach found an accepted trace after 18618 steps with 1020 reset with depth 17 and stack size 17 in 69 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-02 finished in 12697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((X(X(X((X(X(F(p0)))||p2))))||p1)))))'
Support contains 77 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 376
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Applied a total of 4 rules in 6 ms. Remains 205 /207 variables (removed 2) and now considering 376/378 (removed 2) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 07:47:45] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:47:46] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-07 07:47:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:47:46] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:47: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 23353 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 30014 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 53605ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53607ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 376/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53843 ms. Remains : 205/207 places, 376/378 transitions.
Stuttering acceptance computed with spot in 1090 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-03
Product exploration explored 100000 steps with 4160 reset in 444 ms.
Product exploration explored 100000 steps with 4175 reset in 562 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 p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 25 states, 40 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 86 steps (0 resets) in 10 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2)]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
[2025-06-07 07:48:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:48:43] [INFO ] [Real]Absence check using 18 positive place invariants in 108 ms returned sat
[2025-06-07 07:48:44] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-06-07 07:48:44] [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:48:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 50 ms returned sat
[2025-06-07 07:48:45] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-06-07 07:48:45] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-07 07:48:46] [INFO ] Added : 280 causal constraints over 56 iterations in 1561 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 77 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 4 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2025-06-07 07:48:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:48:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 07:48:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:48:46] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:48: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 24033 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 30018 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 54217ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 54218ms
Finished structural reductions in LTL mode , in 1 iterations and 54410 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 : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 75 steps (0 resets) in 10 ms. (6 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (F p2)]
Knowledge based reduction with 1 factoid took 228 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
[2025-06-07 07:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:49:42] [INFO ] [Real]Absence check using 18 positive place invariants in 107 ms returned sat
[2025-06-07 07:49:43] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2025-06-07 07:49:43] [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:49:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 49 ms returned sat
[2025-06-07 07:49:43] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2025-06-07 07:49:43] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 21 ms.
[2025-06-07 07:49:45] [INFO ] Added : 280 causal constraints over 56 iterations in 1484 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4145 reset in 338 ms.
Product exploration explored 100000 steps with 4147 reset in 357 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 77 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 376
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 64 place count 205 transition count 344
Deduced a syphon composed of 32 places in 1 ms
Applied a total of 64 rules in 36 ms. Remains 205 /205 variables (removed 0) and now considering 344/376 (removed 32) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:49:47] [INFO ] Redundant transitions in 17 ms returned []
Running 336 sub problems to find dead transitions.
// Phase 1: matrix 344 rows 205 cols
[2025-06-07 07:49:47] [INFO ] Computed 18 invariants in 2 ms
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, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:49:51] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 8 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:49:51] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:49:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:49:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:49:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:49:51] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:49:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:49:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 8/26 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/26 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 344/549 variables, 205/231 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/231 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/549 variables, 0/231 constraints. Problems are: Problem set: 32 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 231 constraints, problems are : Problem set: 32 solved, 304 unsolved in 20494 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 40/205 variables, 18/18 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/26 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/26 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 344/549 variables, 205/231 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 304/535 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/535 constraints. Problems are: Problem set: 32 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 535 constraints, problems are : Problem set: 32 solved, 304 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 304/336 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50642ms problems are : Problem set: 32 solved, 304 unsolved
Search for dead transitions found 32 dead transitions in 50643ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 312/376 transitions.
Graph (complete) has 456 edges and 205 vertex of which 173 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 173 /205 variables (removed 32) and now considering 312/312 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 173/205 places, 312/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50718 ms. Remains : 173/205 places, 312/376 transitions.
Built C files in :
/tmp/ltsmin17852046221537159077
[2025-06-07 07:50:37] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17852046221537159077
Running compilation step : cd /tmp/ltsmin17852046221537159077;'/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 787 ms.
Running link step : cd /tmp/ltsmin17852046221537159077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin17852046221537159077;'/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/stateBased17541873115478399302.hoa' '--buchi-type=spotba'
LTSmin run took 1724 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-03 finished in 174524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p1) U (X(G(p2))&&F(p3)))&&p0)))'
Support contains 80 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 376
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Applied a total of 4 rules in 8 ms. Remains 205 /207 variables (removed 2) and now considering 376/378 (removed 2) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 07:50:40] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:50:40] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-07 07:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:50:40] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:50:40] [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 23669 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 30023 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 53870ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53872ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 376/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54234 ms. Remains : 205/207 places, 376/378 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p3), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-05
Product exploration explored 100000 steps with 7717 reset in 380 ms.
Product exploration explored 100000 steps with 7721 reset in 416 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 p0 p1 (NOT p3) (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p3))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p3), (NOT p1)]
RANDOM walk for 179 steps (0 resets) in 10 ms. (16 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p3))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 11 factoid took 219 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p3), (NOT p1)]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p3), (NOT p1)]
[2025-06-07 07:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:51:37] [INFO ] [Real]Absence check using 18 positive place invariants in 51 ms returned unsat
Proved EG (NOT p2)
[2025-06-07 07:51:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:51:37] [INFO ] [Real]Absence check using 18 positive place invariants in 67 ms returned sat
[2025-06-07 07:51:37] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2025-06-07 07:51: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:51:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2025-06-07 07:51:38] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2025-06-07 07:51:38] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 24 ms.
[2025-06-07 07:51:38] [INFO ] Added : 20 causal constraints over 4 iterations in 132 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p3))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p2))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 282 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-05 finished in 58071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((!p1&&X((!p1 U ((G(p2) U (p1 U p3))||G(!p1))))))))'
Support contains 93 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 376
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Applied a total of 4 rules in 6 ms. Remains 205 /207 variables (removed 2) and now considering 376/378 (removed 2) transitions.
[2025-06-07 07:51:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:51:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 07:51:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:51:38] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:51:38] [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 23938 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 30014 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 54107ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 54108ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 376/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54346 ms. Remains : 205/207 places, 376/378 transitions.
Stuttering acceptance computed with spot in 762 ms :[p1, p1, p1, true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-06
Product exploration explored 100000 steps with 23590 reset in 624 ms.
Product exploration explored 100000 steps with 23569 reset in 631 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 p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2)))))]
Knowledge based reduction with 21 factoid took 526 ms. Reduced automaton from 17 states, 66 edges and 4 AP (stutter sensitive) to 16 states, 59 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 721 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 2420 steps (0 resets) in 52 ms. (45 steps per ms) remains 0/31 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2))))), (F (NOT (OR (NOT p1) p3 p2))), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3 p2))), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p1) p3 (NOT p2)))), (F (NOT (AND (OR p0 p1 p3) (OR p0 p3 (NOT p2))))), (F (NOT (OR p0 p1 p3 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) p3 p2))), (F (NOT p0)), (F p3), (F (NOT (OR p3 (NOT p2)))), (F (NOT (OR p0 p1 p3 p2))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p3 (NOT p2)))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (OR (NOT p1) p3 (NOT p2)))), (F (NOT (OR p1 p3 (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (OR p0 p3 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p1) p3))), (F p1)]
Knowledge based reduction with 21 factoid took 1629 ms. Reduced automaton from 16 states, 59 edges and 4 AP (stutter sensitive) to 16 states, 59 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 712 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 721 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
Support contains 93 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 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2025-06-07 07:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:52:39] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 07:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:52:39] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:52:39] [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 23577 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 30028 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 53780ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53781ms
Finished structural reductions in LTL mode , in 1 iterations and 53992 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 : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2)))))]
Knowledge based reduction with 9 factoid took 371 ms. Reduced automaton from 16 states, 59 edges and 4 AP (stutter sensitive) to 16 states, 59 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 661 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 2295 steps (0 resets) in 56 ms. (40 steps per ms) remains 0/31 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2))))), (F (NOT (OR (NOT p1) p3 p2))), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3 p2))), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p1) p3 (NOT p2)))), (F (NOT (AND (OR p0 p1 p3) (OR p0 p3 (NOT p2))))), (F (NOT (OR p0 p1 p3 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) p3 p2))), (F (NOT p0)), (F p3), (F (NOT (OR p3 (NOT p2)))), (F (NOT (OR p0 p1 p3 p2))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) p2)))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p1) p3 (NOT p2)))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (OR (NOT p1) p3 (NOT p2)))), (F (NOT (OR p1 p3 (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (OR p0 p3 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p1) p3))), (F p1)]
Knowledge based reduction with 9 factoid took 1488 ms. Reduced automaton from 16 states, 59 edges and 4 AP (stutter sensitive) to 16 states, 59 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 698 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 710 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 769 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 23617 reset in 523 ms.
Product exploration explored 100000 steps with 23551 reset in 533 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 715 ms :[(AND p1 (NOT p3)), (AND p1 (NOT p3)), true, (AND p1 (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p2))]
Support contains 93 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 376
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 64 place count 205 transition count 344
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 64 rules in 28 ms. Remains 205 /205 variables (removed 0) and now considering 344/376 (removed 32) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:53:40] [INFO ] Redundant transitions in 4 ms returned []
Running 336 sub problems to find dead transitions.
// Phase 1: matrix 344 rows 205 cols
[2025-06-07 07:53:40] [INFO ] Computed 18 invariants in 4 ms
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, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:53:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:53:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:53:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:53:44] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:53:44] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:53:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:53:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:53:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 8/26 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/26 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 344/549 variables, 205/231 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/231 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/549 variables, 0/231 constraints. Problems are: Problem set: 32 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 231 constraints, problems are : Problem set: 32 solved, 304 unsolved in 20727 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 40/205 variables, 18/18 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/26 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/26 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 344/549 variables, 205/231 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 304/535 constraints. Problems are: Problem set: 32 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/535 constraints. Problems are: Problem set: 32 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 535 constraints, problems are : Problem set: 32 solved, 304 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 304/336 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50870ms problems are : Problem set: 32 solved, 304 unsolved
Search for dead transitions found 32 dead transitions in 50871ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 312/376 transitions.
Graph (complete) has 456 edges and 205 vertex of which 173 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 173 /205 variables (removed 32) and now considering 312/312 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 173/205 places, 312/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50919 ms. Remains : 173/205 places, 312/376 transitions.
Built C files in :
/tmp/ltsmin5449644958134385931
[2025-06-07 07:54:30] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5449644958134385931
Running compilation step : cd /tmp/ltsmin5449644958134385931;'/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 579 ms.
Running link step : cd /tmp/ltsmin5449644958134385931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5449644958134385931;'/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/stateBased11883530151932162772.hoa' '--buchi-type=spotba'
LTSmin run took 3367 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-06 finished in 176414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U X(p1))&&(!p0||G(!p1)))))'
Support contains 45 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 376
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Applied a total of 4 rules in 5 ms. Remains 205 /207 variables (removed 2) and now considering 376/378 (removed 2) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 07:54:34] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:54:35] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-07 07:54:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:54:35] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:54:35] [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 23396 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 30022 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 53605ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53606ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 376/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53841 ms. Remains : 205/207 places, 376/378 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-07 finished in 54001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (F(p1)||(p2&&X(p3)))))'
Support contains 6 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 376
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Applied a total of 4 rules in 6 ms. Remains 205 /207 variables (removed 2) and now considering 376/378 (removed 2) transitions.
[2025-06-07 07:55:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:55:29] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-07 07:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:55:29] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:55:29] [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 23930 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 30026 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 54142ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 54143ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 376/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54571 ms. Remains : 205/207 places, 376/378 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-08
Product exploration explored 100000 steps with 5544 reset in 231 ms.
Product exploration explored 100000 steps with 5648 reset in 243 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) p2 (NOT p0) (NOT p3)), (X p2), (X (AND (NOT p1) p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 684 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 1110 steps (0 resets) in 16 ms. (65 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0) (NOT p3)), (X p2), (X (AND (NOT p1) p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2 (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT p2)), (F p3), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 p3)))]
Knowledge based reduction with 17 factoid took 1160 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
[2025-06-07 07:56:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:56:26] [INFO ] [Real]Absence check using 18 positive place invariants in 22 ms returned sat
[2025-06-07 07:56:27] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2025-06-07 07:56:27] [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:56:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2025-06-07 07:56:27] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2025-06-07 07:56:28] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-07 07:56:29] [INFO ] Added : 280 causal constraints over 56 iterations in 1527 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 6 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 1 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2025-06-07 07:56:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:56:29] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-07 07:56:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:56:29] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:56:29] [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 23348 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
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30030 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 53606ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53607ms
Finished structural reductions in LTL mode , in 1 iterations and 54009 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 : [(AND (NOT p1) p2 (NOT p0) (NOT p3)), (X p2), (X (AND (NOT p1) p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 733 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 1122 steps (0 resets) in 17 ms. (62 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0) (NOT p3)), (X p2), (X (AND (NOT p1) p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 p1 p2 p3))), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT p2)), (F p3), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 p3)))]
Knowledge based reduction with 17 factoid took 1133 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
[2025-06-07 07:57:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 07:57:26] [INFO ] [Real]Absence check using 18 positive place invariants in 23 ms returned sat
[2025-06-07 07:57:26] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2025-06-07 07:57:26] [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:57:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 23 ms returned sat
[2025-06-07 07:57:27] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2025-06-07 07:57:27] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-07 07:57:29] [INFO ] Added : 280 causal constraints over 56 iterations in 1550 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 5555 reset in 263 ms.
Stack based approach found an accepted trace after 50444 steps with 2750 reset with depth 38 and stack size 38 in 138 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-08 finished in 120656 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)))&&(F(!p0)||X(p1))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 206 transition count 377
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 377
Applied a total of 2 rules in 4 ms. Remains 206 /207 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 206 cols
[2025-06-07 07:57:29] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:57:29] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-07 07:57:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:57:30] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 07:57:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 377/583 variables, 206/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 0/583 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 224 constraints, problems are : Problem set: 0 solved, 369 unsolved in 23601 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 377/583 variables, 206/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 369/593 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 593 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53804ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 53805ms
Starting structural reductions in LTL mode, iteration 1 : 206/207 places, 377/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54244 ms. Remains : 206/207 places, 377/378 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-09 finished in 54458 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 U p1)))||((X(G(p1)) U (p2 U p0)) U p1)))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 4 place count 205 transition count 347
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 62 place count 176 transition count 347
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 216 place count 99 transition count 270
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 245 place count 99 transition count 241
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 246 place count 98 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 98 transition count 209
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 255 place count 90 transition count 193
Iterating global reduction 3 with 8 rules applied. Total rules applied 263 place count 90 transition count 193
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 271 place count 82 transition count 169
Iterating global reduction 3 with 8 rules applied. Total rules applied 279 place count 82 transition count 169
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 287 place count 82 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 290 place count 82 transition count 158
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 292 place count 80 transition count 110
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 295 place count 79 transition count 110
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 311 place count 63 transition count 78
Iterating global reduction 4 with 16 rules applied. Total rules applied 327 place count 63 transition count 78
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 340 place count 50 transition count 65
Iterating global reduction 4 with 13 rules applied. Total rules applied 353 place count 50 transition count 65
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 366 place count 50 transition count 52
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 5 with 12 rules applied. Total rules applied 378 place count 44 transition count 46
Applied a total of 378 rules in 37 ms. Remains 44 /207 variables (removed 163) and now considering 46/378 (removed 332) transitions.
// Phase 1: matrix 46 rows 44 cols
[2025-06-07 07:58:24] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:58:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-07 07:58:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:58:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:58:24] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2025-06-07 07:58:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 46/90 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/90 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 61 constraints, problems are : Problem set: 0 solved, 29 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 46/90 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 90 constraints, problems are : Problem set: 0 solved, 29 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1004ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 1005ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/207 places, 46/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1131 ms. Remains : 44/207 places, 46/378 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-10
Product exploration explored 100000 steps with 90 reset in 197 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-10 finished in 1628 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))&&(p1 U (G(p1)||(p1&&G(!p2))))))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 4 place count 205 transition count 345
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 66 place count 174 transition count 345
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 190 place count 112 transition count 283
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 221 place count 112 transition count 252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 222 place count 111 transition count 220
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 111 transition count 220
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 231 place count 103 transition count 204
Iterating global reduction 3 with 8 rules applied. Total rules applied 239 place count 103 transition count 204
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 247 place count 95 transition count 180
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 95 transition count 180
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 263 place count 95 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 94 transition count 171
Applied a total of 265 rules in 27 ms. Remains 94 /207 variables (removed 113) and now considering 171/378 (removed 207) transitions.
// Phase 1: matrix 171 rows 94 cols
[2025-06-07 07:58:25] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:58:25] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-07 07:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:58:25] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:58:25] [INFO ] Redundant transitions in 1 ms returned []
Running 146 sub problems to find dead transitions.
[2025-06-07 07:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 8/94 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 171/265 variables, 94/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 112 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4362 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 8/94 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 171/265 variables, 94/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 146/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 258 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7369 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11771ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 11771ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/207 places, 171/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11955 ms. Remains : 94/207 places, 171/378 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) p2), p2]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 894 steps with 1 reset in 8 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-11 finished in 12244 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)||G(F(p1)))))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 4 place count 205 transition count 344
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 68 place count 173 transition count 344
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 176 place count 119 transition count 290
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 208 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 209 place count 118 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 118 transition count 226
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 218 place count 110 transition count 210
Iterating global reduction 3 with 8 rules applied. Total rules applied 226 place count 110 transition count 210
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 232 place count 104 transition count 192
Iterating global reduction 3 with 6 rules applied. Total rules applied 238 place count 104 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 244 place count 104 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 248 place count 102 transition count 184
Applied a total of 248 rules in 22 ms. Remains 102 /207 variables (removed 105) and now considering 184/378 (removed 194) transitions.
// Phase 1: matrix 184 rows 102 cols
[2025-06-07 07:58:37] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:58:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 07:58:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:58:38] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:58:38] [INFO ] Redundant transitions in 0 ms returned []
Running 156 sub problems to find dead transitions.
[2025-06-07 07:58:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 8/102 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 184/286 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 120 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5181 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 8/102 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 184/286 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 156/276 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 276 constraints, problems are : Problem set: 0 solved, 156 unsolved in 8395 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13630ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 13631ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/207 places, 184/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13812 ms. Remains : 102/207 places, 184/378 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-12
Product exploration explored 100000 steps with 231 reset in 278 ms.
Product exploration explored 100000 steps with 225 reset in 278 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 p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 478 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1517 steps (0 resets) in 19 ms. (75 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 592 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 184/184 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2025-06-07 07:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:58:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-07 07:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:58:53] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:58:53] [INFO ] Redundant transitions in 0 ms returned []
Running 156 sub problems to find dead transitions.
[2025-06-07 07:58:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 8/102 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 184/286 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 120 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5117 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 8/102 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 184/286 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 156/276 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 276 constraints, problems are : Problem set: 0 solved, 156 unsolved in 8077 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13243ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 13244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13424 ms. Remains : 102/102 places, 184/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 504 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1765 steps (0 resets) in 27 ms. (63 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 634 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 247 reset in 262 ms.
Stack based approach found an accepted trace after 3281 steps with 9 reset with depth 322 and stack size 322 in 9 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-12 finished in 31106 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||G(p1))))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 4 place count 205 transition count 345
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 66 place count 174 transition count 345
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 222 place count 96 transition count 267
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 253 place count 96 transition count 236
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 94 transition count 172
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 94 transition count 172
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 273 place count 78 transition count 140
Iterating global reduction 3 with 16 rules applied. Total rules applied 289 place count 78 transition count 140
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 305 place count 62 transition count 108
Iterating global reduction 3 with 16 rules applied. Total rules applied 321 place count 62 transition count 108
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 337 place count 62 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 338 place count 62 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 339 place count 61 transition count 75
Ensure Unique test removed 1 places
Iterating global reduction 4 with 2 rules applied. Total rules applied 341 place count 60 transition count 75
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 349 place count 52 transition count 59
Iterating global reduction 4 with 8 rules applied. Total rules applied 357 place count 52 transition count 59
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 364 place count 45 transition count 52
Iterating global reduction 4 with 7 rules applied. Total rules applied 371 place count 45 transition count 52
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 378 place count 45 transition count 45
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 5 with 12 rules applied. Total rules applied 390 place count 39 transition count 39
Applied a total of 390 rules in 26 ms. Remains 39 /207 variables (removed 168) and now considering 39/378 (removed 339) transitions.
// Phase 1: matrix 39 rows 39 cols
[2025-06-07 07:59:09] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:59:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-07 07:59:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:59:09] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:59:09] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-07 07:59:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 39/78 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 8/39 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 39/78 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 24/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 80 constraints, problems are : Problem set: 0 solved, 24 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 702ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/207 places, 39/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 807 ms. Remains : 39/207 places, 39/378 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-13
Product exploration explored 100000 steps with 7907 reset in 169 ms.
Stack based approach found an accepted trace after 2823 steps with 246 reset with depth 10 and stack size 10 in 5 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-13 finished in 1044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))&&X(G((G(p0)||p2)))))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 376
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 376
Applied a total of 4 rules in 5 ms. Remains 205 /207 variables (removed 2) and now considering 376/378 (removed 2) transitions.
// Phase 1: matrix 376 rows 205 cols
[2025-06-07 07:59:10] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:59:10] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-07 07:59:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:59:10] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 07:59:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 23238 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30021 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 53433ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53434ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 376/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53842 ms. Remains : 205/207 places, 376/378 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-14
Entered a terminal (fully accepting) state of product in 915 steps with 0 reset in 7 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-14 finished in 54044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 378/378 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 206 transition count 377
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 377
Applied a total of 2 rules in 4 ms. Remains 206 /207 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 206 cols
[2025-06-07 08:00:04] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:00:04] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-06-07 08:00:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 08:00:04] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 08:00: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/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 377/583 variables, 206/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 0/583 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 224 constraints, problems are : Problem set: 0 solved, 369 unsolved in 23684 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 377/583 variables, 206/224 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 369/593 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 593 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53940ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 53941ms
Starting structural reductions in LTL mode, iteration 1 : 206/207 places, 377/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54423 ms. Remains : 206/207 places, 377/378 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-15 finished in 54538 ms.
All properties solved by simple procedures.
Total runtime 863787 ms.
BK_STOP 1749283258686
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T4N08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z4T4N08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-tall-174915590600892"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;