Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 71K 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 SmartHome-PT-11-LTLFireability-00
FORMULA_NAME SmartHome-PT-11-LTLFireability-01
FORMULA_NAME SmartHome-PT-11-LTLFireability-02
FORMULA_NAME SmartHome-PT-11-LTLFireability-03
FORMULA_NAME SmartHome-PT-11-LTLFireability-04
FORMULA_NAME SmartHome-PT-11-LTLFireability-05
FORMULA_NAME SmartHome-PT-11-LTLFireability-06
FORMULA_NAME SmartHome-PT-11-LTLFireability-07
FORMULA_NAME SmartHome-PT-11-LTLFireability-08
FORMULA_NAME SmartHome-PT-11-LTLFireability-09
FORMULA_NAME SmartHome-PT-11-LTLFireability-10
FORMULA_NAME SmartHome-PT-11-LTLFireability-11
FORMULA_NAME SmartHome-PT-11-LTLFireability-12
FORMULA_NAME SmartHome-PT-11-LTLFireability-13
FORMULA_NAME SmartHome-PT-11-LTLFireability-14
FORMULA_NAME SmartHome-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749249055871

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 22:30:57] [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-06 22:30:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:30:57] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2025-06-06 22:30:57] [INFO ] Transformed 290 places.
[2025-06-06 22:30:57] [INFO ] Transformed 315 transitions.
[2025-06-06 22:30:57] [INFO ] Found NUPN structural information;
[2025-06-06 22:30:57] [INFO ] Parsed PT model containing 290 places and 315 transitions and 722 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 55 transitions.
FORMULA SmartHome-PT-11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 260/260 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 215 transition count 260
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 61 place count 163 transition count 208
Iterating global reduction 1 with 52 rules applied. Total rules applied 113 place count 163 transition count 208
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 118 place count 163 transition count 203
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 127 place count 154 transition count 194
Iterating global reduction 2 with 9 rules applied. Total rules applied 136 place count 154 transition count 194
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 145 place count 145 transition count 185
Iterating global reduction 2 with 9 rules applied. Total rules applied 154 place count 145 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 145 transition count 184
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 143 transition count 182
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 143 transition count 182
Applied a total of 159 rules in 72 ms. Remains 143 /224 variables (removed 81) and now considering 182/260 (removed 78) transitions.
// Phase 1: matrix 182 rows 143 cols
[2025-06-06 22:30:57] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:30:57] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-06 22:30:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:30:57] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-06 22:30:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/325 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 0/325 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 146 constraints, problems are : Problem set: 0 solved, 181 unsolved in 7728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/325 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 181/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:31:08] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:31:08] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 329 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11398 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 19182ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 19197ms
Starting structural reductions in LTL mode, iteration 1 : 143/224 places, 182/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19709 ms. Remains : 143/224 places, 182/260 transitions.
Support contains 16 out of 143 places after structural reductions.
[2025-06-06 22:31:17] [INFO ] Flatten gal took : 42 ms
[2025-06-06 22:31:17] [INFO ] Flatten gal took : 26 ms
[2025-06-06 22:31:17] [INFO ] Input system was already deterministic with 182 transitions.
RANDOM walk for 14405 steps (95 resets) in 201 ms. (71 steps per ms) remains 0/17 properties
Computed a total of 35 stabilizing places and 34 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(p1))) U (X(X(p2))&&F(!p0))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 135 transition count 174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 135 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 135 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 130 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 130 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 126 transition count 164
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 126 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 124 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 124 transition count 162
Applied a total of 39 rules in 14 ms. Remains 124 /143 variables (removed 19) and now considering 162/182 (removed 20) transitions.
// Phase 1: matrix 162 rows 124 cols
[2025-06-06 22:31:17] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:31:17] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-06 22:31:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:31:18] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 22:31:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 127 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 161/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:31:25] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/286 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 289 constraints, problems are : Problem set: 0 solved, 161 unsolved in 7750 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13169ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 13171ms
Starting structural reductions in LTL mode, iteration 1 : 124/143 places, 162/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13479 ms. Remains : 124/143 places, 162/182 transitions.
Stuttering acceptance computed with spot in 647 ms :[(OR (NOT p2) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), p0, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-02
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 5 ms.
FORMULA SmartHome-PT-11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-02 finished in 14213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X((p0 U X(G(p1))))))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 134 transition count 173
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 134 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 134 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 129 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 129 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 126 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 126 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 124 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 124 transition count 162
Applied a total of 39 rules in 11 ms. Remains 124 /143 variables (removed 19) and now considering 162/182 (removed 20) transitions.
// Phase 1: matrix 162 rows 124 cols
[2025-06-06 22:31:31] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:31:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-06 22:31:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:31:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 22:31:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 127 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5332 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 161/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:31:39] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/286 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 289 constraints, problems are : Problem set: 0 solved, 161 unsolved in 7978 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13331ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 13331ms
Starting structural reductions in LTL mode, iteration 1 : 124/143 places, 162/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13488 ms. Remains : 124/143 places, 162/182 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-08 finished in 13729 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((X((p0||X(X(X(p1)))))||F(p2))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 135 transition count 174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 135 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 135 transition count 173
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 131 transition count 169
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 131 transition count 169
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 129 transition count 167
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 129 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 128 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 128 transition count 166
Applied a total of 31 rules in 11 ms. Remains 128 /143 variables (removed 15) and now considering 166/182 (removed 16) transitions.
// Phase 1: matrix 166 rows 128 cols
[2025-06-06 22:31:45] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:31:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 22:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:31:45] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 22:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/294 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 131 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/294 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 165/296 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:31:53] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 297 constraints, problems are : Problem set: 0 solved, 165 unsolved in 8598 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14163ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 14164ms
Starting structural reductions in LTL mode, iteration 1 : 128/143 places, 166/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14311 ms. Remains : 128/143 places, 166/182 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-09
Product exploration explored 100000 steps with 849 reset in 285 ms.
Product exploration explored 100000 steps with 857 reset in 140 ms.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 22218 steps (161 resets) in 134 ms. (164 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 166/166 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 166/166 (removed 0) transitions.
[2025-06-06 22:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:32:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 22:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:32:01] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 22:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/294 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 131 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/294 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 165/296 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:32:09] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 297 constraints, problems are : Problem set: 0 solved, 165 unsolved in 8532 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14078ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 14079ms
Finished structural reductions in LTL mode , in 1 iterations and 14192 ms. Remains : 128/128 places, 166/166 transitions.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 29440 steps (211 resets) in 67 ms. (432 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 837 reset in 103 ms.
Product exploration explored 100000 steps with 816 reset in 160 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 166/166 transitions.
Graph (trivial) has 120 edges and 128 vertex of which 56 / 128 are part of one of the 6 SCC in 4 ms
Free SCC test removed 50 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 78 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 78 transition count 96
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 25 place count 78 transition count 96
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 78 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 39 place count 67 transition count 85
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 50 place count 67 transition count 85
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 67 transition count 83
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 87 place count 53 transition count 69
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 14 rules applied. Total rules applied 101 place count 53 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 53 transition count 69
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 51 transition count 67
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 51 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 51 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 50 transition count 67
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 50 transition count 67
Deduced a syphon composed of 23 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 119 place count 50 transition count 57
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 114 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 121 place count 48 transition count 56
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 121 rules in 44 ms. Remains 48 /128 variables (removed 80) and now considering 56/166 (removed 110) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:32:17] [INFO ] Redundant transitions in 24 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-06 22:32:17] [INFO ] Flow matrix only has 51 transitions (discarded 5 similar events)
// Phase 1: matrix 51 rows 48 cols
[2025-06-06 22:32:17] [INFO ] Computed 2 invariants in 1 ms
[2025-06-06 22:32:17] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:32:18] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 6 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 53 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
At refinement iteration 5 (OVERLAPS) 50/98 variables, 48/51 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 14/65 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/65 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 1/99 variables, 1/66 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/66 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/66 constraints. Problems are: Problem set: 23 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 66 constraints, problems are : Problem set: 23 solved, 32 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 3/28 variables, 1/1 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/2 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/29 variables, 1/3 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 50/79 variables, 29/32 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 14/46 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 32/78 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 19/98 variables, 19/97 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/97 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 1/99 variables, 1/98 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/99 variables, 0/98 constraints. Problems are: Problem set: 23 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/99 variables, 0/98 constraints. Problems are: Problem set: 23 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 98 constraints, problems are : Problem set: 23 solved, 32 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 32/55 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1978ms problems are : Problem set: 23 solved, 32 unsolved
Search for dead transitions found 23 dead transitions in 1979ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 48/128 places, 33/166 transitions.
Graph (complete) has 63 edges and 48 vertex of which 26 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 26 /48 variables (removed 22) and now considering 33/33 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/128 places, 33/166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2057 ms. Remains : 26/128 places, 33/166 transitions.
Built C files in :
/tmp/ltsmin4618714494998344699
[2025-06-06 22:32:19] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4618714494998344699
Running compilation step : cd /tmp/ltsmin4618714494998344699;'/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 337 ms.
Running link step : cd /tmp/ltsmin4618714494998344699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4618714494998344699;'/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/stateBased12606317296446118485.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 166/166 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 166/166 (removed 0) transitions.
// Phase 1: matrix 166 rows 128 cols
[2025-06-06 22:32:34] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:32:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-06 22:32:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:32:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 22:32: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/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/294 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 131 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5529 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/294 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 165/296 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:32:42] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 297 constraints, problems are : Problem set: 0 solved, 165 unsolved in 8564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14104ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 14105ms
Finished structural reductions in LTL mode , in 1 iterations and 14251 ms. Remains : 128/128 places, 166/166 transitions.
Built C files in :
/tmp/ltsmin4012035157881010165
[2025-06-06 22:32:49] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4012035157881010165
Running compilation step : cd /tmp/ltsmin4012035157881010165;'/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 245 ms.
Running link step : cd /tmp/ltsmin4012035157881010165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4012035157881010165;'/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/stateBased17250619162419059282.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 22:33:04] [INFO ] Flatten gal took : 8 ms
[2025-06-06 22:33:04] [INFO ] Flatten gal took : 7 ms
[2025-06-06 22:33:04] [INFO ] Time to serialize gal into /tmp/LTL15690561604470967768.gal : 2 ms
[2025-06-06 22:33:04] [INFO ] Time to serialize properties into /tmp/LTL15482514237407752666.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15690561604470967768.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6065188494541710109.hoa' '-atoms' '/tmp/LTL15482514237407752666.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15482514237407752666.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6065188494541710109.hoa
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t30, t35, t67, t70, t94, t97, t117, t120, t134, t154, t158, t161, t163, t167, Inter...249
Computing Next relation with stutter on 75 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
76 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.807456,50120,1,0,244,173719,372,178,3965,186791,455
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-11-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SmartHome-PT-11-LTLFireability-09 finished in 79733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||(p1&&G(p2)))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 134 transition count 173
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 134 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 134 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 129 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 129 transition count 167
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 125 transition count 163
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 125 transition count 163
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 123 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 123 transition count 161
Applied a total of 41 rules in 17 ms. Remains 123 /143 variables (removed 20) and now considering 161/182 (removed 21) transitions.
// Phase 1: matrix 161 rows 123 cols
[2025-06-06 22:33:05] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-06 22:33:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:05] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-06 22:33:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/284 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 126 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5188 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/284 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 160/286 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:33:12] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7935 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13134ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13134ms
Starting structural reductions in LTL mode, iteration 1 : 123/143 places, 161/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13263 ms. Remains : 123/143 places, 161/182 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-13
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-13 finished in 13507 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)||F(p1)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Graph (trivial) has 139 edges and 143 vertex of which 73 / 143 are part of one of the 6 SCC in 1 ms
Free SCC test removed 67 places
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 75 transition count 69
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 51 transition count 63
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 48 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 47 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 60 place count 47 transition count 59
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 66 place count 44 transition count 59
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 68 place count 42 transition count 57
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 42 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 42 transition count 56
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 105 place count 25 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 114 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 115 place count 24 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 115 place count 24 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 117 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 22 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 119 place count 21 transition count 27
Applied a total of 119 rules in 18 ms. Remains 21 /143 variables (removed 122) and now considering 27/182 (removed 155) transitions.
[2025-06-06 22:33:18] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 22:33:18] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:18] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-06 22:33:18] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-06 22:33:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-06 22:33:18] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:33:18] [INFO ] Redundant transitions in 30 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-06 22:33:18] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2025-06-06 22:33:18] [INFO ] Invariant cache hit.
[2025-06-06 22:33:18] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 20/38 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2/40 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/43 variables, and 24 constraints, problems are : Problem set: 0 solved, 16 unsolved in 133 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 20/38 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 2/40 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/42 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/42 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 41 constraints, problems are : Problem set: 0 solved, 16 unsolved in 277 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 416ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/143 places, 27/182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 21/143 places, 27/182 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLFireability-14 finished in 619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X((F(p2)||G(p3)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 182/182 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 175
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 175
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 131 transition count 170
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 131 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 128 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 128 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 127 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 127 transition count 166
Applied a total of 32 rules in 8 ms. Remains 127 /143 variables (removed 16) and now considering 166/182 (removed 16) transitions.
// Phase 1: matrix 166 rows 127 cols
[2025-06-06 22:33:19] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 22:33:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:33:19] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 22:33:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 130 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5629 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 165/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:33:27] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:33:29] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 297 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16718ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 16718ms
Starting structural reductions in LTL mode, iteration 1 : 127/143 places, 166/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16841 ms. Remains : 127/143 places, 166/182 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : SmartHome-PT-11-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 31 stabilizing places and 30 stable transitions
Computed a total of 31 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0) p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p2) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3))), (X (NOT p0)), (X (NOT p1)), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 20 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-11-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-11-LTLFireability-15 finished in 17308 ms.
All properties solved by simple procedures.
Total runtime 159744 ms.

BK_STOP 1749249216839

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-11"
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 SmartHome-PT-11, 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 r212-tall-174901995000772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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