Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r532-smll-171683811600484.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is SmartHome-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683811600484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 03:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 03:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 03:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 181K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-19-LTLFireability-00
FORMULA_NAME SmartHome-PT-19-LTLFireability-01
FORMULA_NAME SmartHome-PT-19-LTLFireability-02
FORMULA_NAME SmartHome-PT-19-LTLFireability-03
FORMULA_NAME SmartHome-PT-19-LTLFireability-04
FORMULA_NAME SmartHome-PT-19-LTLFireability-05
FORMULA_NAME SmartHome-PT-19-LTLFireability-06
FORMULA_NAME SmartHome-PT-19-LTLFireability-07
FORMULA_NAME SmartHome-PT-19-LTLFireability-08
FORMULA_NAME SmartHome-PT-19-LTLFireability-09
FORMULA_NAME SmartHome-PT-19-LTLFireability-10
FORMULA_NAME SmartHome-PT-19-LTLFireability-11
FORMULA_NAME SmartHome-PT-19-LTLFireability-12
FORMULA_NAME SmartHome-PT-19-LTLFireability-13
FORMULA_NAME SmartHome-PT-19-LTLFireability-14
FORMULA_NAME SmartHome-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717260162960

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:42:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:42:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:42:45] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2024-06-01 16:42:45] [INFO ] Transformed 741 places.
[2024-06-01 16:42:45] [INFO ] Transformed 809 transitions.
[2024-06-01 16:42:45] [INFO ] Found NUPN structural information;
[2024-06-01 16:42:46] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 517 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 227 places in 23 ms
Reduce places removed 227 places and 198 transitions.
FORMULA SmartHome-PT-19-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 495 transition count 611
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 159 place count 355 transition count 471
Iterating global reduction 1 with 140 rules applied. Total rules applied 299 place count 355 transition count 471
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 312 place count 355 transition count 458
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 340 place count 327 transition count 430
Iterating global reduction 2 with 28 rules applied. Total rules applied 368 place count 327 transition count 430
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 394 place count 301 transition count 404
Iterating global reduction 2 with 26 rules applied. Total rules applied 420 place count 301 transition count 404
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 423 place count 301 transition count 401
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 431 place count 293 transition count 393
Iterating global reduction 3 with 8 rules applied. Total rules applied 439 place count 293 transition count 393
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 441 place count 291 transition count 391
Iterating global reduction 3 with 2 rules applied. Total rules applied 443 place count 291 transition count 391
Applied a total of 443 rules in 528 ms. Remains 291 /514 variables (removed 223) and now considering 391/611 (removed 220) transitions.
// Phase 1: matrix 391 rows 291 cols
[2024-06-01 16:42:47] [INFO ] Computed 3 invariants in 34 ms
[2024-06-01 16:42:47] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-06-01 16:42:47] [INFO ] Invariant cache hit.
[2024-06-01 16:42:48] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2024-06-01 16:42:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/291 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/682 variables, 291/294 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (OVERLAPS) 0/682 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 682/682 variables, and 294 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/291 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/682 variables, 291/294 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 390/684 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 0/682 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 682/682 variables, and 684 constraints, problems are : Problem set: 0 solved, 390 unsolved in 25554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 0/0 constraints]
After SMT, in 55844ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 55889ms
Starting structural reductions in LTL mode, iteration 1 : 291/514 places, 391/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57643 ms. Remains : 291/514 places, 391/611 transitions.
Support contains 35 out of 291 places after structural reductions.
[2024-06-01 16:43:44] [INFO ] Flatten gal took : 224 ms
[2024-06-01 16:43:45] [INFO ] Flatten gal took : 91 ms
[2024-06-01 16:43:45] [INFO ] Input system was already deterministic with 391 transitions.
RANDOM walk for 40000 steps (111 resets) in 1678 ms. (23 steps per ms) remains 1/26 properties
BEST_FIRST walk for 7690 steps (0 resets) in 65 ms. (116 steps per ms) remains 0/1 properties
Computed a total of 51 stabilizing places and 50 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 312 edges and 291 vertex of which 174 / 291 are part of one of the 16 SCC in 5 ms
Free SCC test removed 158 places
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 132 transition count 133
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 89 transition count 130
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 87 transition count 129
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 86 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 85 transition count 127
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 97 place count 85 transition count 121
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 109 place count 79 transition count 121
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 116 place count 72 transition count 109
Iterating global reduction 5 with 7 rules applied. Total rules applied 123 place count 72 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 71 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 71 transition count 108
Performed 39 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 203 place count 32 transition count 64
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 205 place count 30 transition count 56
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 30 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 223 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 29 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 224 place count 29 transition count 39
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 28 transition count 39
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 228 place count 26 transition count 35
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 26 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 25 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 24 transition count 34
Applied a total of 232 rules in 64 ms. Remains 24 /291 variables (removed 267) and now considering 34/391 (removed 357) transitions.
[2024-06-01 16:43:46] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
// Phase 1: matrix 26 rows 24 cols
[2024-06-01 16:43:46] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 16:43:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 16:43:46] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2024-06-01 16:43:46] [INFO ] Invariant cache hit.
[2024-06-01 16:43:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-01 16:43:46] [INFO ] Redundant transitions in 60 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 16:43:46] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2024-06-01 16:43:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5/45 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/50 variables, and 23 constraints, problems are : Problem set: 0 solved, 13 unsolved in 432 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 5/45 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/46 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/47 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/47 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/50 variables, and 37 constraints, problems are : Problem set: 0 solved, 13 unsolved in 386 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 828ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 829ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/291 places, 34/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1065 ms. Remains : 24/291 places, 34/391 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-00 finished in 1390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 5 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 284 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 284 transition count 384
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 281 transition count 381
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 281 transition count 381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 280 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 280 transition count 380
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 279 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 279 transition count 379
Applied a total of 24 rules in 51 ms. Remains 279 /291 variables (removed 12) and now considering 379/391 (removed 12) transitions.
// Phase 1: matrix 379 rows 279 cols
[2024-06-01 16:43:47] [INFO ] Computed 3 invariants in 9 ms
[2024-06-01 16:43:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 16:43:47] [INFO ] Invariant cache hit.
[2024-06-01 16:43:48] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2024-06-01 16:43:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/658 variables, 279/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/658 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 282 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/658 variables, 279/282 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 378/660 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (OVERLAPS) 0/658 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 660 constraints, problems are : Problem set: 0 solved, 378 unsolved in 24813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints]
After SMT, in 54943ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 54960ms
Starting structural reductions in LTL mode, iteration 1 : 279/291 places, 379/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55502 ms. Remains : 279/291 places, 379/391 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 945 reset in 547 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-19-LTLFireability-01 finished in 56202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(p1)))))'
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 313 edges and 291 vertex of which 176 / 291 are part of one of the 16 SCC in 2 ms
Free SCC test removed 160 places
Ensure Unique test removed 217 transitions
Reduce isomorphic transitions removed 217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 130 transition count 129
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 86 transition count 126
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 84 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 83 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 96 place count 83 transition count 121
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 104 place count 79 transition count 121
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 110 place count 73 transition count 112
Iterating global reduction 4 with 6 rules applied. Total rules applied 116 place count 73 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 72 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 72 transition count 111
Performed 39 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 196 place count 33 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 33 transition count 68
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 201 place count 29 transition count 52
Iterating global reduction 5 with 4 rules applied. Total rules applied 205 place count 29 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 219 place count 29 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 221 place count 27 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 221 place count 27 transition count 37
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 223 place count 26 transition count 37
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 225 place count 24 transition count 33
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 23 transition count 32
Applied a total of 228 rules in 62 ms. Remains 23 /291 variables (removed 268) and now considering 32/391 (removed 359) transitions.
[2024-06-01 16:44:43] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-06-01 16:44:43] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 16:44:44] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 16:44:44] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-06-01 16:44:44] [INFO ] Invariant cache hit.
[2024-06-01 16:44:44] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-06-01 16:44:44] [INFO ] Redundant transitions in 39 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 16:44:44] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-06-01 16:44:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 3/43 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/48 variables, and 22 constraints, problems are : Problem set: 0 solved, 13 unsolved in 277 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/43 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/45 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/48 variables, and 36 constraints, problems are : Problem set: 0 solved, 13 unsolved in 386 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 672ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/291 places, 32/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 914 ms. Remains : 23/291 places, 32/391 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-02
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-02 finished in 1135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 31 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-06-01 16:44:45] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 16:44:45] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 16:44:45] [INFO ] Invariant cache hit.
[2024-06-01 16:44:45] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:44:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 29775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 22286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 52161ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 52168ms
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52666 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLFireability-03 finished in 53448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))||F(p2)))))'
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 312 edges and 291 vertex of which 172 / 291 are part of one of the 15 SCC in 17 ms
Free SCC test removed 157 places
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 133 transition count 128
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 54 rules applied. Total rules applied 103 place count 85 transition count 122
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 8 rules applied. Total rules applied 111 place count 81 transition count 118
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 79 transition count 117
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 78 transition count 116
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 116 place count 78 transition count 112
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 124 place count 74 transition count 112
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 131 place count 67 transition count 100
Iterating global reduction 5 with 7 rules applied. Total rules applied 138 place count 67 transition count 100
Performed 32 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 202 place count 35 transition count 66
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 32 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 32 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 215 place count 32 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 31 transition count 47
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 30 transition count 44
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 30 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 29 transition count 43
Applied a total of 219 rules in 49 ms. Remains 29 /291 variables (removed 262) and now considering 43/391 (removed 348) transitions.
[2024-06-01 16:45:38] [INFO ] Flow matrix only has 31 transitions (discarded 12 similar events)
// Phase 1: matrix 31 rows 29 cols
[2024-06-01 16:45:38] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 16:45:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 16:45:38] [INFO ] Flow matrix only has 31 transitions (discarded 12 similar events)
[2024-06-01 16:45:38] [INFO ] Invariant cache hit.
[2024-06-01 16:45:38] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-06-01 16:45:38] [INFO ] Redundant transitions in 50 ms returned []
Running 27 sub problems to find dead transitions.
[2024-06-01 16:45:38] [INFO ] Flow matrix only has 31 transitions (discarded 12 similar events)
[2024-06-01 16:45:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 30/58 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 1/59 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/59 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/60 variables, and 31 constraints, problems are : Problem set: 0 solved, 27 unsolved in 565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 30/58 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/60 variables, and 58 constraints, problems are : Problem set: 0 solved, 27 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 1229ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1230ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/291 places, 43/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1461 ms. Remains : 29/291 places, 43/391 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 443 steps with 11 reset in 5 ms.
FORMULA SmartHome-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-04 finished in 1634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 28 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-06-01 16:45:40] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 16:45:40] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 16:45:40] [INFO ] Invariant cache hit.
[2024-06-01 16:45:40] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:45:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)timeout

(s72 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 24242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 54354ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 54361ms
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55176 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLFireability-05 finished in 55652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F((p0||G(p1))))) U p2))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 313 edges and 291 vertex of which 192 / 291 are part of one of the 16 SCC in 1 ms
Free SCC test removed 176 places
Ensure Unique test removed 238 transitions
Reduce isomorphic transitions removed 238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 114 transition count 118
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 80 transition count 118
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 69 place count 80 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 75 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 70 transition count 103
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 70 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 69 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 69 transition count 102
Performed 35 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 161 place count 34 transition count 65
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 164 place count 31 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 31 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 181 place count 31 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 30 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 182 place count 30 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 29 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 186 place count 27 transition count 34
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 27 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 26 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 25 transition count 33
Applied a total of 190 rules in 27 ms. Remains 25 /291 variables (removed 266) and now considering 33/391 (removed 358) transitions.
[2024-06-01 16:46:35] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
// Phase 1: matrix 26 rows 25 cols
[2024-06-01 16:46:35] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 16:46:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 16:46:35] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 16:46:35] [INFO ] Invariant cache hit.
[2024-06-01 16:46:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 16:46:35] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-06-01 16:46:35] [INFO ] Redundant transitions in 41 ms returned []
Running 25 sub problems to find dead transitions.
[2024-06-01 16:46:35] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 16:46:35] [INFO ] Invariant cache hit.
[2024-06-01 16:46:35] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 23/44 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 4/48 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/51 variables, and 30 constraints, problems are : Problem set: 0 solved, 25 unsolved in 408 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 23/44 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 1/50 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/50 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/51 variables, and 56 constraints, problems are : Problem set: 0 solved, 25 unsolved in 590 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 1005ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1006ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/291 places, 33/391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1199 ms. Remains : 25/291 places, 33/391 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-07 finished in 1324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(G(!p2))))'
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 27 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-06-01 16:46:37] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 16:46:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 16:46:37] [INFO ] Invariant cache hit.
[2024-06-01 16:46:37] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:46:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 29991 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25318 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 55397ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55404ms
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55884 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-08
Product exploration explored 100000 steps with 40065 reset in 218 ms.
Product exploration explored 100000 steps with 40077 reset in 251 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 311 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (114 resets) in 873 ms. (45 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
[2024-06-01 16:47:34] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 4/642 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/271 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 (NOT p2))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 19 factoid took 617 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 371/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2024-06-01 16:47:35] [INFO ] Invariant cache hit.
[2024-06-01 16:47:36] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 16:47:36] [INFO ] Invariant cache hit.
[2024-06-01 16:47:36] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:47:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 55216ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55223ms
Finished structural reductions in LTL mode , in 1 iterations and 55694 ms. Remains : 271/271 places, 371/371 transitions.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
RANDOM walk for 3725 steps (9 resets) in 32 ms. (112 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) p1))), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 407 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 33473 reset in 201 ms.
Product exploration explored 100000 steps with 33273 reset in 233 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 371/371 transitions.
Graph (trivial) has 290 edges and 271 vertex of which 166 / 271 are part of one of the 15 SCC in 0 ms
Free SCC test removed 151 places
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 120 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 39 place count 120 transition count 165
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 120 transition count 165
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 63 place count 98 transition count 139
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 85 place count 98 transition count 139
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 125 place count 98 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 98 transition count 132
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 158 place count 69 transition count 94
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 187 place count 69 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 190 place count 66 transition count 91
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 193 place count 66 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 66 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 62 transition count 87
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 62 transition count 87
Deduced a syphon composed of 30 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 210 place count 62 transition count 80
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 209 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 212 place count 60 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 58 transition count 75
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 58 transition count 75
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 216 rules in 62 ms. Remains 58 /271 variables (removed 213) and now considering 75/371 (removed 296) transitions.
[2024-06-01 16:48:34] [INFO ] Redundant transitions in 55 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-01 16:48:34] [INFO ] Flow matrix only has 62 transitions (discarded 13 similar events)
// Phase 1: matrix 62 rows 58 cols
[2024-06-01 16:48:34] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 16:48:34] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
At refinement iteration 4 (OVERLAPS) 61/119 variables, 58/60 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 14/74 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/74 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/120 variables, 1/75 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/75 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/75 constraints. Problems are: Problem set: 28 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 75 constraints, problems are : Problem set: 28 solved, 46 unsolved in 2178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/2 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 61/92 variables, 31/33 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 14/47 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 46/93 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/93 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 27/119 variables, 27/120 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/120 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 1/120 variables, 1/121 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 0/121 constraints. Problems are: Problem set: 28 solved, 46 unsolved
At refinement iteration 13 (OVERLAPS) 0/120 variables, 0/121 constraints. Problems are: Problem set: 28 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 121 constraints, problems are : Problem set: 28 solved, 46 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 46/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 4132ms problems are : Problem set: 28 solved, 46 unsolved
Search for dead transitions found 28 dead transitions in 4135ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/271 places, 47/371 transitions.
Graph (complete) has 82 edges and 58 vertex of which 30 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 30 /58 variables (removed 28) and now considering 47/47 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/271 places, 47/371 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4267 ms. Remains : 30/271 places, 47/371 transitions.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 371/371 (removed 0) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-06-01 16:48:38] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 16:48:38] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 16:48:38] [INFO ] Invariant cache hit.
[2024-06-01 16:48:39] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:48:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 28931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 26592 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 55584ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55591ms
Finished structural reductions in LTL mode , in 1 iterations and 56058 ms. Remains : 271/271 places, 371/371 transitions.
Treatment of property SmartHome-PT-19-LTLFireability-08 finished in 177714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 6 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 283 transition count 383
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 283 transition count 383
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 279 transition count 379
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 279 transition count 379
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 276 transition count 376
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 276 transition count 376
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 273 transition count 373
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 273 transition count 373
Applied a total of 36 rules in 43 ms. Remains 273 /291 variables (removed 18) and now considering 373/391 (removed 18) transitions.
// Phase 1: matrix 373 rows 273 cols
[2024-06-01 16:49:34] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 16:49:34] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 16:49:34] [INFO ] Invariant cache hit.
[2024-06-01 16:49:35] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-06-01 16:49:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 276 constraints, problems are : Problem set: 0 solved, 372 unsolved in 28020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 372/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (OVERLAPS) 0/646 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 648 constraints, problems are : Problem set: 0 solved, 372 unsolved in 24715 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints]
After SMT, in 52807ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 52814ms
Starting structural reductions in LTL mode, iteration 1 : 273/291 places, 373/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53287 ms. Remains : 273/291 places, 373/391 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-11 finished in 53443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (p1||F(p2))))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 284 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 284 transition count 384
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 280 transition count 380
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 280 transition count 380
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 277 transition count 377
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Applied a total of 34 rules in 23 ms. Remains 274 /291 variables (removed 17) and now considering 374/391 (removed 17) transitions.
// Phase 1: matrix 374 rows 274 cols
[2024-06-01 16:50:28] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 16:50:28] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 16:50:28] [INFO ] Invariant cache hit.
[2024-06-01 16:50:28] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2024-06-01 16:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 277 constraints, problems are : Problem set: 0 solved, 373 unsolved in 29066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 373/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (OVERLAPS) 0/648 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 650 constraints, problems are : Problem set: 0 solved, 373 unsolved in 25278 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 54391ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 54401ms
Starting structural reductions in LTL mode, iteration 1 : 274/291 places, 374/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54724 ms. Remains : 274/291 places, 374/391 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-12
Stuttering criterion allowed to conclude after 366 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-12 finished in 54862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 21 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-06-01 16:51:23] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 16:51:23] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 16:51:23] [INFO ] Invariant cache hit.
[2024-06-01 16:51:23] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:51:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 29898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 26650 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 56606ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 56613ms
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57108 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-13
Product exploration explored 100000 steps with 723 reset in 290 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-19-LTLFireability-13 finished in 57521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U p2)))'
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 282 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 282 transition count 382
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 277 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 274 transition count 374
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 274 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 271 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 271 transition count 371
Applied a total of 40 rules in 31 ms. Remains 271 /291 variables (removed 20) and now considering 371/391 (removed 20) transitions.
[2024-06-01 16:52:20] [INFO ] Invariant cache hit.
[2024-06-01 16:52:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 16:52:20] [INFO ] Invariant cache hit.
[2024-06-01 16:52:21] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:52:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 24695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 54784ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 54791ms
Starting structural reductions in LTL mode, iteration 1 : 271/291 places, 371/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55306 ms. Remains : 271/291 places, 371/391 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Detected a total of 37/271 stabilizing places and 36/371 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 23 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLFireability-15 finished in 55958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(G(!p2))))'
Found a Lengthening insensitive property : SmartHome-PT-19-LTLFireability-08
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Support contains 4 out of 291 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 291/291 places, 391/391 transitions.
Graph (trivial) has 310 edges and 291 vertex of which 167 / 291 are part of one of the 15 SCC in 1 ms
Free SCC test removed 152 places
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 138 transition count 137
Reduce places removed 47 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 53 rules applied. Total rules applied 101 place count 91 transition count 131
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 88 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 86 transition count 129
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 108 place count 86 transition count 123
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 120 place count 80 transition count 123
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 127 place count 73 transition count 111
Iterating global reduction 4 with 7 rules applied. Total rules applied 134 place count 73 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 72 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 72 transition count 110
Performed 36 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 208 place count 36 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 36 transition count 71
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 212 place count 33 transition count 59
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 33 transition count 59
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 5 with 2 rules applied. Total rules applied 217 place count 32 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 218 place count 32 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 225 place count 32 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 226 place count 31 transition count 50
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 227 place count 30 transition count 47
Iterating global reduction 7 with 1 rules applied. Total rules applied 228 place count 30 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 29 transition count 46
Applied a total of 229 rules in 35 ms. Remains 29 /291 variables (removed 262) and now considering 46/391 (removed 345) transitions.
[2024-06-01 16:53:17] [INFO ] Flow matrix only has 33 transitions (discarded 13 similar events)
// Phase 1: matrix 33 rows 29 cols
[2024-06-01 16:53:17] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 16:53:17] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 16:53:17] [INFO ] Flow matrix only has 33 transitions (discarded 13 similar events)
[2024-06-01 16:53:17] [INFO ] Invariant cache hit.
[2024-06-01 16:53:17] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2024-06-01 16:53:17] [INFO ] Flow matrix only has 33 transitions (discarded 13 similar events)
[2024-06-01 16:53:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 3/59 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/62 variables, and 30 constraints, problems are : Problem set: 0 solved, 24 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/29 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 3/59 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/59 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/62 variables, and 54 constraints, problems are : Problem set: 0 solved, 24 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/29 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 1131ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1133ms
Starting structural reductions in LI_LTL mode, iteration 1 : 29/291 places, 46/391 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1258 ms. Remains : 29/291 places, 46/391 transitions.
Running random walk in product with property : SmartHome-PT-19-LTLFireability-08
Stuttering criterion allowed to conclude after 1057 steps with 323 reset in 10 ms.
Treatment of property SmartHome-PT-19-LTLFireability-08 finished in 1767 ms.
FORMULA SmartHome-PT-19-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 16:53:18] [INFO ] Flatten gal took : 38 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 633002 ms.
ITS solved all properties within timeout

BK_STOP 1717260798481

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is SmartHome-PT-19, 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 r532-smll-171683811600484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-19.tgz
mv SmartHome-PT-19 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;