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.r378-smll-171683811400402.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 itstools
Input is SmartHome-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811400402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 13K Apr 12 03:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 03:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 03:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 03:37 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 64K 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-09-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-09-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-09-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-09-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-09-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-09-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717031829877

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:17:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:17:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:17:12] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-30 01:17:12] [INFO ] Transformed 253 places.
[2024-05-30 01:17:12] [INFO ] Transformed 293 transitions.
[2024-05-30 01:17:12] [INFO ] Found NUPN structural information;
[2024-05-30 01:17:12] [INFO ] Parsed PT model containing 253 places and 293 transitions and 664 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 30 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-09-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 263/263 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 217 transition count 263
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 53 place count 171 transition count 217
Iterating global reduction 1 with 46 rules applied. Total rules applied 99 place count 171 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 104 place count 171 transition count 212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 168 transition count 209
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 168 transition count 209
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 165 transition count 206
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 165 transition count 206
Applied a total of 116 rules in 84 ms. Remains 165 /224 variables (removed 59) and now considering 206/263 (removed 57) transitions.
// Phase 1: matrix 206 rows 165 cols
[2024-05-30 01:17:12] [INFO ] Computed 3 invariants in 12 ms
[2024-05-30 01:17:12] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-30 01:17:12] [INFO ] Invariant cache hit.
[2024-05-30 01:17:13] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-30 01:17:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/371 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 0/371 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 168 constraints, problems are : Problem set: 0 solved, 205 unsolved in 11172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/371 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 205/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/371 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 373 constraints, problems are : Problem set: 0 solved, 205 unsolved in 10054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 21363ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 21403ms
Starting structural reductions in LTL mode, iteration 1 : 165/224 places, 206/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22149 ms. Remains : 165/224 places, 206/263 transitions.
Support contains 57 out of 165 places after structural reductions.
[2024-05-30 01:17:35] [INFO ] Flatten gal took : 86 ms
[2024-05-30 01:17:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-09-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:17:35] [INFO ] Flatten gal took : 33 ms
[2024-05-30 01:17:35] [INFO ] Input system was already deterministic with 206 transitions.
Support contains 56 out of 165 places (down from 57) after GAL structural reductions.
RANDOM walk for 40000 steps (269 resets) in 2389 ms. (16 steps per ms) remains 5/46 properties
BEST_FIRST walk for 40004 steps (48 resets) in 439 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (41 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
[2024-05-30 01:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 80/119 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/123 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/125 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 88/213 variables, 38/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 70/283 variables, 35/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 53/336 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 16 (OVERLAPS) 26/362 variables, 16/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 8/370 variables, 5/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/371 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/371 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/371 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 168 constraints, problems are : Problem set: 1 solved, 3 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/71 variables, 16/21 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 2/26 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 2/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 88/164 variables, 29/57 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 94/258 variables, 48/105 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/259 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 58/317 variables, 33/140 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/317 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 32/349 variables, 18/158 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/349 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 17/366 variables, 9/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/366 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 5/371 variables, 4/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/371 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/371 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 171 constraints, problems are : Problem set: 1 solved, 3 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1011ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 267 ms.
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 206/206 transitions.
Graph (trivial) has 157 edges and 165 vertex of which 68 / 165 are part of one of the 5 SCC in 10 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 102 transition count 81
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 40 rules applied. Total rules applied 76 place count 67 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 65 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 78 place count 65 transition count 70
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 90 place count 59 transition count 70
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 53 transition count 64
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 53 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 53 transition count 63
Performed 24 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 151 place count 29 transition count 35
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 160 place count 29 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 29 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 28 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 28 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 27 transition count 23
Reduce places removed 4 places and 0 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 6 with 6 rules applied. Total rules applied 171 place count 23 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 173 place count 21 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 173 place count 21 transition count 18
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 180 place count 17 transition count 18
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 181 place count 17 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 182 place count 16 transition count 17
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 184 place count 16 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 186 place count 14 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 187 place count 14 transition count 15
Applied a total of 187 rules in 93 ms. Remains 14 /165 variables (removed 151) and now considering 15/206 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 14/165 places, 15/206 transitions.
RANDOM walk for 16716 steps (5 resets) in 129 ms. (128 steps per ms) remains 0/3 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-30 01:17:37] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:17:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:17:37] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:17:37] [INFO ] Input system was already deterministic with 206 transitions.
Support contains 52 out of 165 places (down from 54) after GAL structural reductions.
Computed a total of 48 stabilizing places and 48 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 146 transition count 187
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 146 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 146 transition count 186
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 137 transition count 177
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 137 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 137 transition count 176
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 132 transition count 171
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 132 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 130 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 130 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 129 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 129 transition count 168
Applied a total of 74 rules in 34 ms. Remains 129 /165 variables (removed 36) and now considering 168/206 (removed 38) transitions.
// Phase 1: matrix 168 rows 129 cols
[2024-05-30 01:17:37] [INFO ] Computed 3 invariants in 10 ms
[2024-05-30 01:17:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 01:17:38] [INFO ] Invariant cache hit.
[2024-05-30 01:17:38] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-30 01:17:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/297 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 132 constraints, problems are : Problem set: 0 solved, 167 unsolved in 7180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/297 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 167/299 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 299 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 13554ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 13559ms
Starting structural reductions in LTL mode, iteration 1 : 129/165 places, 168/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13832 ms. Remains : 129/165 places, 168/206 transitions.
[2024-05-30 01:17:51] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:17:51] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:17:51] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-30 01:17:51] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:17:51] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14747150928629635809.gal : 5 ms
[2024-05-30 01:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14626249952934111206.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14747150928629635809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14626249952934111206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.38908e+09,0.227308,10268,2,1732,5,29027,6,0,680,31747,0


Converting to forward existential form...Done !
original formula: EX((EG(EF((p73==1))) + (((p133==1)&&(p84==1))&&(p218==1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),E(TRUE U (p73==1)))] != FALSE + [(EY(Init) * (((p133==1)&&(p84==1))&&(p218==1)))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t16, t33, t36, t65, t68, t85, t88, t106, t109, t112, t123, t142, t145, t153, Inters...248
(forward)formula 0,1,26.243,663924,1,0,530,2.59546e+06,363,355,3884,5.44249e+06,580
FORMULA SmartHome-PT-09-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Graph (trivial) has 141 edges and 165 vertex of which 36 / 165 are part of one of the 4 SCC in 4 ms
Free SCC test removed 32 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 132 transition count 121
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 96 place count 90 transition count 110
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 105 place count 84 transition count 107
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 3 with 10 rules applied. Total rules applied 115 place count 83 transition count 98
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 126 place count 74 transition count 96
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 126 place count 74 transition count 87
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 144 place count 65 transition count 87
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 152 place count 57 transition count 79
Iterating global reduction 5 with 8 rules applied. Total rules applied 160 place count 57 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 164 place count 57 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 56 transition count 75
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 189 place count 44 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 190 place count 44 transition count 62
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 8 with 2 rules applied. Total rules applied 192 place count 43 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 199 place count 43 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 200 place count 42 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 200 place count 42 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 202 place count 41 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 203 place count 41 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 204 place count 41 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 205 place count 40 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 206 place count 39 transition count 51
Applied a total of 206 rules in 41 ms. Remains 39 /165 variables (removed 126) and now considering 51/206 (removed 155) transitions.
[2024-05-30 01:18:18] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
// Phase 1: matrix 48 rows 39 cols
[2024-05-30 01:18:18] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 01:18:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 01:18:18] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-05-30 01:18:18] [INFO ] Invariant cache hit.
[2024-05-30 01:18:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-30 01:18:18] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-30 01:18:18] [INFO ] Redundant transitions in 34 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-30 01:18:18] [INFO ] Flow matrix only has 48 transitions (discarded 3 similar events)
[2024-05-30 01:18:18] [INFO ] Invariant cache hit.
[2024-05-30 01:18:18] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 46/82 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 4/86 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/87 variables, and 45 constraints, problems are : Problem set: 0 solved, 45 unsolved in 664 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 46/82 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 42/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 4/86 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/86 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/87 variables, and 90 constraints, problems are : Problem set: 0 solved, 45 unsolved in 893 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1571ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1572ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/165 places, 51/206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1768 ms. Remains : 39/165 places, 51/206 transitions.
[2024-05-30 01:18:20] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:18:20] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:18:20] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-30 01:18:20] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:18:20] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:18:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7993905298236323342.gal : 2 ms
[2024-05-30 01:18:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2901917606942249012.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7993905298236323342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2901917606942249012.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,105130,0.018518,3604,2,178,5,956,6,0,198,837,0


Converting to forward existential form...Done !
original formula: (AG(((AF((p138==0)) * (EG((p140==1)) + EF((p197==1)))) * E((p143==1) U (p68==1)))) + EF(AG((((EF((p64==1)) * ((p185==0)||(p251==0))) * ((...204
=> equivalent forward existential formula: (([FwdG(FwdU((Init * !(E(TRUE U !(E(TRUE U !((((E(TRUE U (p64==1)) * ((p185==0)||(p251==0))) * ((p208==0)&&((p88...622
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t8, t9, t11, t17, t19, t22, t44, t47, Intersection with reachable at each step enabl...206
(forward)formula 0,0,0.17091,7352,1,0,126,23300,128,71,1198,25969,153
FORMULA SmartHome-PT-09-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 145 transition count 186
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 145 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 145 transition count 185
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 135 transition count 175
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 135 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 135 transition count 174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 130 transition count 169
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 130 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 128 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 128 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 127 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 127 transition count 166
Applied a total of 78 rules in 45 ms. Remains 127 /165 variables (removed 38) and now considering 166/206 (removed 40) transitions.
// Phase 1: matrix 166 rows 127 cols
[2024-05-30 01:18:20] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:18:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 01:18:20] [INFO ] Invariant cache hit.
[2024-05-30 01:18:20] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-30 01:18:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 130 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6534 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 165/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 295 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 13446ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 13450ms
Starting structural reductions in LTL mode, iteration 1 : 127/165 places, 166/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13738 ms. Remains : 127/165 places, 166/206 transitions.
[2024-05-30 01:18:34] [INFO ] Flatten gal took : 20 ms
[2024-05-30 01:18:34] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:18:34] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-30 01:18:34] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:18:34] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:18:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10913550216682151547.gal : 4 ms
[2024-05-30 01:18:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1215612874981275851.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10913550216682151547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1215612874981275851.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.68869e+09,0.253807,8208,2,1281,5,20464,6,0,670,23311,0


Converting to forward existential form...Done !
original formula: EF(((EX((!(E((p112==1) U ((p138==1)&&(p222==1)))) * EX((p190==0)))) * AG(EF((p98==1)))) * (AG((p174!=1)) + (p64==1))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (EX((!(E((p112==1) U ((p138==1)&&(p222==1)))) * EX((p190==0)))) * !(E(TRUE U !(E(TRUE U (p...355
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t13, t30, t33, t62, t65, t83, t86, t103, t106, t107, t109, t121, t140, t143, t151, ...254
(forward)formula 0,0,1.64655,42980,1,0,243,230536,358,163,3736,193878,392
FORMULA SmartHome-PT-09-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 143 transition count 184
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 143 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 143 transition count 183
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 133 transition count 173
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 133 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 133 transition count 172
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 127 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 127 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 124 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 123 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 123 transition count 162
Applied a total of 86 rules in 16 ms. Remains 123 /165 variables (removed 42) and now considering 162/206 (removed 44) transitions.
// Phase 1: matrix 162 rows 123 cols
[2024-05-30 01:18:35] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:18:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 01:18:35] [INFO ] Invariant cache hit.
[2024-05-30 01:18:36] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 01:18:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5938 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 287 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5368 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 11332ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 11335ms
Starting structural reductions in LTL mode, iteration 1 : 123/165 places, 162/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11584 ms. Remains : 123/165 places, 162/206 transitions.
[2024-05-30 01:18:47] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:18:47] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:18:47] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 01:18:47] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:18:47] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:18:47] [INFO ] Time to serialize gal into /tmp/CTLFireability851232741996194326.gal : 3 ms
[2024-05-30 01:18:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14125674559787946764.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability851232741996194326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14125674559787946764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2641e+09,0.29706,8984,2,1326,5,24516,6,0,650,27813,0


Converting to forward existential form...Done !
original formula: (AX(AF((p130==1))) + EX(EF(EG((p182==1)))))
=> equivalent forward existential formula: [FwdG(EY((Init * !(EX(E(TRUE U EG((p182==1))))))),!((p130==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t34, t62, t65, t82, t85, t102, t105, t117, t136, t139, t147, Interse...247
(forward)formula 0,1,1.46288,36104,1,0,240,174246,359,156,3819,162972,376
FORMULA SmartHome-PT-09-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 147 transition count 188
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 147 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 147 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 139 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 139 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 139 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 135 transition count 174
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 135 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 134 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 134 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 133 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 133 transition count 172
Applied a total of 66 rules in 10 ms. Remains 133 /165 variables (removed 32) and now considering 172/206 (removed 34) transitions.
// Phase 1: matrix 172 rows 133 cols
[2024-05-30 01:18:48] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:18:49] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 01:18:49] [INFO ] Invariant cache hit.
[2024-05-30 01:18:49] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-30 01:18:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/305 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/305 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 136 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7319 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/305 variables, 133/136 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 171/307 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 307 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 14113ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 14116ms
Starting structural reductions in LTL mode, iteration 1 : 133/165 places, 172/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14303 ms. Remains : 133/165 places, 172/206 transitions.
[2024-05-30 01:19:03] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:19:03] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:19:03] [INFO ] Input system was already deterministic with 172 transitions.
[2024-05-30 01:19:03] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:03] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14782863610375553224.gal : 2 ms
[2024-05-30 01:19:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17938776333833134117.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14782863610375553224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17938776333833134117.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21852e+09,0.264628,10612,2,1704,5,30769,6,0,700,33995,0


Converting to forward existential form...Done !
original formula: A(!(AG((((A((p204!=1) U (p94==1)) + E((p44==1) U (p130==1))) + ((p130==1)||(p38==1))) + (p176==1)))) U (EX(!(((EG((p167==1)) + (p230!=1))...186
=> equivalent forward existential formula: [((Init * !(EG(!((EX(!(((EG((p167==1)) + (p230!=1)) + (p86==1)))) + E(TRUE U (p88==1))))))) * !(E(!((EX(!(((EG((...466
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t10, t13, t33, t36, t65, t68, t85, t91, t111, t114, t126, t130, t146, t149, t157, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.8497,399672,1,0,1115,2.53033e+06,397,666,4302,2.80417e+06,1266
FORMULA SmartHome-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Graph (trivial) has 165 edges and 165 vertex of which 78 / 165 are part of one of the 6 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 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 92 transition count 79
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 41 rules applied. Total rules applied 76 place count 58 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 55 transition count 72
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 79 place count 55 transition count 67
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 89 place count 50 transition count 67
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 98 place count 41 transition count 58
Iterating global reduction 3 with 9 rules applied. Total rules applied 107 place count 41 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 41 transition count 57
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 138 place count 26 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 26 transition count 41
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 141 place count 25 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 151 place count 25 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 153 place count 23 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 153 place count 23 transition count 29
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 155 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 21 transition count 28
Applied a total of 156 rules in 17 ms. Remains 21 /165 variables (removed 144) and now considering 28/206 (removed 178) transitions.
[2024-05-30 01:19:20] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 21 cols
[2024-05-30 01:19:20] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 01:19:20] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:19:20] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2024-05-30 01:19:20] [INFO ] Invariant cache hit.
[2024-05-30 01:19:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-30 01:19:20] [INFO ] Redundant transitions in 26 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 01:19:20] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2024-05-30 01:19:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/44 variables, and 21 constraints, problems are : Problem set: 0 solved, 14 unsolved in 233 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 36 constraints, problems are : Problem set: 0 solved, 14 unsolved in 381 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 619ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/165 places, 28/206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 735 ms. Remains : 21/165 places, 28/206 transitions.
[2024-05-30 01:19:21] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:19:21] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:19:21] [INFO ] Input system was already deterministic with 28 transitions.
[2024-05-30 01:19:21] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:19:21] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 70 steps (7 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-09-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:19:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13482626408309618663.gal : 1 ms
[2024-05-30 01:19:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2920500276793048859.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13482626408309618663.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2920500276793048859.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 144 transition count 185
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 144 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 144 transition count 184
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 133 transition count 173
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 133 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 133 transition count 172
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 127 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 127 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 124 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 123 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 123 transition count 162
Applied a total of 86 rules in 14 ms. Remains 123 /165 variables (removed 42) and now considering 162/206 (removed 44) transitions.
// Phase 1: matrix 162 rows 123 cols
[2024-05-30 01:19:21] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:19:21] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 01:19:21] [INFO ] Invariant cache hit.
[2024-05-30 01:19:21] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 01:19:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 287 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 11474ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 11478ms
Starting structural reductions in LTL mode, iteration 1 : 123/165 places, 162/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11785 ms. Remains : 123/165 places, 162/206 transitions.
[2024-05-30 01:19:32] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:19:32] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:19:32] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 01:19:32] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:19:32] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:19:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11142172974483617145.gal : 3 ms
[2024-05-30 01:19:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3344367108468377873.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11142172974483617145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3344367108468377873.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87218e+09,0.227019,7928,2,1216,5,18832,6,0,650,21113,0


Converting to forward existential form...Done !
original formula: AG((EX(((p217==0)||(p222==0))) + ((p15==1) * EX(((p223==1)||(p98==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p15==1) * EX(((p223==1)||(p98==1)))))) * !(EX(((p217==0)||(p222==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t13, t30, t33, t62, t65, t82, t85, t102, t105, t117, t136, t139, t147, Interse...247
(forward)formula 0,0,0.982199,27152,1,0,215,116899,342,144,3518,120494,337
FORMULA SmartHome-PT-09-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Graph (trivial) has 150 edges and 165 vertex of which 38 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 130 transition count 112
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 66 rules applied. Total rules applied 117 place count 80 transition count 96
Reduce places removed 9 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 2 with 11 rules applied. Total rules applied 128 place count 71 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 70 transition count 94
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 129 place count 70 transition count 87
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 143 place count 63 transition count 87
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 153 place count 53 transition count 77
Iterating global reduction 4 with 10 rules applied. Total rules applied 163 place count 53 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 167 place count 53 transition count 73
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 169 place count 52 transition count 72
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 201 place count 36 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 205 place count 36 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 206 place count 35 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 210 place count 33 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 215 place count 33 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 216 place count 32 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 216 place count 32 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 218 place count 31 transition count 44
Applied a total of 218 rules in 23 ms. Remains 31 /165 variables (removed 134) and now considering 44/206 (removed 162) transitions.
[2024-05-30 01:19:33] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 31 cols
[2024-05-30 01:19:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 01:19:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:19:34] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
[2024-05-30 01:19:34] [INFO ] Invariant cache hit.
[2024-05-30 01:19:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 01:19:34] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-30 01:19:34] [INFO ] Redundant transitions in 33 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-30 01:19:34] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
[2024-05-30 01:19:34] [INFO ] Invariant cache hit.
[2024-05-30 01:19:34] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 38/69 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/70 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/70 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 45 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 38/69 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 43/87 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 88 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 2165ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2166ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/165 places, 44/206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2315 ms. Remains : 31/165 places, 44/206 transitions.
[2024-05-30 01:19:36] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:19:36] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:19:36] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 01:19:36] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:19:36] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:19:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8481185960964257816.gal : 19 ms
[2024-05-30 01:19:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17240779787996787079.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8481185960964257816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17240779787996787079.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,34561,0.013718,3572,2,93,5,618,6,0,159,523,0


Converting to forward existential form...Done !
original formula: EG(EF(((p66==1) + E(((p217!=1) + A((p161==1) U ((p2==1)&&(p138==1)))) U (p38==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p66==1) + E(((p217!=1) + !((E(!(((p2==1)&&(p138==1))) U (!((p161==1)) * !(((p2==1)&&(p138=...220
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t6, t8, t13, t17, t32, t37, Intersection with reachable at each step enabled. (destr...195
(forward)formula 0,1,0.299399,10224,1,0,296,38925,126,178,977,52573,311
FORMULA SmartHome-PT-09-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 145 transition count 186
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 145 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 145 transition count 185
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 135 transition count 175
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 135 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 135 transition count 174
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 129 transition count 168
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 129 transition count 168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 126 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 126 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 125 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 125 transition count 164
Applied a total of 82 rules in 13 ms. Remains 125 /165 variables (removed 40) and now considering 164/206 (removed 42) transitions.
// Phase 1: matrix 164 rows 125 cols
[2024-05-30 01:19:36] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:19:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-30 01:19:36] [INFO ] Invariant cache hit.
[2024-05-30 01:19:37] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-30 01:19:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/289 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 128 constraints, problems are : Problem set: 0 solved, 163 unsolved in 7180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/289 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 163/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 291 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5595 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 12811ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 12814ms
Starting structural reductions in LTL mode, iteration 1 : 125/165 places, 164/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13173 ms. Remains : 125/165 places, 164/206 transitions.
[2024-05-30 01:19:49] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:49] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:49] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-30 01:19:49] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:19:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11956716279790992606.gal : 2 ms
[2024-05-30 01:19:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1319560104668905354.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11956716279790992606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1319560104668905354.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52224e+09,0.306963,8996,2,1295,5,24241,6,0,660,27685,0


Converting to forward existential form...Done !
original formula: EF(AX((((p31==0)&&(p68==1))&&(p117==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((p31==0)&&(p68==1))&&(p117==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t61, t64, t83, t86, t103, t106, t118, t138, t141, t149, Intersection...242
(forward)formula 0,1,1.35452,29496,1,0,209,128117,345,143,3576,129868,335
FORMULA SmartHome-PT-09-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 145 transition count 186
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 145 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 145 transition count 185
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 135 transition count 175
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 135 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 135 transition count 174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 130 transition count 169
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 130 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 128 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 128 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 127 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 127 transition count 166
Applied a total of 78 rules in 10 ms. Remains 127 /165 variables (removed 38) and now considering 166/206 (removed 40) transitions.
// Phase 1: matrix 166 rows 127 cols
[2024-05-30 01:19:51] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:19:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 01:19:51] [INFO ] Invariant cache hit.
[2024-05-30 01:19:51] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-30 01:19:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 130 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4522 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 165/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 295 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 9708ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 9710ms
Starting structural reductions in LTL mode, iteration 1 : 127/165 places, 166/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9922 ms. Remains : 127/165 places, 166/206 transitions.
[2024-05-30 01:20:01] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:20:01] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:20:01] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-30 01:20:01] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:20:01] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:20:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16109550326971261872.gal : 2 ms
[2024-05-30 01:20:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15100486140595393159.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16109550326971261872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15100486140595393159.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64512e+09,0.243765,7948,2,1193,5,18467,6,0,670,21471,0


Converting to forward existential form...Done !
original formula: EF(EX(((AG((p119==0)) * (p131!=1)) * ((p127==0)||(p109==0)))))
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * ((p127==0)||(p109==0))) * (p131!=1)) * !(E(TRUE U !((p119==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t61, t65, t83, t89, t106, t109, t121, t140, t143, t147, t151, Inters...248
(forward)formula 0,1,1.18088,29244,1,0,225,139515,356,152,3832,122480,358
FORMULA SmartHome-PT-09-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Graph (trivial) has 148 edges and 165 vertex of which 49 / 165 are part of one of the 4 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 119 transition count 106
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 52 rules applied. Total rules applied 95 place count 77 transition count 96
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 104 place count 71 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 69 transition count 93
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 106 place count 69 transition count 86
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 120 place count 62 transition count 86
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 131 place count 51 transition count 75
Iterating global reduction 4 with 11 rules applied. Total rules applied 142 place count 51 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 147 place count 51 transition count 70
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 50 transition count 69
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 49 transition count 68
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 49 transition count 68
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 181 place count 34 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 183 place count 34 transition count 51
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 7 with 2 rules applied. Total rules applied 185 place count 33 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 190 place count 33 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 191 place count 32 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 191 place count 32 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 193 place count 31 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 194 place count 31 transition count 44
Applied a total of 194 rules in 23 ms. Remains 31 /165 variables (removed 134) and now considering 44/206 (removed 162) transitions.
[2024-05-30 01:20:02] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 31 cols
[2024-05-30 01:20:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 01:20:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:20:02] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-05-30 01:20:02] [INFO ] Invariant cache hit.
[2024-05-30 01:20:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-30 01:20:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-30 01:20:02] [INFO ] Redundant transitions in 32 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-30 01:20:02] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-05-30 01:20:02] [INFO ] Invariant cache hit.
[2024-05-30 01:20:02] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 39/70 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/71 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 46 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 39/70 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 43/88 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/71 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/71 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 89 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1093 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 2259ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/165 places, 44/206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2401 ms. Remains : 31/165 places, 44/206 transitions.
[2024-05-30 01:20:04] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:20:04] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:20:04] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 01:20:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:20:04] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:20:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13980837987687857539.gal : 1 ms
[2024-05-30 01:20:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7580822267273644555.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13980837987687857539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7580822267273644555.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,32401,0.010902,3576,2,115,5,844,6,0,159,668,0


Converting to forward existential form...Done !
original formula: !(A(!(A((((p2==1)&&(p138==1))||(p208!=1)) U !(EF((p107==1))))) U AG(!((EF(((p107==1)&&(p233==1))) * !(((p151==1)||(p35==1))))))))
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,!(!(E(TRUE U !(!((E(TRUE U ((p107==1)&&(p233==1))) * !(((p151==1)||(p35==1)))))))))) * ...481
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t7, t9, t11, t15, t32, t39, Intersection with reachable at each step enabled. (destr...195
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.102393,7060,1,0,172,20248,127,139,1090,25716,212
FORMULA SmartHome-PT-09-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Graph (trivial) has 146 edges and 165 vertex of which 34 / 165 are part of one of the 3 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 133 transition count 115
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 66 rules applied. Total rules applied 118 place count 82 transition count 100
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 129 place count 73 transition count 98
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 72 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 71 transition count 97
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 132 place count 71 transition count 91
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 144 place count 65 transition count 91
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 154 place count 55 transition count 81
Iterating global reduction 5 with 10 rules applied. Total rules applied 164 place count 55 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 169 place count 55 transition count 76
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 172 place count 53 transition count 75
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 204 place count 37 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 208 place count 37 transition count 55
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 8 with 3 rules applied. Total rules applied 211 place count 36 transition count 53
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 213 place count 35 transition count 52
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 10 with 2 rules applied. Total rules applied 215 place count 34 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 220 place count 34 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 221 place count 33 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 221 place count 33 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 223 place count 32 transition count 45
Applied a total of 223 rules in 24 ms. Remains 32 /165 variables (removed 133) and now considering 45/206 (removed 161) transitions.
[2024-05-30 01:20:04] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
// Phase 1: matrix 42 rows 32 cols
[2024-05-30 01:20:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 01:20:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 01:20:05] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2024-05-30 01:20:05] [INFO ] Invariant cache hit.
[2024-05-30 01:20:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-30 01:20:05] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-30 01:20:05] [INFO ] Redundant transitions in 39 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-30 01:20:05] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2024-05-30 01:20:05] [INFO ] Invariant cache hit.
[2024-05-30 01:20:05] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 41/73 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/74 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 41 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 41/73 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 44/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 1/74 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 85 constraints, problems are : Problem set: 0 solved, 44 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1860ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1861ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/165 places, 45/206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2035 ms. Remains : 32/165 places, 45/206 transitions.
[2024-05-30 01:20:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:20:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:20:07] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-30 01:20:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:20:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:20:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17866684829790631799.gal : 1 ms
[2024-05-30 01:20:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10228811289593039462.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17866684829790631799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10228811289593039462.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24193,0.010879,3592,2,114,5,828,6,0,165,692,0


Converting to forward existential form...Done !
original formula: EF((EG((p151==1)) * (EG(((AF(((p45==1)&&(p239==1))) * ((p124==1)||((p2==1)&&(p185==1)))) + EF((p217==1)))) + (p143==1))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * EG((p151==1))),((!(EG(!(((p45==1)&&(p239==1))))) * ((p124==1)||((p2==1)&&(p185==1)))) ...250
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t10, t12, t14, t16, t33, t39, Intersection with reachable at each step enabled. (des...197
(forward)formula 0,1,0.152854,8924,1,0,224,34099,126,127,1056,40836,259
FORMULA SmartHome-PT-09-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 206/206 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 144 transition count 185
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 144 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 144 transition count 184
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 133 transition count 173
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 133 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 133 transition count 172
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 127 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 127 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 124 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 123 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 123 transition count 162
Applied a total of 86 rules in 9 ms. Remains 123 /165 variables (removed 42) and now considering 162/206 (removed 44) transitions.
// Phase 1: matrix 162 rows 123 cols
[2024-05-30 01:20:07] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 01:20:07] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 01:20:07] [INFO ] Invariant cache hit.
[2024-05-30 01:20:07] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 01:20:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 287 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 12776ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 12780ms
Starting structural reductions in LTL mode, iteration 1 : 123/165 places, 162/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12987 ms. Remains : 123/165 places, 162/206 transitions.
[2024-05-30 01:20:20] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:20:20] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:20:20] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 01:20:20] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:20:20] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:20:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7903743644468437600.gal : 3 ms
[2024-05-30 01:20:20] [INFO ] Time to serialize properties into /tmp/CTLFireability3611903799058134446.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7903743644468437600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3611903799058134446.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34357e+09,0.304641,9256,2,1361,5,25321,6,0,650,28038,0


Converting to forward existential form...Done !
original formula: EX(AF((p81==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((p81==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t61, t64, t81, t84, t102, t105, t117, t136, t139, t147, Intersection...242
(forward)formula 0,0,6.71223,145432,1,0,523,861455,347,301,3617,984190,670
FORMULA SmartHome-PT-09-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2024-05-30 01:20:27] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:20:27] [INFO ] Flatten gal took : 8 ms
Total runtime 195093 ms.

BK_STOP 1717032027120

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-09, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683811400402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-09.tgz
mv SmartHome-PT-09 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;