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-171683811300362.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-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811300362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Apr 12 03:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 03:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 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 35K 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-04-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-04-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-04-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-04-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-04-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717029598454

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 00:40:00] [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 00:40:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:40:00] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-05-30 00:40:00] [INFO ] Transformed 139 places.
[2024-05-30 00:40:00] [INFO ] Transformed 159 transitions.
[2024-05-30 00:40:00] [INFO ] Found NUPN structural information;
[2024-05-30 00:40:00] [INFO ] Parsed PT model containing 139 places and 159 transitions and 361 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 144 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 19 transitions.
FORMULA SmartHome-PT-04-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 140/140 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 110 transition count 128
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 126
Applied a total of 28 rules in 85 ms. Remains 108 /122 variables (removed 14) and now considering 126/140 (removed 14) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-30 00:40:01] [INFO ] Computed 7 invariants in 30 ms
[2024-05-30 00:40:01] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-30 00:40:01] [INFO ] Invariant cache hit.
[2024-05-30 00:40:01] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-30 00:40:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 00:40:03] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 30 ms to minimize.
[2024-05-30 00:40:03] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
[2024-05-30 00:40:03] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 3 ms to minimize.
[2024-05-30 00:40:03] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 5 ms to minimize.
[2024-05-30 00:40:03] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
[2024-05-30 00:40:04] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 3 ms to minimize.
[2024-05-30 00:40:04] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-30 00:40:04] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 3 ms to minimize.
[2024-05-30 00:40:04] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-30 00:40:04] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-30 00:40:04] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-30 00:40:04] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-30 00:40:04] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/234 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/234 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 128 constraints, problems are : Problem set: 0 solved, 125 unsolved in 7145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/234 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 125/253 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 00:40:11] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-30 00:40:12] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-30 00:40:13] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 00:40:13] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 257 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9349 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 17/17 constraints]
After SMT, in 16657ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 16688ms
Starting structural reductions in LTL mode, iteration 1 : 108/122 places, 126/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17598 ms. Remains : 108/122 places, 126/140 transitions.
Support contains 63 out of 108 places after structural reductions.
[2024-05-30 00:40:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 00:40:18] [INFO ] Flatten gal took : 57 ms
FORMULA SmartHome-PT-04-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:40:18] [INFO ] Flatten gal took : 20 ms
[2024-05-30 00:40:19] [INFO ] Input system was already deterministic with 126 transitions.
Support contains 60 out of 108 places (down from 63) after GAL structural reductions.
RANDOM walk for 40000 steps (433 resets) in 2037 ms. (19 steps per ms) remains 6/54 properties
BEST_FIRST walk for 40003 steps (101 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (97 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (100 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (66 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
[2024-05-30 00:40:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/108 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 126/234 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/234 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 115 constraints, problems are : Problem set: 3 solved, 3 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/100 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-30 00:40:20] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-30 00:40:20] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-30 00:40:20] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-30 00:40:20] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-30 00:40:20] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-05-30 00:40:20] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 6/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/108 variables, 2/13 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 126/234 variables, 108/121 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 2/123 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 123 constraints, problems are : Problem set: 4 solved, 2 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 676ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 270 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 126/126 transitions.
Graph (trivial) has 101 edges and 108 vertex of which 49 / 108 are part of one of the 3 SCC in 6 ms
Free SCC test removed 46 places
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 62 transition count 49
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 45 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 43 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 41 place count 43 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 41 transition count 43
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 55 place count 31 transition count 33
Iterating global reduction 3 with 10 rules applied. Total rules applied 65 place count 31 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 31 transition count 31
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 89 place count 20 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 44 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 6 rules applied. Total rules applied 95 place count 18 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 98 place count 18 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 101 place count 15 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 102 place count 14 transition count 10
Reduce places removed 2 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 4 rules applied. Total rules applied 106 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 108 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 108 place count 10 transition count 6
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 112 place count 8 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 113 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 113 place count 7 transition count 5
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 115 place count 6 transition count 5
Applied a total of 115 rules in 63 ms. Remains 6 /108 variables (removed 102) and now considering 5/126 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 6/108 places, 5/126 transitions.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/2 properties
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2024-05-30 00:40:21] [INFO ] Flatten gal took : 17 ms
[2024-05-30 00:40:21] [INFO ] Flatten gal took : 17 ms
[2024-05-30 00:40:21] [INFO ] Input system was already deterministic with 126 transitions.
Support contains 54 out of 108 places (down from 58) after GAL structural reductions.
Computed a total of 14 stabilizing places and 14 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 87 transition count 105
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 87 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 87 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 82 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 82 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 79 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 79 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 77 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 77 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 76 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 76 transition count 92
Applied a total of 66 rules in 40 ms. Remains 76 /108 variables (removed 32) and now considering 92/126 (removed 34) transitions.
// Phase 1: matrix 92 rows 76 cols
[2024-05-30 00:40:21] [INFO ] Computed 7 invariants in 4 ms
[2024-05-30 00:40:21] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 00:40:21] [INFO ] Invariant cache hit.
[2024-05-30 00:40:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-30 00:40:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:40:22] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-30 00:40:22] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-30 00:40:22] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/168 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 86 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2446 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/168 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 91/177 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:40:25] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/168 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 178 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints]
After SMT, in 5484ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 5488ms
Starting structural reductions in LTL mode, iteration 1 : 76/108 places, 92/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5701 ms. Remains : 76/108 places, 92/126 transitions.
[2024-05-30 00:40:26] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:40:26] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:40:26] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-30 00:40:26] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:40:26] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:40:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1598713503816422333.gal : 5 ms
[2024-05-30 00:40:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11507573665793633194.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/CTLFireability1598713503816422333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11507573665793633194.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,326405,0.091175,4588,2,529,5,5377,6,0,398,5432,0


Converting to forward existential form...Done !
original formula: (EG(EF((p81==1))) * EF(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU((Init * EG(E(TRUE U (p81==1)))),TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t10, t30, t32, t77, Intersection with reachable at each step enabled. (destroyed...191
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.534394,13024,1,0,139,46822,214,90,2545,43246,223
FORMULA SmartHome-PT-04-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Graph (trivial) has 98 edges and 108 vertex of which 33 / 108 are part of one of the 3 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 77 transition count 65
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 29 rules applied. Total rules applied 53 place count 54 transition count 59
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 59 place count 51 transition count 56
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 48 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 62 place count 48 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 68 place count 45 transition count 53
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 79 place count 34 transition count 42
Iterating global reduction 4 with 11 rules applied. Total rules applied 90 place count 34 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 34 transition count 40
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 114 place count 23 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 115 place count 23 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 120 place count 23 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 122 place count 21 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 124 place count 19 transition count 20
Applied a total of 124 rules in 28 ms. Remains 19 /108 variables (removed 89) and now considering 20/126 (removed 106) transitions.
[2024-05-30 00:40:27] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 19 cols
[2024-05-30 00:40:27] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 00:40:27] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 00:40:27] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-30 00:40:27] [INFO ] Invariant cache hit.
[2024-05-30 00:40:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-30 00:40:27] [INFO ] Redundant transitions in 1 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 00:40:27] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-30 00:40:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 17/36 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/37 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 17/36 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 35 constraints, problems are : Problem set: 0 solved, 11 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 333ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/108 places, 20/126 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 470 ms. Remains : 19/108 places, 20/126 transitions.
[2024-05-30 00:40:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:40:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:40:28] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-30 00:40:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:40:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:40:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4149502435534117378.gal : 2 ms
[2024-05-30 00:40:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1274433375288755430.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/CTLFireability4149502435534117378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1274433375288755430.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,288,0.007231,3424,2,50,5,298,6,0,96,199,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(EG((p28==1))) + AG((p70==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(EG((p28==1))))) + !(E(TRUE U !((p70==0)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.034571,4268,1,0,45,4230,29,33,484,4166,37
FORMULA SmartHome-PT-04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Graph (trivial) has 92 edges and 108 vertex of which 25 / 108 are part of one of the 2 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 84 transition count 70
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 34 rules applied. Total rules applied 61 place count 58 transition count 62
Reduce places removed 5 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 7 rules applied. Total rules applied 68 place count 53 transition count 60
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 70 place count 52 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 51 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 71 place count 51 transition count 53
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 83 place count 45 transition count 53
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 96 place count 32 transition count 40
Iterating global reduction 5 with 13 rules applied. Total rules applied 109 place count 32 transition count 40
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 5 with 5 rules applied. Total rules applied 114 place count 32 transition count 35
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 116 place count 31 transition count 34
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 132 place count 23 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 136 place count 23 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 137 place count 22 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 139 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 7 edges and 19 vertex of which 2 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 141 place count 18 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 143 place count 18 transition count 18
Applied a total of 143 rules in 26 ms. Remains 18 /108 variables (removed 90) and now considering 18/126 (removed 108) transitions.
[2024-05-30 00:40:28] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 18 cols
[2024-05-30 00:40:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 00:40:28] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 00:40:28] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-30 00:40:28] [INFO ] Invariant cache hit.
[2024-05-30 00:40:28] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-30 00:40:28] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 00:40:28] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-30 00:40:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 3/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 16/34 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/35 variables, and 23 constraints, problems are : Problem set: 0 solved, 11 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 3/18 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 16/34 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/35 variables, and 34 constraints, problems are : Problem set: 0 solved, 11 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 380ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/108 places, 18/126 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 511 ms. Remains : 18/108 places, 18/126 transitions.
[2024-05-30 00:40:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:40:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:40:28] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-30 00:40:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:40:28] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:40:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9320974688627617204.gal : 1 ms
[2024-05-30 00:40:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4258741981701903133.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/CTLFireability9320974688627617204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4258741981701903133.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,216,0.004885,3420,2,58,5,272,6,0,91,201,0


Converting to forward existential form...Done !
original formula: AG(((p83==0) + AG((p94==0))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((p83==0))),TRUE) * !((p94==0)))] = FALSE
(forward)formula 0,0,0.006337,3736,1,0,10,363,12,4,172,349,4
FORMULA SmartHome-PT-04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 88 transition count 106
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 88 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 88 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 83 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 83 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 80 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 80 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 78 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 78 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 77 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 77 transition count 92
Applied a total of 65 rules in 15 ms. Remains 77 /108 variables (removed 31) and now considering 92/126 (removed 34) transitions.
// Phase 1: matrix 92 rows 77 cols
[2024-05-30 00:40:28] [INFO ] Computed 7 invariants in 2 ms
[2024-05-30 00:40:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 00:40:28] [INFO ] Invariant cache hit.
[2024-05-30 00:40:28] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-30 00:40:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:40:29] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-30 00:40:29] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/169 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 86 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/169 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 91/177 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:40:32] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/169 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 178 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints]
After SMT, in 5999ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 6000ms
Starting structural reductions in LTL mode, iteration 1 : 77/108 places, 92/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6157 ms. Remains : 77/108 places, 92/126 transitions.
[2024-05-30 00:40:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:40:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:40:34] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-30 00:40:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:40:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:40:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3536687752879908893.gal : 4 ms
[2024-05-30 00:40:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1566324900531748207.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/CTLFireability3536687752879908893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1566324900531748207.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,352955,0.090284,5188,2,595,5,7388,6,0,402,7046,0


Converting to forward existential form...Done !
original formula: (AG(EX(TRUE)) + EG(((AX((p22==1)) * (AX((p28==0)) + EG((p70==0)))) * (p35==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(((!(EX(!((p22==1)))) * (!(EX(!((p28==0)))) + EG((p70==0)))) * (p35==1))))),TRUE) * !(EX(TRUE...167
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t10, t30, t58, t78, Intersection with reachable at each step enabled. (destroyed...191
(forward)formula 0,0,1.54801,38544,1,0,372,225482,217,210,2343,200286,474
FORMULA SmartHome-PT-04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 92 transition count 110
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 92 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 92 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 90 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 90 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 89 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 89 transition count 104
Applied a total of 41 rules in 10 ms. Remains 89 /108 variables (removed 19) and now considering 104/126 (removed 22) transitions.
// Phase 1: matrix 104 rows 89 cols
[2024-05-30 00:40:36] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:40:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 00:40:36] [INFO ] Invariant cache hit.
[2024-05-30 00:40:36] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-30 00:40:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-30 00:40:37] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-30 00:40:37] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-30 00:40:37] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 2 ms to minimize.
[2024-05-30 00:40:37] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 3 ms to minimize.
[2024-05-30 00:40:37] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 5 ms to minimize.
[2024-05-30 00:40:37] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 00:40:37] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 00:40:38] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/193 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 104 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-30 00:40:41] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/193 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 103/208 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-30 00:40:41] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 209 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 10/10 constraints]
After SMT, in 8053ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 8057ms
Starting structural reductions in LTL mode, iteration 1 : 89/108 places, 104/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8224 ms. Remains : 89/108 places, 104/126 transitions.
[2024-05-30 00:40:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:40:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:40:44] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-30 00:40:44] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:40:44] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:40:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12079153987403965766.gal : 2 ms
[2024-05-30 00:40:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16936330702600235866.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/CTLFireability12079153987403965766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16936330702600235866.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,517491,0.056096,5248,2,850,5,7845,6,0,462,6160,0


Converting to forward existential form...Done !
original formula: AG((((((A(((p83==1)&&(p132==1)) U (p62!=1)) + EG(((p28==0)&&((p83==0)||(p133==0))))) + ((p36==1)||(p80==1))) + (((p77==1)||(p100==1))||((...277
=> equivalent forward existential formula: (([(FwdU(((((FwdU(Init,TRUE) * !((p78==1))) * !((((p77==1)||(p100==1))||((p67==1)||(p107==1))))) * !(((p36==1)||...675
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t11, t36, t38, t41, t90, Intersection with reachable at each step enabled. (destroye...193
(forward)formula 0,0,0.428313,15808,1,0,152,60008,232,102,2616,50280,239
FORMULA SmartHome-PT-04-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 89 transition count 107
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 89 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 89 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 86 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 85 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 84 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 84 transition count 99
Applied a total of 51 rules in 10 ms. Remains 84 /108 variables (removed 24) and now considering 99/126 (removed 27) transitions.
// Phase 1: matrix 99 rows 84 cols
[2024-05-30 00:40:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:40:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 00:40:45] [INFO ] Invariant cache hit.
[2024-05-30 00:40:45] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-30 00:40:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 00:40:45] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-30 00:40:45] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 00:40:46] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-30 00:40:46] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-30 00:40:46] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-30 00:40:46] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-30 00:40:46] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-30 00:40:46] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 5 ms to minimize.
[2024-05-30 00:40:46] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/183 variables, 84/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 100 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3300 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-30 00:40:49] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/183 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 98/199 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 199 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2640 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 10/10 constraints]
After SMT, in 5955ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5957ms
Starting structural reductions in LTL mode, iteration 1 : 84/108 places, 99/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6113 ms. Remains : 84/108 places, 99/126 transitions.
[2024-05-30 00:40:51] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:40:51] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:40:51] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-30 00:40:51] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:40:51] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:40:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5577210400796423957.gal : 4 ms
[2024-05-30 00:40:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17518699601090053321.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/CTLFireability5577210400796423957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17518699601090053321.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,506405,0.053399,5224,2,806,5,7151,6,0,437,6746,0


Converting to forward existential form...Done !
original formula: (!(A(!(E((p121==1) U (p31==1))) U E(A((p59==1) U ((p83==1)&&(p120==1))) U ((p73==1)&&(p36==1))))) * AG((((p84==1) * AF((p119==0))) + EX(T...162
=> equivalent forward existential formula: ([((Init * !(EG(!(E(!((E(!(((p83==1)&&(p120==1))) U (!((p59==1)) * !(((p83==1)&&(p120==1))))) + EG(!(((p83==1)&&...649
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t11, t31, t36, t38, t85, Intersection with reachable at each step enabled. (dest...196
(forward)formula 0,0,0.355885,14200,1,0,141,42827,225,92,2399,47194,212
FORMULA SmartHome-PT-04-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 88 transition count 106
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 88 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 88 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 83 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 83 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 80 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 80 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 78 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 78 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 77 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 77 transition count 92
Applied a total of 65 rules in 6 ms. Remains 77 /108 variables (removed 31) and now considering 92/126 (removed 34) transitions.
// Phase 1: matrix 92 rows 77 cols
[2024-05-30 00:40:51] [INFO ] Computed 7 invariants in 2 ms
[2024-05-30 00:40:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 00:40:51] [INFO ] Invariant cache hit.
[2024-05-30 00:40:51] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-30 00:40:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:40:52] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-30 00:40:52] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-30 00:40:52] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 2 ms to minimize.
[2024-05-30 00:40:52] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 00:40:52] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 00:40:52] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:40:53] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:40:53] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/169 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 92 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3277 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:40:55] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/169 variables, 77/93 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 91/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 184 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2602 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 9/9 constraints]
After SMT, in 5893ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 5895ms
Starting structural reductions in LTL mode, iteration 1 : 77/108 places, 92/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6045 ms. Remains : 77/108 places, 92/126 transitions.
[2024-05-30 00:40:57] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:40:57] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:40:57] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-30 00:40:57] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:40:57] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:40:57] [INFO ] Time to serialize gal into /tmp/CTLFireability104435759895015528.gal : 2 ms
[2024-05-30 00:40:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5199084301736326309.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/CTLFireability104435759895015528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5199084301736326309.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 -...282
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,334853,0.081708,4924,2,603,5,6865,6,0,402,6441,0


Converting to forward existential form...Done !
original formula: AX((EF(AG((p127==1))) + (AX(((p0==0) * AF((p65==0)))) * (((p90==1)||(((p12==1)&&(p43==1))&&((p91==1)&&(p126==1))))||(((p35==1)&&(p115==1)...172
=> equivalent forward existential formula: (([(EY((EY(Init) * !(E(TRUE U !(E(TRUE U !((p127==1)))))))) * !((p0==0)))] = FALSE * [FwdG(EY((EY(Init) * !(E(TR...380
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t10, t28, t31, t59, t78, Intersection with reachable at each step enabled. (dest...196
(forward)formula 0,0,0.405818,10984,1,0,127,35255,208,82,2313,29405,196
FORMULA SmartHome-PT-04-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Graph (trivial) has 76 edges and 108 vertex of which 4 / 108 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 105 transition count 90
Reduce places removed 32 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 42 rules applied. Total rules applied 75 place count 73 transition count 80
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 84 place count 67 transition count 77
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 89 place count 64 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 63 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 90 place count 63 transition count 69
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 102 place count 57 transition count 69
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 117 place count 42 transition count 54
Iterating global reduction 5 with 15 rules applied. Total rules applied 132 place count 42 transition count 54
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 5 with 5 rules applied. Total rules applied 137 place count 42 transition count 49
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 139 place count 41 transition count 48
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 165 place count 28 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 166 place count 28 transition count 34
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 171 place count 28 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 172 place count 27 transition count 29
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 173 place count 27 transition count 29
Applied a total of 173 rules in 32 ms. Remains 27 /108 variables (removed 81) and now considering 29/126 (removed 97) transitions.
// Phase 1: matrix 29 rows 27 cols
[2024-05-30 00:40:58] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 00:40:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 00:40:58] [INFO ] Invariant cache hit.
[2024-05-30 00:40:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 00:40:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-30 00:40:58] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-30 00:40:58] [INFO ] Invariant cache hit.
[2024-05-30 00:40:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/56 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 28 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/56 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 63 constraints, problems are : Problem set: 0 solved, 28 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1112ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/108 places, 29/126 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1261 ms. Remains : 27/108 places, 29/126 transitions.
[2024-05-30 00:40:59] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:40:59] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:40:59] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 00:40:59] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:40:59] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:40:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7126734987845308528.gal : 0 ms
[2024-05-30 00:40:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13525263628207620832.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/CTLFireability7126734987845308528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13525263628207620832.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,1891,0.007779,3496,2,92,5,698,6,0,138,495,0


Converting to forward existential form...Done !
original formula: E(EF((E((((p6==1)||(p30==1))||(p55!=1)) U AG((p74==1))) + EF((p83!=1)))) U (!(EG((p115!=1))) * (AG((p28==1)) + (p0==1))))
=> equivalent forward existential formula: ([((FwdU(Init,E(TRUE U (E((((p6==1)||(p30==1))||(p55!=1)) U !(E(TRUE U !((p74==1))))) + E(TRUE U (p83!=1))))) * ...363
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 24/0/5
(forward)formula 0,0,0.025807,4604,1,0,17,4015,36,7,733,2312,25
FORMULA SmartHome-PT-04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 87 transition count 105
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 87 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 87 transition count 102
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 83 transition count 98
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 83 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 80 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 80 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 78 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 78 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 77 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 77 transition count 92
Applied a total of 65 rules in 6 ms. Remains 77 /108 variables (removed 31) and now considering 92/126 (removed 34) transitions.
// Phase 1: matrix 92 rows 77 cols
[2024-05-30 00:40:59] [INFO ] Computed 7 invariants in 3 ms
[2024-05-30 00:40:59] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 00:40:59] [INFO ] Invariant cache hit.
[2024-05-30 00:40:59] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-30 00:40:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:41:00] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-30 00:41:00] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/169 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 86 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/169 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 91/177 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:41:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:41:03] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-30 00:41:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 180 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3834 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 5/5 constraints]
After SMT, in 5899ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 5901ms
Starting structural reductions in LTL mode, iteration 1 : 77/108 places, 92/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6064 ms. Remains : 77/108 places, 92/126 transitions.
[2024-05-30 00:41:05] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:05] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:41:05] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-30 00:41:05] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:05] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:41:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15695878383187488967.gal : 2 ms
[2024-05-30 00:41:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1121303882496828321.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/CTLFireability15695878383187488967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1121303882496828321.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,353605,0.059961,4656,2,497,5,4716,6,0,402,4617,0


Converting to forward existential form...Done !
original formula: E(AX(EF((p94==1))) U A(AF((p31==1)) U AF(EG(AG((p64==1))))))
=> equivalent forward existential formula: [((FwdU(Init,!(EX(!(E(TRUE U (p94==1)))))) * !(EG(!(!(EG(!(EG(!(E(TRUE U !((p64==1)))))))))))) * !(E(!(!(EG(!(EG...268
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t32, t78, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,1.21373,34132,1,0,359,196682,220,214,2329,181939,487
FORMULA SmartHome-PT-04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 87 transition count 105
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 87 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 87 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 82 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 82 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 79 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 79 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 78 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 78 transition count 93
Applied a total of 63 rules in 6 ms. Remains 78 /108 variables (removed 30) and now considering 93/126 (removed 33) transitions.
// Phase 1: matrix 93 rows 78 cols
[2024-05-30 00:41:06] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:41:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 00:41:06] [INFO ] Invariant cache hit.
[2024-05-30 00:41:06] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 00:41:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-30 00:41:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-30 00:41:07] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/171 variables, 78/87 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/171 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 87 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2755 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/171 variables, 78/87 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 92/179 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-30 00:41:11] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/171 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 180 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3431 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 3/3 constraints]
After SMT, in 6202ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 6205ms
Starting structural reductions in LTL mode, iteration 1 : 78/108 places, 93/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6374 ms. Remains : 78/108 places, 93/126 transitions.
[2024-05-30 00:41:13] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:41:13] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:13] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-30 00:41:13] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:13] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2205342044053195551.gal : 2 ms
[2024-05-30 00:41:13] [INFO ] Time to serialize properties into /tmp/CTLFireability13638652671939669291.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/CTLFireability2205342044053195551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13638652671939669291.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,331355,0.069714,4660,2,516,5,5334,6,0,407,5409,0


Converting to forward existential form...Done !
original formula: AF((EF((AG(((p36==1)&&(p120==1))) * AF(((p115==1)&&(p124==1))))) * AX((((p63==1)&&((p61==1)||(p131==1)))||(p29==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (!(E(TRUE U !(((p36==1)&&(p120==1))))) * !(EG(!(((p115==1)&&(p124==1))))))) * !(EX(!((((p...211
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t32, t79, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,1.22845,36072,1,0,397,208136,220,218,2511,189834,499
FORMULA SmartHome-PT-04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 87 transition count 105
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 87 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 87 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 82 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 82 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 79 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 79 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 77 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 77 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 76 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 76 transition count 91
Applied a total of 67 rules in 4 ms. Remains 76 /108 variables (removed 32) and now considering 91/126 (removed 35) transitions.
// Phase 1: matrix 91 rows 76 cols
[2024-05-30 00:41:14] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:41:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 00:41:14] [INFO ] Invariant cache hit.
[2024-05-30 00:41:14] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-30 00:41:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 00:41:15] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-30 00:41:15] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/167 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/167 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 85 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2685 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/167 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 90/175 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 00:41:18] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 176 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2699 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 3/3 constraints]
After SMT, in 5400ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5403ms
Starting structural reductions in LTL mode, iteration 1 : 76/108 places, 91/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5537 ms. Remains : 76/108 places, 91/126 transitions.
[2024-05-30 00:41:20] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:20] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:20] [INFO ] Input system was already deterministic with 91 transitions.
[2024-05-30 00:41:20] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:20] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7392233964826005839.gal : 2 ms
[2024-05-30 00:41:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1344942851479963097.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/CTLFireability7392233964826005839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1344942851479963097.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,322085,0.056757,5180,2,637,5,6965,6,0,397,8096,0


Converting to forward existential form...Done !
original formula: EX((p11==1))
=> equivalent forward existential formula: [(EY(Init) * (p11==1))] != FALSE
(forward)formula 0,0,0.059946,5444,1,0,8,6965,8,1,484,8096,2
FORMULA SmartHome-PT-04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 89 transition count 107
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 89 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 89 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 84 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 84 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 81 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 81 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 80 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 80 transition count 95
Applied a total of 59 rules in 8 ms. Remains 80 /108 variables (removed 28) and now considering 95/126 (removed 31) transitions.
// Phase 1: matrix 95 rows 80 cols
[2024-05-30 00:41:20] [INFO ] Computed 7 invariants in 0 ms
[2024-05-30 00:41:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 00:41:20] [INFO ] Invariant cache hit.
[2024-05-30 00:41:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-30 00:41:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 00:41:21] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-30 00:41:21] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/175 variables, 80/89 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/175 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 89 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2950 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/175 variables, 80/89 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 94/183 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 00:41:24] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 00:41:24] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 185 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2830 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints]
After SMT, in 5800ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5803ms
Starting structural reductions in LTL mode, iteration 1 : 80/108 places, 95/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5969 ms. Remains : 80/108 places, 95/126 transitions.
[2024-05-30 00:41:26] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:41:26] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:26] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-30 00:41:26] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:26] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:41:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17146634024284394039.gal : 1 ms
[2024-05-30 00:41:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7815152365360143681.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/CTLFireability17146634024284394039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7815152365360143681.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,356855,0.06312,5204,2,711,5,8079,6,0,417,7644,0


Converting to forward existential form...Done !
original formula: E(AF(!(AX(FALSE))) U ((p61==1) + ((AX(AX(A((p7==1) U (p107==1)))) * EX(AG((p9==1)))) * AG((p41==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,!(EG(!(!(!(EX(!(FALSE)))))))) * (p61==1))] != FALSE + [((FwdU(Init,!(EG(!(!(!(EX(!(FALSE)))))))) * ...316
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t32, t61, t81, Intersection with reachable at each step enabled. (destroyed/rev...187
Using saturation style SCC detection
(forward)formula 0,1,1.94336,60304,1,0,345,243718,218,247,2415,415041,449
FORMULA SmartHome-PT-04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 87 transition count 105
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 87 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 87 transition count 102
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 83 transition count 98
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 83 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 81 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 81 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 79 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 79 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 78 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 78 transition count 93
Applied a total of 63 rules in 9 ms. Remains 78 /108 variables (removed 30) and now considering 93/126 (removed 33) transitions.
// Phase 1: matrix 93 rows 78 cols
[2024-05-30 00:41:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:41:28] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 00:41:28] [INFO ] Invariant cache hit.
[2024-05-30 00:41:28] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-30 00:41:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-30 00:41:29] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-30 00:41:29] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-30 00:41:29] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-30 00:41:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-30 00:41:29] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/171 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/171 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 90 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3274 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-30 00:41:32] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 93/171 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 92/183 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-30 00:41:32] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-30 00:41:33] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 185 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4241 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 8/8 constraints]
After SMT, in 7534ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 7536ms
Starting structural reductions in LTL mode, iteration 1 : 78/108 places, 93/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7694 ms. Remains : 78/108 places, 93/126 transitions.
[2024-05-30 00:41:35] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:35] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:35] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-30 00:41:35] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:41:35] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:41:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4369545529076646033.gal : 1 ms
[2024-05-30 00:41:35] [INFO ] Time to serialize properties into /tmp/CTLFireability725613740642360904.ctl : 6 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/CTLFireability4369545529076646033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability725613740642360904.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 -...282
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,468605,0.083244,4928,2,687,5,6612,6,0,407,6262,0


Converting to forward existential form...Done !
original formula: (AF(EX(((p122!=1)||(p79==0)))) + EX(TRUE))
=> equivalent forward existential formula: [FwdG((Init * !(EX(TRUE))),!(EX(((p122!=1)||(p79==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t11, t31, t34, t79, Intersection with reachable at each step enabled. (destroyed...191
(forward)formula 0,1,0.446455,12056,1,0,132,33908,208,84,2249,37816,203
FORMULA SmartHome-PT-04-CTLFireability-2023-14 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 : 108/108 places, 126/126 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 87 transition count 105
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 87 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 87 transition count 102
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 83 transition count 98
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 83 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 80 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 80 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 78 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 78 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 77 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 77 transition count 92
Applied a total of 65 rules in 11 ms. Remains 77 /108 variables (removed 31) and now considering 92/126 (removed 34) transitions.
// Phase 1: matrix 92 rows 77 cols
[2024-05-30 00:41:36] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:41:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 00:41:36] [INFO ] Invariant cache hit.
[2024-05-30 00:41:36] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-30 00:41:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:41:37] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 00:41:37] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 00:41:37] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 2 ms to minimize.
[2024-05-30 00:41:37] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-30 00:41:37] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-30 00:41:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/169 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 90 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3081 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/169 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 91/181 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 181 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2493 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints]
After SMT, in 5594ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 5596ms
Starting structural reductions in LTL mode, iteration 1 : 77/108 places, 92/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5769 ms. Remains : 77/108 places, 92/126 transitions.
[2024-05-30 00:41:42] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:41:42] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:41:42] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-30 00:41:42] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:41:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:41:42] [INFO ] Time to serialize gal into /tmp/CTLFireability506716863107000266.gal : 1 ms
[2024-05-30 00:41:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2132426175703997058.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/CTLFireability506716863107000266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2132426175703997058.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 -...282
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,353585,0.064988,4660,2,493,5,4838,6,0,402,4850,0


Converting to forward existential form...Done !
original formula: EX(EF(((EG((p15==1)) + (p2!=1)) + ((p36!=1) + EG((p19==1))))))
=> equivalent forward existential formula: (([FwdG(FwdU(EY(Init),TRUE),(p15==1))] != FALSE + [(FwdU(EY(Init),TRUE) * (p2!=1))] != FALSE) + ([(FwdU(EY(Init)...233
Hit Full ! (commute/partial/dont) 90/0/2
(forward)formula 0,1,0.242791,8092,1,0,13,23222,20,3,1960,12712,15
FORMULA SmartHome-PT-04-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 00:41:42] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:41:42] [INFO ] Flatten gal took : 3 ms
Total runtime 102067 ms.

BK_STOP 1717029702425

--------------------
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-04"
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-04, 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-171683811300362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-04.tgz
mv SmartHome-PT-04 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 ;