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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 03:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 12 03:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K 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-14-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-14-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-14-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-14-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-14-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-14-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717034075605

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:54:38] [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:54:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:54:38] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-05-30 01:54:38] [INFO ] Transformed 422 places.
[2024-05-30 01:54:38] [INFO ] Transformed 448 transitions.
[2024-05-30 01:54:38] [INFO ] Found NUPN structural information;
[2024-05-30 01:54:38] [INFO ] Parsed PT model containing 422 places and 448 transitions and 1026 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Deduced a syphon composed of 129 places in 11 ms
Reduce places removed 129 places and 104 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-14-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 282 transition count 344
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 74 place count 219 transition count 281
Iterating global reduction 1 with 63 rules applied. Total rules applied 137 place count 219 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 219 transition count 275
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 155 place count 207 transition count 263
Iterating global reduction 2 with 12 rules applied. Total rules applied 167 place count 207 transition count 263
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 178 place count 196 transition count 252
Iterating global reduction 2 with 11 rules applied. Total rules applied 189 place count 196 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 196 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 195 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 195 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 193 place count 194 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 194 transition count 249
Applied a total of 194 rules in 186 ms. Remains 194 /293 variables (removed 99) and now considering 249/344 (removed 95) transitions.
// Phase 1: matrix 249 rows 194 cols
[2024-05-30 01:54:39] [INFO ] Computed 3 invariants in 28 ms
[2024-05-30 01:54:39] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-30 01:54:39] [INFO ] Invariant cache hit.
[2024-05-30 01:54:39] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-05-30 01:54:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/443 variables, 194/197 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/443 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 197 constraints, problems are : Problem set: 0 solved, 248 unsolved in 15362 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/443 variables, 194/197 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 248/445 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 445 constraints, problems are : Problem set: 0 solved, 248 unsolved in 13160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 28717ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 28751ms
Starting structural reductions in LTL mode, iteration 1 : 194/293 places, 249/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29858 ms. Remains : 194/293 places, 249/344 transitions.
Support contains 60 out of 194 places after structural reductions.
[2024-05-30 01:55:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 01:55:09] [INFO ] Flatten gal took : 61 ms
FORMULA SmartHome-PT-14-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:55:09] [INFO ] Flatten gal took : 23 ms
[2024-05-30 01:55:09] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 57 out of 194 places (down from 60) after GAL structural reductions.
FORMULA SmartHome-PT-14-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (207 resets) in 2280 ms. (17 steps per ms) remains 3/45 properties
BEST_FIRST walk for 40004 steps (26 resets) in 243 ms. (163 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (25 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
[2024-05-30 01:55:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/25 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/78 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/83 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 96/179 variables, 34/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 85/264 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 85/349 variables, 39/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 62/411 variables, 33/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/411 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 24/435 variables, 15/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/435 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 7/442 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/442 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/443 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/443 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/443 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 197 constraints, problems are : Problem set: 0 solved, 2 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/25 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/78 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/83 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 96/179 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 85/264 variables, 41/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 85/349 variables, 39/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 62/411 variables, 33/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/411 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 24/435 variables, 15/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/435 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 7/442 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/442 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/443 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/443 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/443 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 810ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 158 ms.
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 249/249 transitions.
Graph (trivial) has 194 edges and 194 vertex of which 88 / 194 are part of one of the 7 SCC in 5 ms
Free SCC test removed 81 places
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 120 transitions.
Graph (complete) has 178 edges and 113 vertex of which 106 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 106 transition count 84
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 48 rules applied. Total rules applied 90 place count 67 transition count 75
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 97 place count 62 transition count 73
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 61 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 60 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 100 place count 60 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 106 place count 57 transition count 69
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 117 place count 46 transition count 58
Iterating global reduction 5 with 11 rules applied. Total rules applied 128 place count 46 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 129 place count 46 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 129 place count 46 transition count 56
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 131 place count 45 transition count 56
Graph (complete) has 89 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 133 place count 44 transition count 55
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 135 place count 43 transition count 54
Performed 22 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 179 place count 21 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 36 edges and 21 vertex of which 17 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 13 rules applied. Total rules applied 192 place count 17 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 194 place count 17 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 196 place count 15 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 197 place count 14 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 199 place count 12 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 199 place count 12 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 203 place count 10 transition count 10
Applied a total of 203 rules in 74 ms. Remains 10 /194 variables (removed 184) and now considering 10/249 (removed 239) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 10/194 places, 10/249 transitions.
RANDOM walk for 511 steps (63 resets) in 6 ms. (73 steps per ms) remains 0/2 properties
[2024-05-30 01:55:11] [INFO ] Flatten gal took : 26 ms
[2024-05-30 01:55:11] [INFO ] Flatten gal took : 25 ms
[2024-05-30 01:55:11] [INFO ] Input system was already deterministic with 249 transitions.
Computed a total of 47 stabilizing places and 46 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 172 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 172 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 172 transition count 224
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 164 transition count 216
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 164 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 160 transition count 212
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 160 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 158 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 158 transition count 210
Applied a total of 75 rules in 40 ms. Remains 158 /194 variables (removed 36) and now considering 210/249 (removed 39) transitions.
// Phase 1: matrix 210 rows 158 cols
[2024-05-30 01:55:11] [INFO ] Computed 3 invariants in 7 ms
[2024-05-30 01:55:11] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 01:55:11] [INFO ] Invariant cache hit.
[2024-05-30 01:55:11] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 01:55:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 161 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 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/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 209/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 370 constraints, problems are : Problem set: 0 solved, 209 unsolved in 9691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 20453ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 20461ms
Starting structural reductions in LTL mode, iteration 1 : 158/194 places, 210/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20823 ms. Remains : 158/194 places, 210/249 transitions.
[2024-05-30 01:55:32] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:55:32] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:55:32] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-30 01:55:32] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:55:32] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:55:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13874462437844263624.gal : 7 ms
[2024-05-30 01:55:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16544623322131788520.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/CTLFireability13874462437844263624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16544623322131788520.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16374e+12,0.435364,12860,2,2625,5,42864,6,0,836,45951,0


Converting to forward existential form...Done !
original formula: EX(EG(AG((p199==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(TRUE U !((p199==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t92, t95, t112, t115, t132, t135, t147, t150, t167, t181, t184, t187,...268
(forward)formula 0,0,3.05563,71076,1,0,264,356165,448,185,4771,329152,445
FORMULA SmartHome-PT-14-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 171 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 171 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 171 transition count 223
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 163 transition count 215
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 163 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 159 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 159 transition count 211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 157 transition count 209
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 157 transition count 209
Applied a total of 77 rules in 18 ms. Remains 157 /194 variables (removed 37) and now considering 209/249 (removed 40) transitions.
// Phase 1: matrix 209 rows 157 cols
[2024-05-30 01:55:35] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 01:55:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 01:55:35] [INFO ] Invariant cache hit.
[2024-05-30 01:55:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-30 01:55:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 160 constraints, problems are : Problem set: 0 solved, 208 unsolved in 10046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 208/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 368 constraints, problems are : Problem set: 0 solved, 208 unsolved in 9452 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19540ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19545ms
Starting structural reductions in LTL mode, iteration 1 : 157/194 places, 209/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19922 ms. Remains : 157/194 places, 209/249 transitions.
[2024-05-30 01:55:55] [INFO ] Flatten gal took : 19 ms
[2024-05-30 01:55:55] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:55:55] [INFO ] Input system was already deterministic with 209 transitions.
[2024-05-30 01:55:55] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:55:55] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:55:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10696917718760097806.gal : 5 ms
[2024-05-30 01:55:55] [INFO ] Time to serialize properties into /tmp/CTLFireability7904166104841592838.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/CTLFireability10696917718760097806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7904166104841592838.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.08052e+12,0.408482,12932,2,2558,5,43076,6,0,831,45888,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((p90==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((p90==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t180, t183, t186,...268
(forward)formula 0,1,6.59534,156644,1,0,313,982670,440,209,4730,764006,500
FORMULA SmartHome-PT-14-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 173 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 173 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 173 transition count 225
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 166 transition count 218
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 166 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 163 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 163 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 162 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 162 transition count 214
Applied a total of 67 rules in 13 ms. Remains 162 /194 variables (removed 32) and now considering 214/249 (removed 35) transitions.
// Phase 1: matrix 214 rows 162 cols
[2024-05-30 01:56:02] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:56:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 01:56:02] [INFO ] Invariant cache hit.
[2024-05-30 01:56:02] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-30 01:56:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/376 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 165 constraints, problems are : Problem set: 0 solved, 213 unsolved in 11022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/376 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 213/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9970 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 21046ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 21052ms
Starting structural reductions in LTL mode, iteration 1 : 162/194 places, 214/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21350 ms. Remains : 162/194 places, 214/249 transitions.
[2024-05-30 01:56:23] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:56:23] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:56:23] [INFO ] Input system was already deterministic with 214 transitions.
[2024-05-30 01:56:23] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:56:23] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:56:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5806113277267474633.gal : 3 ms
[2024-05-30 01:56:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15104083134557791506.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5806113277267474633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15104083134557791506.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.68195e+12,0.345227,12696,2,2745,5,42658,6,0,856,44999,0


Converting to forward existential form...Done !
original formula: AG((AX(((p369==1)||(p134==1))) + AX((!(A((p147==1) U (p208==1))) + (p267==0)))))
=> equivalent forward existential formula: [(((EY((FwdU(Init,TRUE) * !(!(EX(!(((p369==1)||(p134==1)))))))) * !((p267==0))) * !(EG(!((p208==1))))) * !(E(!((...208
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t115, t136, t139, t151, t154, t171, t185, t188, t191,...268
(forward)formula 0,0,17.0758,418608,1,0,716,2.46957e+06,459,418,4741,2.95957e+06,914
FORMULA SmartHome-PT-14-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 171 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 171 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 171 transition count 223
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 163 transition count 215
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 163 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 159 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 159 transition count 211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 157 transition count 209
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 157 transition count 209
Applied a total of 77 rules in 9 ms. Remains 157 /194 variables (removed 37) and now considering 209/249 (removed 40) transitions.
// Phase 1: matrix 209 rows 157 cols
[2024-05-30 01:56:40] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 01:56:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 01:56:40] [INFO ] Invariant cache hit.
[2024-05-30 01:56:41] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-30 01:56:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 160 constraints, problems are : Problem set: 0 solved, 208 unsolved in 10198 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 208/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 368 constraints, problems are : Problem set: 0 solved, 208 unsolved in 8870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19099ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19102ms
Starting structural reductions in LTL mode, iteration 1 : 157/194 places, 209/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19324 ms. Remains : 157/194 places, 209/249 transitions.
[2024-05-30 01:57:00] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:57:00] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:57:00] [INFO ] Input system was already deterministic with 209 transitions.
[2024-05-30 01:57:00] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:57:00] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:57:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7676644107539346003.gal : 4 ms
[2024-05-30 01:57:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1072852558845234023.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/CTLFireability7676644107539346003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1072852558845234023.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,2.08052e+12,0.535717,12928,2,2558,5,43076,6,0,831,45888,0


Converting to forward existential form...Done !
original formula: E(!(EX(EX((p286==1)))) U (p267==1))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(EX((p286==1))))) * (p267==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t180, t183, t186,...268
(forward)formula 0,0,11.2625,266124,1,0,521,1.10035e+06,439,364,4608,2.00248e+06,703
FORMULA SmartHome-PT-14-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 173 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 173 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 173 transition count 225
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 167 transition count 219
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 167 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 164 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 164 transition count 216
Applied a total of 63 rules in 14 ms. Remains 164 /194 variables (removed 30) and now considering 216/249 (removed 33) transitions.
// Phase 1: matrix 216 rows 164 cols
[2024-05-30 01:57:11] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:57:11] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 01:57:11] [INFO ] Invariant cache hit.
[2024-05-30 01:57:12] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-30 01:57:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/380 variables, 164/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 167 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/380 variables, 164/167 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 215/382 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 382 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 19578ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 19585ms
Starting structural reductions in LTL mode, iteration 1 : 164/194 places, 216/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19902 ms. Remains : 164/194 places, 216/249 transitions.
[2024-05-30 01:57:31] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:57:31] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:57:31] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-30 01:57:31] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:57:31] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:57:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13892612822234356717.gal : 3 ms
[2024-05-30 01:57:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14978280814124462537.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/CTLFireability13892612822234356717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14978280814124462537.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57772e+12,0.517048,13224,2,2754,5,44305,6,0,866,47255,0


Converting to forward existential form...Done !
original formula: EX(AG(((AF((p222==0)) + E(((p140==1)&&(p71==1)) U (p206==1))) + (((p162==1)&&(p164==1)) + ((EX((p276==0)) * (p313==1)) * EX((p218==1)))))...157
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((!(EG(!((p222==0)))) + E(((p140==1)&&(p71==1)) U (p206==1))) + (((p162==1)&&(p164==1)...220
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t92, t96, t113, t119, t137, t140, t152, t156, t173, t187, t190, t193,...268
(forward)formula 0,0,6.35813,143888,1,0,417,896518,469,264,5054,769768,611
FORMULA SmartHome-PT-14-CTLFireability-2024-04 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 : 194/194 places, 249/249 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 176 transition count 231
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 176 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 176 transition count 228
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 172 transition count 224
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 172 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 169 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 169 transition count 221
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 167 transition count 219
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 167 transition count 219
Applied a total of 57 rules in 14 ms. Remains 167 /194 variables (removed 27) and now considering 219/249 (removed 30) transitions.
// Phase 1: matrix 219 rows 167 cols
[2024-05-30 01:57:38] [INFO ] Computed 3 invariants in 6 ms
[2024-05-30 01:57:38] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 01:57:38] [INFO ] Invariant cache hit.
[2024-05-30 01:57:38] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-30 01:57:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/386 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 170 constraints, problems are : Problem set: 0 solved, 218 unsolved in 11844 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/386 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 218/388 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 388 constraints, problems are : Problem set: 0 solved, 218 unsolved in 10751 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 22642ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 22647ms
Starting structural reductions in LTL mode, iteration 1 : 167/194 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22948 ms. Remains : 167/194 places, 219/249 transitions.
[2024-05-30 01:58:01] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:58:01] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:58:01] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-30 01:58:01] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:58:01] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:58:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16400425272088616253.gal : 3 ms
[2024-05-30 01:58:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1276670369234014211.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/CTLFireability16400425272088616253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1276670369234014211.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,3.15997e+12,0.61546,14304,2,3028,5,49070,6,0,881,52627,0


Converting to forward existential form...Done !
original formula: ((AX((EG(((p286==1)&&(p323==1))) + (p56==1))) + AF(AG(!(A((p77==1) U (p154==1)))))) + (AF((((p320==0) + EX((p143==0))) + (p224==0))) * AG...189
=> equivalent forward existential formula: ([FwdG((Init * !((!(EX(!((EG(((p286==1)&&(p323==1))) + (p56==1))))) + !(EG(!(!(E(TRUE U !(!(!((E(!((p154==1)) U ...493
Reverse transition relation is NOT exact ! Due to transitions t8, t13, t30, t33, t62, t95, t99, t117, t120, t137, t140, t152, t155, t174, t190, t193, t196,...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,25.1169,566668,1,0,762,3.4504e+06,489,445,5746,3.97003e+06,989
FORMULA SmartHome-PT-14-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 173 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 173 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 173 transition count 226
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 165 transition count 218
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 165 transition count 218
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 161 transition count 214
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 161 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 159 transition count 212
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 159 transition count 212
Applied a total of 72 rules in 14 ms. Remains 159 /194 variables (removed 35) and now considering 212/249 (removed 37) transitions.
// Phase 1: matrix 212 rows 159 cols
[2024-05-30 01:58:26] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:58:26] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 01:58:26] [INFO ] Invariant cache hit.
[2024-05-30 01:58:26] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-30 01:58:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/371 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/371 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 162 constraints, problems are : Problem set: 0 solved, 211 unsolved in 10924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/371 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 211/373 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/371 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 373 constraints, problems are : Problem set: 0 solved, 211 unsolved in 9668 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 20634ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 20639ms
Starting structural reductions in LTL mode, iteration 1 : 159/194 places, 212/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20974 ms. Remains : 159/194 places, 212/249 transitions.
[2024-05-30 01:58:47] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:58:47] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:58:47] [INFO ] Input system was already deterministic with 212 transitions.
[2024-05-30 01:58:47] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:58:47] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:58:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6093163014872664199.gal : 6 ms
[2024-05-30 01:58:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2359621329914051707.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/CTLFireability6093163014872664199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2359621329914051707.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,2.30677e+12,0.669615,15064,2,3061,5,53611,6,0,842,56948,0


Converting to forward existential form...Done !
original formula: E(EF((p284!=1)) U !(EF((A(((p286==1)&&(p415==1)) U ((p418==1)&&(p421==1))) + AX(A((p143==1) U (p97==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (p284!=1))) * !(E(TRUE U (!((E(!(((p418==1)&&(p421==1))) U (!(((p286==1)&&(p415==1))) * !((...308
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t32, t60, t92, t95, t112, t115, t132, t135, t147, t150, t152, t168, t1...283
Detected timeout of ITS tools.
[2024-05-30 01:59:17] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:59:17] [INFO ] Applying decomposition
[2024-05-30 01:59:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17309839295066704506.txt' '-o' '/tmp/graph17309839295066704506.bin' '-w' '/tmp/graph17309839295066704506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17309839295066704506.bin' '-l' '-1' '-v' '-w' '/tmp/graph17309839295066704506.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:59:17] [INFO ] Decomposing Gal with order
[2024-05-30 01:59:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:59:17] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-30 01:59:17] [INFO ] Flatten gal took : 92 ms
[2024-05-30 01:59:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2024-05-30 01:59:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10617481644563507647.gal : 9 ms
[2024-05-30 01:59:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12270950769457068727.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/CTLFireability10617481644563507647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12270950769457068727.ctl'

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 -...264
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.30677e+12,0.227575,7640,365,48,8022,636,429,15068,64,1783,0


Converting to forward existential form...Done !
original formula: E(EF((i7.i0.u41.p284!=1)) U !(EF((A(((i7.i0.u41.p286==1)&&(i7.i0.u41.p415==1)) U ((i7.i2.u64.p418==1)&&(i7.i2.u63.p421==1))) + AX(A((i4.u...190
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (i7.i0.u41.p284!=1))) * !(E(TRUE U (!((E(!(((i7.i2.u64.p418==1)&&(i7.i2.u63.p421==1))) U (!...426
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t95, t115, t135, t150, i0.i0.u1.t185, i1.u6.t182, i2.u10.t152, i2.u10.t168, i3.t190...406
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,0.880639,29816,1,0,42684,772,2835,157315,341,3621,70566
FORMULA SmartHome-PT-14-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 173 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 173 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 173 transition count 225
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 166 transition count 218
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 166 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 163 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 163 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 162 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 162 transition count 214
Applied a total of 67 rules in 7 ms. Remains 162 /194 variables (removed 32) and now considering 214/249 (removed 35) transitions.
// Phase 1: matrix 214 rows 162 cols
[2024-05-30 01:59:18] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:59:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 01:59:18] [INFO ] Invariant cache hit.
[2024-05-30 01:59:19] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-30 01:59:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/376 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 165 constraints, problems are : Problem set: 0 solved, 213 unsolved in 11279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/376 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 213/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 21170ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 21172ms
Starting structural reductions in LTL mode, iteration 1 : 162/194 places, 214/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21391 ms. Remains : 162/194 places, 214/249 transitions.
[2024-05-30 01:59:40] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:59:40] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:59:40] [INFO ] Input system was already deterministic with 214 transitions.
[2024-05-30 01:59:40] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:59:40] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:59:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9392064834044831514.gal : 2 ms
[2024-05-30 01:59:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7753290780830708442.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/CTLFireability9392064834044831514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7753290780830708442.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,2.33661e+12,0.433701,15096,2,3215,5,53087,6,0,856,56504,0


Converting to forward existential form...Done !
original formula: ((AG(EX((p176==0))) + A((((p2==1)&&(p160==1))||(p195==1)) U AX((p281==1)))) + EG((p206==1)))
=> equivalent forward existential formula: [(FwdU(((Init * !(EG((p206==1)))) * !(!((E(!(!(EX(!((p281==1))))) U (!((((p2==1)&&(p160==1))||(p195==1))) * !(!(...243
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t34, t62, t95, t98, t116, t119, t136, t139, t151, t154, t171, t185, t188, ...273
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.78218,135688,1,0,352,741133,462,237,5285,722046,547
FORMULA SmartHome-PT-14-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Graph (trivial) has 196 edges and 194 vertex of which 98 / 194 are part of one of the 8 SCC in 2 ms
Free SCC test removed 90 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 103 transition count 95
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 46 rules applied. Total rules applied 82 place count 68 transition count 84
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 90 place count 62 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 92 place count 60 transition count 82
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 92 place count 60 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 96 place count 58 transition count 80
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 108 place count 46 transition count 68
Iterating global reduction 4 with 12 rules applied. Total rules applied 120 place count 46 transition count 68
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 160 place count 26 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 173 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 175 place count 24 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 175 place count 24 transition count 32
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 177 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 22 transition count 30
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 22 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 21 transition count 29
Applied a total of 180 rules in 30 ms. Remains 21 /194 variables (removed 173) and now considering 29/249 (removed 220) transitions.
[2024-05-30 01:59:46] [INFO ] Flow matrix only has 23 transitions (discarded 6 similar events)
// Phase 1: matrix 23 rows 21 cols
[2024-05-30 01:59:46] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 01:59:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 01:59:46] [INFO ] Flow matrix only has 23 transitions (discarded 6 similar events)
[2024-05-30 01:59:46] [INFO ] Invariant cache hit.
[2024-05-30 01:59:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-30 01:59:46] [INFO ] Redundant transitions in 37 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-30 01:59:46] [INFO ] Flow matrix only has 23 transitions (discarded 6 similar events)
[2024-05-30 01:59:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 20/38 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/44 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 247 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 20/38 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/44 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 338 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 598ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/194 places, 29/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 755 ms. Remains : 21/194 places, 29/249 transitions.
[2024-05-30 01:59:46] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:59:46] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:59:46] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 01:59:46] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:59:46] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:59:46] [INFO ] Time to serialize gal into /tmp/CTLFireability18090710970940273457.gal : 1 ms
[2024-05-30 01:59:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15666337044986282350.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/CTLFireability18090710970940273457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15666337044986282350.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,29808,0.008734,3476,2,58,5,313,6,0,96,279,0


Converting to forward existential form...Done !
original formula: EF(AG((AF((p151==1)) * (p279==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!((p151==1)))) * (p279==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t17, t18, t24, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,0.064134,4852,1,0,107,8217,80,62,576,12280,131
FORMULA SmartHome-PT-14-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 172 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 172 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 172 transition count 224
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 165 transition count 217
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 165 transition count 217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 162 transition count 214
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 162 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 161 transition count 213
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 161 transition count 213
Applied a total of 69 rules in 23 ms. Remains 161 /194 variables (removed 33) and now considering 213/249 (removed 36) transitions.
// Phase 1: matrix 213 rows 161 cols
[2024-05-30 01:59:47] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:59:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 01:59:47] [INFO ] Invariant cache hit.
[2024-05-30 01:59:47] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-30 01:59:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 164 constraints, problems are : Problem set: 0 solved, 212 unsolved in 10503 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 212/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 376 constraints, problems are : Problem set: 0 solved, 212 unsolved in 9497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 20048ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 20056ms
Starting structural reductions in LTL mode, iteration 1 : 161/194 places, 213/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20377 ms. Remains : 161/194 places, 213/249 transitions.
[2024-05-30 02:00:07] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:00:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:00:07] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-30 02:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:00:07] [INFO ] Time to serialize gal into /tmp/CTLFireability18058621860230000697.gal : 2 ms
[2024-05-30 02:00:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14397908942562338132.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/CTLFireability18058621860230000697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14397908942562338132.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.4134e+12,0.481073,13244,2,2738,5,44603,6,0,851,47366,0


Converting to forward existential form...Done !
original formula: EX(EF((AF(((p98==1)&&(p405==1))) * AX((p240==0)))))
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !(EG(!(((p98==1)&&(p405==1)))))) * !(EX(!((p240==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t95, t98, t115, t118, t135, t138, t150, t153, t170, t184, t187, t190,...268
(forward)formula 0,1,17.4489,432980,1,0,741,2.56458e+06,452,422,4994,3.07729e+06,941
FORMULA SmartHome-PT-14-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 171 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 171 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 171 transition count 223
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 163 transition count 215
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 163 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 159 transition count 211
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 159 transition count 211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 157 transition count 209
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 157 transition count 209
Applied a total of 77 rules in 34 ms. Remains 157 /194 variables (removed 37) and now considering 209/249 (removed 40) transitions.
// Phase 1: matrix 209 rows 157 cols
[2024-05-30 02:00:25] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:00:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 02:00:25] [INFO ] Invariant cache hit.
[2024-05-30 02:00:25] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-30 02:00:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 160 constraints, problems are : Problem set: 0 solved, 208 unsolved in 10683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 208/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 368 constraints, problems are : Problem set: 0 solved, 208 unsolved in 9403 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 20120ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 20124ms
Starting structural reductions in LTL mode, iteration 1 : 157/194 places, 209/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20427 ms. Remains : 157/194 places, 209/249 transitions.
[2024-05-30 02:00:45] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:00:45] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:00:45] [INFO ] Input system was already deterministic with 209 transitions.
[2024-05-30 02:00:45] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:00:45] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:00:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15565501012269881621.gal : 3 ms
[2024-05-30 02:00:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13957091525052452596.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/CTLFireability15565501012269881621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13957091525052452596.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08052e+12,0.463917,12964,2,2558,5,43076,6,0,831,45888,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.482213,12964,1,0,6,43076,7,1,1011,45888,1
FORMULA SmartHome-PT-14-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 249/249 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 175 transition count 230
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 175 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 175 transition count 227
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 167 transition count 219
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 167 transition count 219
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 163 transition count 215
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 163 transition count 215
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 161 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 161 transition count 213
Applied a total of 69 rules in 16 ms. Remains 161 /194 variables (removed 33) and now considering 213/249 (removed 36) transitions.
// Phase 1: matrix 213 rows 161 cols
[2024-05-30 02:00:46] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:00:46] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-30 02:00:46] [INFO ] Invariant cache hit.
[2024-05-30 02:00:46] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-30 02:00:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 164 constraints, problems are : Problem set: 0 solved, 212 unsolved in 10527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 212/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 376 constraints, problems are : Problem set: 0 solved, 212 unsolved in 9626 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 20197ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 20201ms
Starting structural reductions in LTL mode, iteration 1 : 161/194 places, 213/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20511 ms. Remains : 161/194 places, 213/249 transitions.
[2024-05-30 02:01:06] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:01:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:01:06] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-30 02:01:06] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:01:06] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:01:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9111177176923236565.gal : 9 ms
[2024-05-30 02:01:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16364521359231991216.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/CTLFireability9111177176923236565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16364521359231991216.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,4.60443e+12,0.65468,15620,2,3254,5,55704,6,0,851,62119,0


Converting to forward existential form...Done !
original formula: (EG(EF((p337==1))) * AG((((AX((p226==0)) * ((p175==1)||(((p2==0)||(p318==0))&&((p191==0)||(p417==0))))) + (p278==0)) * (((p324==1)&&(p228...180
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U (p337==1)))))] = FALSE * (([(EY((FwdU(Init,TRUE) * !((p278==0)))) * !((p226==0)))] = FAL...351
(forward)formula 0,0,0.763486,15884,1,0,11,55704,11,4,1367,62119,3
FORMULA SmartHome-PT-14-CTLFireability-2023-13 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 : 194/194 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 173 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 173 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 173 transition count 226
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 166 transition count 219
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 166 transition count 219
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 162 transition count 215
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 162 transition count 215
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 160 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 160 transition count 213
Applied a total of 70 rules in 11 ms. Remains 160 /194 variables (removed 34) and now considering 213/249 (removed 36) transitions.
// Phase 1: matrix 213 rows 160 cols
[2024-05-30 02:01:07] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:01:07] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 02:01:07] [INFO ] Invariant cache hit.
[2024-05-30 02:01:07] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-30 02:01:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 163 constraints, problems are : Problem set: 0 solved, 212 unsolved in 9969 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 212/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/373 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 375 constraints, problems are : Problem set: 0 solved, 212 unsolved in 7735 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 17745ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 17750ms
Starting structural reductions in LTL mode, iteration 1 : 160/194 places, 213/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17999 ms. Remains : 160/194 places, 213/249 transitions.
[2024-05-30 02:01:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:01:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:01:25] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-30 02:01:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:01:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:01:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17373032114561395720.gal : 2 ms
[2024-05-30 02:01:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6172778722870878279.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/CTLFireability17373032114561395720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6172778722870878279.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.29343e+12,0.33523,13516,2,2917,5,46246,6,0,847,48452,0


Converting to forward existential form...Done !
original formula: (EF(((EF((p312==1)) + AG(EF(((p286==0)||(p371==0))))) + AF((((p209==1)||(p102==1))||(p236==1))))) * AX((p181==1)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((E(TRUE U (p312==1)) + !(E(TRUE U !(E(TRUE U ((p286==0)||(p371==0))))))) + !(EG(!((((p209=...237
(forward)formula 0,0,0.350974,13780,1,0,9,46246,9,2,1034,48452,2
FORMULA SmartHome-PT-14-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 02:01:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:01:25] [INFO ] Flatten gal took : 5 ms
Total runtime 407599 ms.

BK_STOP 1717034485845

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

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