fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r378-smll-171683811400386
Last Updated
July 7, 2024

About the Execution of ITS-Tools for SmartHome-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
539.523 204297.00 250016.00 789.50 FFFFFTFFTTFFTTTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 03:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 03:47 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 63K 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-07-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-07-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-07-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-07-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-07-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-07-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717030959354

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:02:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:02:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:02:41] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-30 01:02:41] [INFO ] Transformed 251 places.
[2024-05-30 01:02:41] [INFO ] Transformed 290 transitions.
[2024-05-30 01:02:41] [INFO ] Found NUPN structural information;
[2024-05-30 01:02:41] [INFO ] Parsed PT model containing 251 places and 290 transitions and 658 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 30 transitions.
FORMULA SmartHome-PT-07-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 260
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 46 place count 176 transition count 221
Iterating global reduction 1 with 39 rules applied. Total rules applied 85 place count 176 transition count 221
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 90 place count 176 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 171 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 171 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 170 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 170 transition count 210
Applied a total of 102 rules in 79 ms. Remains 170 /222 variables (removed 52) and now considering 210/260 (removed 50) transitions.
// Phase 1: matrix 210 rows 170 cols
[2024-05-30 01:02:42] [INFO ] Computed 3 invariants in 19 ms
[2024-05-30 01:02:42] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-30 01:02:42] [INFO ] Invariant cache hit.
[2024-05-30 01:02:42] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 01:02:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/380 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 173 constraints, problems are : Problem set: 0 solved, 209 unsolved in 12028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/380 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 209/382 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 382 constraints, problems are : Problem set: 0 solved, 209 unsolved in 8829 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 21050ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 21100ms
Starting structural reductions in LTL mode, iteration 1 : 170/222 places, 210/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21939 ms. Remains : 170/222 places, 210/260 transitions.
Support contains 62 out of 170 places after structural reductions.
[2024-05-30 01:03:04] [INFO ] Flatten gal took : 82 ms
[2024-05-30 01:03:04] [INFO ] Flatten gal took : 31 ms
[2024-05-30 01:03:04] [INFO ] Input system was already deterministic with 210 transitions.
RANDOM walk for 40000 steps (272 resets) in 2306 ms. (17 steps per ms) remains 3/52 properties
BEST_FIRST walk for 40003 steps (33 resets) in 276 ms. (144 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
[2024-05-30 01:03:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/53 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/58 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 91/149 variables, 27/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 98/247 variables, 50/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/248 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 69/317 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 45/362 variables, 25/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/376 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/376 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/380 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/380 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/380 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/53 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/58 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/149 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 98/247 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/248 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 69/317 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/317 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 45/362 variables, 25/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 14/376 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/380 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/380 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/380 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 210/210 transitions.
Graph (trivial) has 163 edges and 170 vertex of which 66 / 170 are part of one of the 5 SCC in 4 ms
Free SCC test removed 61 places
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 109 transition count 78
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 58 rules applied. Total rules applied 103 place count 65 transition count 64
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 58 transition count 64
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 110 place count 58 transition count 60
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 54 transition count 60
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 130 place count 42 transition count 48
Iterating global reduction 3 with 12 rules applied. Total rules applied 142 place count 42 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 145 place count 42 transition count 45
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 41 transition count 44
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 181 place count 24 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 40 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 9 rules applied. Total rules applied 190 place count 23 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 191 place count 23 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 193 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 195 place count 21 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 196 place count 20 transition count 15
Reduce places removed 5 places and 0 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 8 with 11 rules applied. Total rules applied 207 place count 15 transition count 9
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 213 place count 9 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 213 place count 9 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 220 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 220 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 222 place count 4 transition count 5
Applied a total of 222 rules in 47 ms. Remains 4 /170 variables (removed 166) and now considering 5/210 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 4/170 places, 5/210 transitions.
RANDOM walk for 12 steps (1 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
[2024-05-30 01:03:06] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:03:06] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:03:06] [INFO ] Input system was already deterministic with 210 transitions.
Computed a total of 50 stabilizing places and 49 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 149 transition count 189
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 149 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 149 transition count 188
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 139 transition count 178
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 139 transition count 178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 131 transition count 170
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 131 transition count 170
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 128 transition count 167
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 128 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 127 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 127 transition count 166
Applied a total of 87 rules in 21 ms. Remains 127 /170 variables (removed 43) and now considering 166/210 (removed 44) transitions.
// Phase 1: matrix 166 rows 127 cols
[2024-05-30 01:03:06] [INFO ] Computed 3 invariants in 9 ms
[2024-05-30 01:03:06] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 01:03:06] [INFO ] Invariant cache hit.
[2024-05-30 01:03:06] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-30 01:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 130 constraints, problems are : Problem set: 0 solved, 165 unsolved in 7389 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 165/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 295 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 13022ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 13030ms
Starting structural reductions in LTL mode, iteration 1 : 127/170 places, 166/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13337 ms. Remains : 127/170 places, 166/210 transitions.
[2024-05-30 01:03:19] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:03:19] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:03:19] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-30 01:03:19] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:03:19] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:03:19] [INFO ] Time to serialize gal into /tmp/CTLFireability135700071805122512.gal : 5 ms
[2024-05-30 01:03:19] [INFO ] Time to serialize properties into /tmp/CTLFireability570589997419606631.ctl : 3 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/CTLFireability135700071805122512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability570589997419606631.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21299e+09,0.151658,7620,2,1241,5,17499,6,0,670,19349,0


Converting to forward existential form...Done !
original formula: (EX((A((p173==1) U (p44==1)) + AF((p133==1)))) + AG(!(E((p227==1) U (p147==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(EX((!((E(!((p44==1)) U (!((p173==1)) * !((p44==1)))) + EG(!((p44==1))))) + !(EG(!((p133==1...202
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t9, t11, t28, t31, t65, t68, t85, t88, t105, t108, t120, t124, t140, t143, t149, Int...251
Hit Full ! (commute/partial/dont) 164/0/2
(forward)formula 0,0,7.64741,220648,1,0,791,1.29593e+06,374,466,4041,1.57595e+06,1012
FORMULA SmartHome-PT-07-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Graph (trivial) has 169 edges and 170 vertex of which 78 / 170 are part of one of the 6 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 97 transition count 79
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 49 rules applied. Total rules applied 88 place count 59 transition count 68
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 93 place count 54 transition count 68
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 93 place count 54 transition count 63
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 103 place count 49 transition count 63
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 112 place count 40 transition count 54
Iterating global reduction 3 with 9 rules applied. Total rules applied 121 place count 40 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 40 transition count 53
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 152 place count 25 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 162 place count 25 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 164 place count 23 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 164 place count 23 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 21 transition count 26
Applied a total of 167 rules in 25 ms. Remains 21 /170 variables (removed 149) and now considering 26/210 (removed 184) transitions.
[2024-05-30 01:03:27] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2024-05-30 01:03:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:03:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:03:27] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2024-05-30 01:03:27] [INFO ] Invariant cache hit.
[2024-05-30 01:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 01:03:27] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-30 01:03:27] [INFO ] Redundant transitions in 52 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 01:03:27] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2024-05-30 01:03:27] [INFO ] Invariant cache hit.
[2024-05-30 01:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/39 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/42 variables, and 22 constraints, problems are : Problem set: 0 solved, 14 unsolved in 283 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/39 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/41 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 273 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 569ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/170 places, 26/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 773 ms. Remains : 21/170 places, 26/210 transitions.
[2024-05-30 01:03:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:03:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:03:28] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-30 01:03:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:03:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:03:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15105991384451415415.gal : 1 ms
[2024-05-30 01:03:28] [INFO ] Time to serialize properties into /tmp/CTLFireability5223325987614117096.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/CTLFireability15105991384451415415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5223325987614117096.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,1472,0.006042,3448,2,48,5,281,6,0,94,238,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((p108==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (p108==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,0,0.016832,3764,1,0,56,2131,73,29,542,1949,67
FORMULA SmartHome-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Graph (trivial) has 169 edges and 170 vertex of which 78 / 170 are part of one of the 6 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 97 transition count 79
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 49 rules applied. Total rules applied 88 place count 59 transition count 68
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 54 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 53 transition count 67
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 95 place count 53 transition count 63
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 103 place count 49 transition count 63
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 112 place count 40 transition count 54
Iterating global reduction 4 with 9 rules applied. Total rules applied 121 place count 40 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 40 transition count 53
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 152 place count 25 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 162 place count 25 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 164 place count 23 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 164 place count 23 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 21 transition count 26
Applied a total of 167 rules in 20 ms. Remains 21 /170 variables (removed 149) and now considering 26/210 (removed 184) transitions.
[2024-05-30 01:03:28] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2024-05-30 01:03:28] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:03:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 01:03:28] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2024-05-30 01:03:28] [INFO ] Invariant cache hit.
[2024-05-30 01:03:28] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-30 01:03:28] [INFO ] Redundant transitions in 35 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 01:03:28] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2024-05-30 01:03:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/42 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 216 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 295 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 520ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/170 places, 26/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 670 ms. Remains : 21/170 places, 26/210 transitions.
[2024-05-30 01:03:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:03:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:03:28] [INFO ] Input system was already deterministic with 26 transitions.
RANDOM walk for 146 steps (16 resets) in 7 ms. (18 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-07-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:03:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:03:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:03:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7779609087512202843.gal : 1 ms
[2024-05-30 01:03:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4211597628404733022.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7779609087512202843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4211597628404733022.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 146 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 146 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 146 transition count 185
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 135 transition count 174
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 135 transition count 174
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 80 place count 126 transition count 165
Iterating global reduction 1 with 9 rules applied. Total rules applied 89 place count 126 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 126 transition count 164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 123 transition count 161
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 122 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 122 transition count 160
Applied a total of 98 rules in 20 ms. Remains 122 /170 variables (removed 48) and now considering 160/210 (removed 50) transitions.
// Phase 1: matrix 160 rows 122 cols
[2024-05-30 01:03:28] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:03:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 01:03:29] [INFO ] Invariant cache hit.
[2024-05-30 01:03:29] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-30 01:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/282 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 125 constraints, problems are : Problem set: 0 solved, 159 unsolved in 6686 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/282 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 159/284 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4483 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 11199ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 11201ms
Starting structural reductions in LTL mode, iteration 1 : 122/170 places, 160/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11445 ms. Remains : 122/170 places, 160/210 transitions.
[2024-05-30 01:03:40] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:03:40] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:03:40] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-30 01:03:40] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:03:40] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:03:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15896727745230102150.gal : 3 ms
[2024-05-30 01:03:40] [INFO ] Time to serialize properties into /tmp/CTLFireability385061803199656530.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/CTLFireability15896727745230102150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability385061803199656530.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EX((p197==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p197==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t28, t31, t60, t63, t80, t83, t100, t103, t115, t134, t137, t143, Intersection with...237
(forward)formula 0,0,1.01094,24240,1,0,204,94355,336,140,3492,103005,327
FORMULA SmartHome-PT-07-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 146 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 146 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 146 transition count 185
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 135 transition count 174
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 135 transition count 174
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 80 place count 126 transition count 165
Iterating global reduction 1 with 9 rules applied. Total rules applied 89 place count 126 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 126 transition count 164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 123 transition count 161
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 123 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 122 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 122 transition count 160
Applied a total of 98 rules in 13 ms. Remains 122 /170 variables (removed 48) and now considering 160/210 (removed 50) transitions.
// Phase 1: matrix 160 rows 122 cols
[2024-05-30 01:03:41] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:03:41] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 01:03:41] [INFO ] Invariant cache hit.
[2024-05-30 01:03:41] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-30 01:03:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/282 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 125 constraints, problems are : Problem set: 0 solved, 159 unsolved in 6693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/282 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 159/284 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 159 unsolved in 6305 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 13029ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 13031ms
Starting structural reductions in LTL mode, iteration 1 : 122/170 places, 160/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13223 ms. Remains : 122/170 places, 160/210 transitions.
[2024-05-30 01:03:54] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:03:54] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:03:54] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-30 01:03:54] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:03:54] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:03:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8135754523931149865.gal : 7 ms
[2024-05-30 01:03:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17776719116952447240.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/CTLFireability8135754523931149865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17776719116952447240.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (!(E(!(AX(AF((p14==1)))) U (p169==1))) * AX(AX((AG((p208==0)) + AG(EF((p146==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,!(!(EX(!(!(EG(!((p14==1))))))))) * (p169==1))] = FALSE * [(FwdU((EY(EY(Init)) * !(!(E(TRUE U !((p20...207
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t60, t63, t80, t83, t100, t103, t115, t134, t137, t143, Intersection with...237
(forward)formula 0,0,1.37043,40840,1,0,213,204941,344,147,3873,178230,353
FORMULA SmartHome-PT-07-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 146 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 146 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 146 transition count 185
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 136 transition count 175
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 136 transition count 175
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 77 place count 128 transition count 167
Iterating global reduction 1 with 8 rules applied. Total rules applied 85 place count 128 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 128 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 125 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 125 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 124 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 124 transition count 162
Applied a total of 94 rules in 8 ms. Remains 124 /170 variables (removed 46) and now considering 162/210 (removed 48) transitions.
// Phase 1: matrix 162 rows 124 cols
[2024-05-30 01:03:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:03:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 01:03:56] [INFO ] Invariant cache hit.
[2024-05-30 01:03:56] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 01:03:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 127 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5918 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 161/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 288 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4832 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 10776ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 10778ms
Starting structural reductions in LTL mode, iteration 1 : 124/170 places, 162/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10947 ms. Remains : 124/170 places, 162/210 transitions.
[2024-05-30 01:04:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:04:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:04:07] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 01:04:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:04:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:04:07] [INFO ] Time to serialize gal into /tmp/CTLFireability727231405863565520.gal : 2 ms
[2024-05-30 01:04:07] [INFO ] Time to serialize properties into /tmp/CTLFireability18324090321268641539.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/CTLFireability727231405863565520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18324090321268641539.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((EF(((p167==1) * EG((p140==0)))) + (AX(EG((p131==1))) * ((p0==1) + EF((((p2==0)||(p107==0))&&(p45==0)))))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),TRUE) * (p167==1)),(p140==0))] != FALSE + ([((FwdU(Init,TRUE) * !(EX(!(EG((p131==1)...288
Hit Full ! (commute/partial/dont) 160/0/2
(forward)formula 0,1,0.58803,18584,1,0,15,87751,21,5,3101,39197,15
FORMULA SmartHome-PT-07-CTLFireability-2024-05 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 : 170/170 places, 210/210 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 150 transition count 190
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 150 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 150 transition count 189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 143 transition count 182
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 143 transition count 182
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 61 place count 137 transition count 176
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 137 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 137 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 135 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 135 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 134 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 134 transition count 172
Applied a total of 74 rules in 14 ms. Remains 134 /170 variables (removed 36) and now considering 172/210 (removed 38) transitions.
// Phase 1: matrix 172 rows 134 cols
[2024-05-30 01:04:07] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:04:07] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 01:04:07] [INFO ] Invariant cache hit.
[2024-05-30 01:04:07] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-30 01:04:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/306 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 137 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6595 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/306 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 171/308 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 308 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 13690ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 13692ms
Starting structural reductions in LTL mode, iteration 1 : 134/170 places, 172/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13880 ms. Remains : 134/170 places, 172/210 transitions.
[2024-05-30 01:04:21] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:04:21] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:04:21] [INFO ] Input system was already deterministic with 172 transitions.
[2024-05-30 01:04:21] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:04:21] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:04:21] [INFO ] Time to serialize gal into /tmp/CTLFireability400160685172705038.gal : 3 ms
[2024-05-30 01:04:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2225218011482096553.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/CTLFireability400160685172705038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2225218011482096553.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,2.02359e+09,0.290625,8776,2,1569,5,23248,6,0,704,25845,0


Converting to forward existential form...Done !
original formula: !(E(!(AG((p85==1))) U (((!(AX((p27==1))) * (EF((p65==1)) + AX(((p138==1)&&(p246==1))))) + AG((((p48==1)&&(p180==1))||(p174==1)))) + (((AX...263
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,!(!(E(TRUE U !((p85==1)))))) * !(!(EX(!((p27==1)))))),TRUE) * (p65==1))] = FALSE * [((FwdU(...587
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t29, t32, t36, t64, t67, t84, t87, t108, t112, t125, t129, t146, t149, t155, Inters...248
(forward)formula 0,0,8.695,217284,1,0,583,1.29429e+06,386,337,4353,1.49209e+06,740
FORMULA SmartHome-PT-07-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 146 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 146 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 146 transition count 185
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 135 transition count 174
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 135 transition count 174
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 79 place count 127 transition count 166
Iterating global reduction 1 with 8 rules applied. Total rules applied 87 place count 127 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 127 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 125 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 125 transition count 163
Applied a total of 92 rules in 10 ms. Remains 125 /170 variables (removed 45) and now considering 163/210 (removed 47) transitions.
// Phase 1: matrix 163 rows 125 cols
[2024-05-30 01:04:30] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:04:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-30 01:04:30] [INFO ] Invariant cache hit.
[2024-05-30 01:04:30] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-30 01:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/288 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 128 constraints, problems are : Problem set: 0 solved, 162 unsolved in 6970 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/288 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 162/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 290 constraints, problems are : Problem set: 0 solved, 162 unsolved in 6607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 13608ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 13613ms
Starting structural reductions in LTL mode, iteration 1 : 125/170 places, 163/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13914 ms. Remains : 125/170 places, 163/210 transitions.
[2024-05-30 01:04:44] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:04:44] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:04:44] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-30 01:04:44] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:04:44] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:04:44] [INFO ] Time to serialize gal into /tmp/CTLFireability184970215934526123.gal : 2 ms
[2024-05-30 01:04:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14628986461340124846.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/CTLFireability184970215934526123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14628986461340124846.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF((((p118==0) * (AX((p100==0)) + AX(((p45==0)||(p234==0))))) * AG((p76==0)))) * AF(AG(AX(((p188==0)||(p26==0))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((p118==0) * (!(EX(!((p100==0)))) + !(EX(!(((p45==0)||(p234==0))))))) * !(E(TRUE U !((p76=...249
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t33, t62, t65, t83, t86, t103, t106, t118, t137, t140, t146, Intersection with...237
(forward)formula 0,0,4.37755,115808,1,0,419,514365,354,287,3861,819102,500
FORMULA SmartHome-PT-07-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 148 transition count 188
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 148 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 148 transition count 187
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 139 transition count 178
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 139 transition count 178
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 132 transition count 171
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 132 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 132 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 130 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 130 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 129 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 129 transition count 167
Applied a total of 84 rules in 8 ms. Remains 129 /170 variables (removed 41) and now considering 167/210 (removed 43) transitions.
// Phase 1: matrix 167 rows 129 cols
[2024-05-30 01:04:48] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:04:49] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 01:04:49] [INFO ] Invariant cache hit.
[2024-05-30 01:04:49] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-30 01:04:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/296 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 132 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7068 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/296 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 166/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/296 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 298 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 13447ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 13449ms
Starting structural reductions in LTL mode, iteration 1 : 129/170 places, 167/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13673 ms. Remains : 129/170 places, 167/210 transitions.
[2024-05-30 01:05:02] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:05:02] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:05:02] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-30 01:05:02] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:05:02] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:05:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13708746059930446431.gal : 2 ms
[2024-05-30 01:05:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7509580724426998089.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/CTLFireability13708746059930446431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7509580724426998089.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,2.4891e+09,0.185068,8228,2,1524,5,20387,6,0,679,21981,0


Converting to forward existential form...Done !
original formula: EF((((EG(AG(EF((p131==1)))) * (EF(EX((p30==1))) + AG((p46==1)))) * ((!(E((p86==1) U (p185==1))) + AF((p223==0))) + ((p2==1)&&(p185==1))))...207
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * (EG(!(E(TRUE U !(E(TRUE U (p131==1)))))) * (E(TRUE U EX((p30==1))) + !(E(TRUE U !((p46==...604
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t60, t63, t80, t83, t102, t105, t117, t123, t141, t144, t150, Interse...247
(forward)formula 0,1,7.15528,169408,1,0,692,1.0574e+06,393,396,3989,1.06421e+06,906
FORMULA SmartHome-PT-07-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Graph (trivial) has 169 edges and 170 vertex of which 76 / 170 are part of one of the 6 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 99 transition count 80
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 51 rules applied. Total rules applied 92 place count 59 transition count 69
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 97 place count 54 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 97 place count 54 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 105 place count 50 transition count 65
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 115 place count 40 transition count 55
Iterating global reduction 3 with 10 rules applied. Total rules applied 125 place count 40 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 40 transition count 54
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 156 place count 25 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 166 place count 25 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 168 place count 23 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 168 place count 23 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 21 transition count 27
Applied a total of 171 rules in 20 ms. Remains 21 /170 variables (removed 149) and now considering 27/210 (removed 183) transitions.
[2024-05-30 01:05:09] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 21 cols
[2024-05-30 01:05:09] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:05:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 01:05:09] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2024-05-30 01:05:09] [INFO ] Invariant cache hit.
[2024-05-30 01:05:09] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-30 01:05:10] [INFO ] Redundant transitions in 29 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 01:05:10] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2024-05-30 01:05:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/43 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 179 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/42 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 308 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 496ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/170 places, 27/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 638 ms. Remains : 21/170 places, 27/210 transitions.
[2024-05-30 01:05:10] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:05:10] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:05:10] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 48 steps (3 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-07-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:05:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:05:10] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:05:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11260502861527095609.gal : 1 ms
[2024-05-30 01:05:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2173288318905669573.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11260502861527095609.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2173288318905669573.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 147 transition count 187
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 147 transition count 187
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 136 transition count 176
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 136 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 128 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 128 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 128 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 125 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 124 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 124 transition count 163
Applied a total of 93 rules in 11 ms. Remains 124 /170 variables (removed 46) and now considering 163/210 (removed 47) transitions.
// Phase 1: matrix 163 rows 124 cols
[2024-05-30 01:05:10] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:05:10] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 01:05:10] [INFO ] Invariant cache hit.
[2024-05-30 01:05:10] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-30 01:05:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/287 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 127 constraints, problems are : Problem set: 0 solved, 162 unsolved in 6979 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/287 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 162/289 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 289 constraints, problems are : Problem set: 0 solved, 162 unsolved in 6116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 13142ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 13146ms
Starting structural reductions in LTL mode, iteration 1 : 124/170 places, 163/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13411 ms. Remains : 124/170 places, 163/210 transitions.
[2024-05-30 01:05:23] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:05:24] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:05:24] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-30 01:05:24] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:05:24] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:05:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5237335014195621343.gal : 2 ms
[2024-05-30 01:05:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12478561786395274572.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/CTLFireability5237335014195621343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12478561786395274572.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG((E((p185==1) U (p44==1)) * (p6==1))) + AX(AX((A(((p45==1)&&(p222==1)) U (p39==1)) * AX((p111==1))))))
=> equivalent forward existential formula: (([(FwdU(EY(EY((Init * !(EG((E((p185==1) U (p44==1)) * (p6==1))))))),!((p39==1))) * (!(((p45==1)&&(p222==1))) * ...362
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t10, t27, t30, t59, t63, t80, t83, t100, t103, t115, t119, t135, t138, t139, t145, I...253
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.91714,62636,1,0,300,343010,357,190,3861,359887,428
FORMULA SmartHome-PT-07-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 146 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 146 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 146 transition count 185
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 136 transition count 175
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 136 transition count 175
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 77 place count 128 transition count 167
Iterating global reduction 1 with 8 rules applied. Total rules applied 85 place count 128 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 128 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 126 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 126 transition count 164
Applied a total of 90 rules in 4 ms. Remains 126 /170 variables (removed 44) and now considering 164/210 (removed 46) transitions.
// Phase 1: matrix 164 rows 126 cols
[2024-05-30 01:05:25] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:05:26] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 01:05:26] [INFO ] Invariant cache hit.
[2024-05-30 01:05:26] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-30 01:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/290 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 129 constraints, problems are : Problem set: 0 solved, 163 unsolved in 7166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/290 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 163/292 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 292 constraints, problems are : Problem set: 0 solved, 163 unsolved in 6417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 13615ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 13618ms
Starting structural reductions in LTL mode, iteration 1 : 126/170 places, 164/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13865 ms. Remains : 126/170 places, 164/210 transitions.
[2024-05-30 01:05:39] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:05:39] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:05:39] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-30 01:05:39] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:05:39] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:05:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2498563846185622571.gal : 2 ms
[2024-05-30 01:05:39] [INFO ] Time to serialize properties into /tmp/CTLFireability12157328861361963205.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/CTLFireability2498563846185622571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12157328861361963205.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((AG(EX((p178==0))) * (((p186==0)||(p217==1))||(p200==1))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(EX((p178==0))))] = FALSE * [(EY(Init) * !((((p186==0)||(p217==1))||(p200==1))))] = FA...159
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t35, t64, t67, t84, t87, t104, t107, t119, t138, t141, t147, Intersection with...237
(forward)formula 0,0,1.31998,32120,1,0,214,132538,347,146,3888,143715,339
FORMULA SmartHome-PT-07-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 148 transition count 188
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 148 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 148 transition count 187
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 139 transition count 178
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 139 transition count 178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 131 transition count 170
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 131 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 131 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 129 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 129 transition count 167
Applied a total of 84 rules in 8 ms. Remains 129 /170 variables (removed 41) and now considering 167/210 (removed 43) transitions.
// Phase 1: matrix 167 rows 129 cols
[2024-05-30 01:05:41] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:05:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 01:05:41] [INFO ] Invariant cache hit.
[2024-05-30 01:05:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-30 01:05:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/296 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 132 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/296 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 166/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/296 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 298 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 12632ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12635ms
Starting structural reductions in LTL mode, iteration 1 : 129/170 places, 167/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12887 ms. Remains : 129/170 places, 167/210 transitions.
[2024-05-30 01:05:54] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:05:54] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:05:54] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-30 01:05:54] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:05:54] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:05:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13871027016731371057.gal : 2 ms
[2024-05-30 01:05:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11958067492768250354.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/CTLFireability13871027016731371057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11958067492768250354.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EG((EX(AG((p161==0))) + (((p65==0)&&((p217==0)||(p62==0)))&&((p172==0)||(p153==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((EX(!(E(TRUE U !((p161==0))))) + (((p65==0)&&((p217==0)||(p62==0)))&&((p172==0)||(p153==0)))))...166
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t32, t64, t67, t84, t87, t104, t108, t109, t122, t141, t144, t150, Intersectio...243
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.74462,193276,1,0,538,1.09088e+06,365,368,4189,1.4128e+06,642
FORMULA SmartHome-PT-07-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Graph (trivial) has 153 edges and 170 vertex of which 46 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 128 transition count 109
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 64 rules applied. Total rules applied 115 place count 78 transition count 95
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 125 place count 71 transition count 92
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 130 place count 68 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 67 transition count 90
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 131 place count 67 transition count 85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 141 place count 62 transition count 85
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 150 place count 53 transition count 76
Iterating global reduction 5 with 9 rules applied. Total rules applied 159 place count 53 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 160 place count 53 transition count 75
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 192 place count 37 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 193 place count 37 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 195 place count 36 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 206 place count 36 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 208 place count 34 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 208 place count 34 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 210 place count 33 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 211 place count 32 transition count 44
Applied a total of 211 rules in 20 ms. Remains 32 /170 variables (removed 138) and now considering 44/210 (removed 166) transitions.
[2024-05-30 01:06:00] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 32 cols
[2024-05-30 01:06:00] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:06:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 01:06:01] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-05-30 01:06:01] [INFO ] Invariant cache hit.
[2024-05-30 01:06:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-30 01:06:01] [INFO ] Redundant transitions in 31 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-30 01:06:01] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-05-30 01:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 39/70 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/71 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/72 variables, and 33 constraints, problems are : Problem set: 0 solved, 27 unsolved in 596 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 39/70 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1/71 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/71 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/72 variables, and 60 constraints, problems are : Problem set: 0 solved, 27 unsolved in 620 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/170 places, 44/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1374 ms. Remains : 32/170 places, 44/210 transitions.
[2024-05-30 01:06:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:06:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:06:02] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 01:06:02] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:06:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:06:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11999333845899751271.gal : 1 ms
[2024-05-30 01:06:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17099647507510528994.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/CTLFireability11999333845899751271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17099647507510528994.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,50400,0.013188,3552,2,83,5,465,6,0,162,369,0


Converting to forward existential form...Done !
original formula: EG(((p50==0) + (((AG((p92==1)) * (p167==0)) * (AG((p209==1)) * (p143==0))) * ((p217==1)||((p66==1)&&(p32==1))))))
=> equivalent forward existential formula: [FwdG(Init,((p50==0) + (((!(E(TRUE U !((p92==1)))) * (p167==0)) * (!(E(TRUE U !((p209==1)))) * (p143==0))) * ((p...198
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t16, t21, t27, t37, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,1,0.081268,5188,1,0,120,8208,116,93,919,11496,152
FORMULA SmartHome-PT-07-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 170/170 places, 210/210 transitions.
Graph (trivial) has 165 edges and 170 vertex of which 68 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 106 transition count 85
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 56 rules applied. Total rules applied 101 place count 62 transition count 73
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 56 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 107 place count 56 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 117 place count 51 transition count 68
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 127 place count 41 transition count 57
Iterating global reduction 3 with 10 rules applied. Total rules applied 137 place count 41 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 41 transition count 56
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 168 place count 26 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 26 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 25 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 172 place count 25 transition count 38
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 177 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 178 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 179 place count 23 transition count 32
Applied a total of 179 rules in 15 ms. Remains 23 /170 variables (removed 147) and now considering 32/210 (removed 178) transitions.
[2024-05-30 01:06:02] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-30 01:06:02] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 01:06:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 01:06:02] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-05-30 01:06:02] [INFO ] Invariant cache hit.
[2024-05-30 01:06:02] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-30 01:06:02] [INFO ] Redundant transitions in 52 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-30 01:06:02] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-05-30 01:06:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/46 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/47 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/48 variables, and 25 constraints, problems are : Problem set: 0 solved, 20 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/46 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/47 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/47 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 20 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 889ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 900ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/170 places, 32/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1082 ms. Remains : 23/170 places, 32/210 transitions.
[2024-05-30 01:06:03] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:06:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:06:03] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-30 01:06:03] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:06:03] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:06:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13678954305135459559.gal : 1 ms
[2024-05-30 01:06:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16824703536653839399.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/CTLFireability13678954305135459559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16824703536653839399.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,2784,0.010333,3500,2,53,5,411,6,0,110,360,0


Converting to forward existential form...Done !
original formula: EG(((p217==0)||(p222==0)))
=> equivalent forward existential formula: [FwdG(Init,((p217==0)||(p222==0)))] != FALSE
Hit Full ! (commute/partial/dont) 21/0/11
(forward)formula 0,1,0.023031,3816,1,0,8,1683,19,4,564,1684,8
FORMULA SmartHome-PT-07-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 01:06:03] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:06:03] [INFO ] Flatten gal took : 5 ms
Total runtime 202025 ms.

BK_STOP 1717031163651

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

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