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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 03:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 03:35 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 139K 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-17-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-17-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-17-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-17-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-17-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-17-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717035952136

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 02:25:54] [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 02:25:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:25:55] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2024-05-30 02:25:55] [INFO ] Transformed 571 places.
[2024-05-30 02:25:55] [INFO ] Transformed 617 transitions.
[2024-05-30 02:25:55] [INFO ] Found NUPN structural information;
[2024-05-30 02:25:55] [INFO ] Parsed PT model containing 571 places and 617 transitions and 1410 arcs in 517 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Deduced a syphon composed of 176 places in 17 ms
Reduce places removed 176 places and 150 transitions.
Support contains 65 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 467/467 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 380 transition count 467
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 101 place count 294 transition count 381
Iterating global reduction 1 with 86 rules applied. Total rules applied 187 place count 294 transition count 381
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 194 place count 294 transition count 374
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 204 place count 284 transition count 364
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 284 transition count 364
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 223 place count 275 transition count 355
Iterating global reduction 2 with 9 rules applied. Total rules applied 232 place count 275 transition count 355
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 236 place count 271 transition count 351
Iterating global reduction 2 with 4 rules applied. Total rules applied 240 place count 271 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 242 place count 269 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 269 transition count 349
Applied a total of 244 rules in 229 ms. Remains 269 /395 variables (removed 126) and now considering 349/467 (removed 118) transitions.
// Phase 1: matrix 349 rows 269 cols
[2024-05-30 02:25:55] [INFO ] Computed 3 invariants in 36 ms
[2024-05-30 02:25:56] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-30 02:25:56] [INFO ] Invariant cache hit.
[2024-05-30 02:25:56] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-30 02:25:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/269 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 349/618 variables, 269/272 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/618 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 618/618 variables, and 272 constraints, problems are : Problem set: 0 solved, 348 unsolved in 27825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/269 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 349/618 variables, 269/272 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 348/620 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/618 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 618/618 variables, and 620 constraints, problems are : Problem set: 0 solved, 348 unsolved in 22637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
After SMT, in 50735ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 50786ms
Starting structural reductions in LTL mode, iteration 1 : 269/395 places, 349/467 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52112 ms. Remains : 269/395 places, 349/467 transitions.
Support contains 65 out of 269 places after structural reductions.
[2024-05-30 02:26:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-30 02:26:47] [INFO ] Flatten gal took : 76 ms
FORMULA SmartHome-PT-17-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:26:47] [INFO ] Flatten gal took : 32 ms
[2024-05-30 02:26:48] [INFO ] Input system was already deterministic with 349 transitions.
Support contains 54 out of 269 places (down from 65) after GAL structural reductions.
RANDOM walk for 40000 steps (147 resets) in 2053 ms. (19 steps per ms) remains 3/50 properties
BEST_FIRST walk for 40004 steps (15 resets) in 167 ms. (238 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (16 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
[2024-05-30 02:26:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/32 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 77/109 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 4/113 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/257 variables, 51/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 130/387 variables, 62/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 95/482 variables, 49/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 74/556 variables, 39/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/556 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 28/584 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/584 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 7/591 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/591 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/596 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/596 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 7/603 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/603 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/609 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/609 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 6/615 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/615 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 3/618 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/618 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/618 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 618/618 variables, and 272 constraints, problems are : Problem set: 0 solved, 2 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 269/269 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/32 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 77/109 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/113 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/257 variables, 51/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 130/387 variables, 62/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 95/482 variables, 49/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 74/556 variables, 39/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/556 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 28/584 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/584 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 7/591 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/591 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 5/596 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/596 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 7/603 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/603 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 6/609 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/609 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 6/615 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/615 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 3/618 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/618 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/618 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 618/618 variables, and 274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1789ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 70 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 18 ms.
[2024-05-30 02:26:50] [INFO ] Flatten gal took : 35 ms
[2024-05-30 02:26:50] [INFO ] Flatten gal took : 37 ms
[2024-05-30 02:26:50] [INFO ] Input system was already deterministic with 349 transitions.
Computed a total of 53 stabilizing places and 52 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Graph (trivial) has 285 edges and 269 vertex of which 154 / 269 are part of one of the 12 SCC in 5 ms
Free SCC test removed 142 places
Ensure Unique test removed 183 transitions
Reduce isomorphic transitions removed 183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 126 transition count 115
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 65 rules applied. Total rules applied 116 place count 76 transition count 100
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 124 place count 69 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 68 transition count 99
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 125 place count 68 transition count 96
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 131 place count 65 transition count 96
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 139 place count 57 transition count 86
Iterating global reduction 4 with 8 rules applied. Total rules applied 147 place count 57 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 149 place count 57 transition count 84
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 203 place count 30 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 204 place count 30 transition count 55
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 205 place count 29 transition count 51
Iterating global reduction 6 with 1 rules applied. Total rules applied 206 place count 29 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 208 place count 28 transition count 50
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 209 place count 27 transition count 46
Iterating global reduction 6 with 1 rules applied. Total rules applied 210 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 223 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 225 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 225 place count 25 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 227 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 229 place count 22 transition count 28
Iterating global reduction 7 with 2 rules applied. Total rules applied 231 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 232 place count 21 transition count 27
Applied a total of 232 rules in 103 ms. Remains 21 /269 variables (removed 248) and now considering 27/349 (removed 322) transitions.
[2024-05-30 02:26:51] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2024-05-30 02:26:51] [INFO ] Computed 1 invariants in 10 ms
[2024-05-30 02:26:51] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 02:26:51] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:26:51] [INFO ] Invariant cache hit.
[2024-05-30 02:26:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-30 02:26:51] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-30 02:26:51] [INFO ] Redundant transitions in 40 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-30 02:26:51] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:26:51] [INFO ] Invariant cache hit.
[2024-05-30 02:26:51] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 4/39 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/42 variables, and 26 constraints, problems are : Problem set: 0 solved, 19 unsolved in 254 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 4/39 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 1/41 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 46 constraints, problems are : Problem set: 0 solved, 19 unsolved in 326 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 594ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/269 places, 27/349 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 871 ms. Remains : 21/269 places, 27/349 transitions.
[2024-05-30 02:26:51] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:26:51] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:26:51] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-30 02:26:51] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:26:51] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:26:51] [INFO ] Time to serialize gal into /tmp/CTLFireability12698269249216236163.gal : 2 ms
[2024-05-30 02:26:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17465225912726286729.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/CTLFireability12698269249216236163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17465225912726286729.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,36552,0.029497,3332,2,95,5,497,6,0,96,494,0


Converting to forward existential form...Done !
original formula: AG(EF((p296==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p296==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t8, t10, t12, t15, t17, t20, t22, t24, Intersection with reachable at each step enab...207
(forward)formula 0,1,0.055471,3944,1,0,68,4341,68,30,571,4112,61
FORMULA SmartHome-PT-17-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 237 transition count 317
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 237 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 237 transition count 314
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 222 transition count 299
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 222 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 222 transition count 298
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 109 place count 211 transition count 287
Iterating global reduction 2 with 11 rules applied. Total rules applied 120 place count 211 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 211 transition count 286
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 209 transition count 284
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 209 transition count 284
Applied a total of 125 rules in 33 ms. Remains 209 /269 variables (removed 60) and now considering 284/349 (removed 65) transitions.
// Phase 1: matrix 284 rows 209 cols
[2024-05-30 02:26:52] [INFO ] Computed 3 invariants in 6 ms
[2024-05-30 02:26:52] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-30 02:26:52] [INFO ] Invariant cache hit.
[2024-05-30 02:26:52] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-30 02:26:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/493 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 212 constraints, problems are : Problem set: 0 solved, 283 unsolved in 18106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/209 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/493 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 283/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 495 constraints, problems are : Problem set: 0 solved, 283 unsolved in 13144 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
After SMT, in 31348ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 31356ms
Starting structural reductions in LTL mode, iteration 1 : 209/269 places, 284/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31769 ms. Remains : 209/269 places, 284/349 transitions.
[2024-05-30 02:27:23] [INFO ] Flatten gal took : 26 ms
[2024-05-30 02:27:23] [INFO ] Flatten gal took : 26 ms
[2024-05-30 02:27:23] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-30 02:27:23] [INFO ] Flatten gal took : 22 ms
[2024-05-30 02:27:23] [INFO ] Flatten gal took : 20 ms
[2024-05-30 02:27:23] [INFO ] Time to serialize gal into /tmp/CTLFireability11961306820434403989.gal : 11 ms
[2024-05-30 02:27:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1114221466622406610.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/CTLFireability11961306820434403989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1114221466622406610.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,5.68692e+16,1.07685,23244,2,3957,5,94713,6,0,1110,94825,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...292
(forward)formula 0,0,5.60887,119948,1,0,333,543545,583,241,5943,576622,574
FORMULA SmartHome-PT-17-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 238 transition count 318
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 238 transition count 318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 238 transition count 315
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 79 place count 224 transition count 301
Iterating global reduction 1 with 14 rules applied. Total rules applied 93 place count 224 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 224 transition count 300
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 104 place count 214 transition count 290
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 214 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 214 transition count 289
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 212 transition count 287
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 212 transition count 287
Applied a total of 119 rules in 30 ms. Remains 212 /269 variables (removed 57) and now considering 287/349 (removed 62) transitions.
// Phase 1: matrix 287 rows 212 cols
[2024-05-30 02:27:29] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:27:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 02:27:29] [INFO ] Invariant cache hit.
[2024-05-30 02:27:29] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-30 02:27:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 215 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 286/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 501 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
After SMT, in 31701ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 31705ms
Starting structural reductions in LTL mode, iteration 1 : 212/269 places, 287/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32055 ms. Remains : 212/269 places, 287/349 transitions.
[2024-05-30 02:28:01] [INFO ] Flatten gal took : 21 ms
[2024-05-30 02:28:01] [INFO ] Flatten gal took : 20 ms
[2024-05-30 02:28:01] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-30 02:28:01] [INFO ] Flatten gal took : 19 ms
[2024-05-30 02:28:01] [INFO ] Flatten gal took : 19 ms
[2024-05-30 02:28:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13405732797837578936.gal : 5 ms
[2024-05-30 02:28:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14919382658202384523.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/CTLFireability13405732797837578936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14919382658202384523.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,7.02723e+16,0.937206,22632,2,3869,5,92708,6,0,1125,92020,0


Converting to forward existential form...Done !
original formula: EX((AX((p429==1)) * A((p60==1) U (p98==1))))
=> equivalent forward existential formula: [(((EY(Init) * !(EX(!((p429==1))))) * !(EG(!((p98==1))))) * !(E(!((p98==1)) U (!((p60==1)) * !((p98==1))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t29, t32, t61, t93, t96, t113, t116, t133, t136, t148, t151, t168, t183, t203, t218,...292
Detected timeout of ITS tools.
[2024-05-30 02:28:31] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:28:31] [INFO ] Applying decomposition
[2024-05-30 02:28:31] [INFO ] Flatten gal took : 11 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/graph8251249816238051336.txt' '-o' '/tmp/graph8251249816238051336.bin' '-w' '/tmp/graph8251249816238051336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8251249816238051336.bin' '-l' '-1' '-v' '-w' '/tmp/graph8251249816238051336.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:28:32] [INFO ] Decomposing Gal with order
[2024-05-30 02:28:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:28:32] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-30 02:28:32] [INFO ] Flatten gal took : 72 ms
[2024-05-30 02:28:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2024-05-30 02:28:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3495850765624841826.gal : 8 ms
[2024-05-30 02:28:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7460980399954657147.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/CTLFireability3495850765624841826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7460980399954657147.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 -...262
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,7.02723e+16,0.143164,7568,370,38,7922,620,488,12783,60,1887,0


Converting to forward existential form...Done !
original formula: EX((AX((i13.i1.u76.p429==1)) * A((i0.i0.u11.p60==1) U (i1.u16.p98==1))))
=> equivalent forward existential formula: [(((EY(Init) * !(EX(!((i13.i1.u76.p429==1))))) * !(EG(!((i1.u16.p98==1))))) * !(E(!((i1.u16.p98==1)) U (!((i0.i0...203
Reverse transition relation is NOT exact ! Due to transitions t10, t32, t96, t116, t136, t151, i0.i0.u8.t253, i0.i0.u82.t8, i1.u17.t238, i2.i0.u21.t218, i3...434
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,0.44037,15752,1,0,23227,620,3418,44729,316,1887,61007
FORMULA SmartHome-PT-17-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 240 transition count 320
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 240 transition count 320
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 240 transition count 317
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 75 place count 226 transition count 303
Iterating global reduction 1 with 14 rules applied. Total rules applied 89 place count 226 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 226 transition count 302
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 100 place count 216 transition count 292
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 216 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 216 transition count 291
Applied a total of 111 rules in 12 ms. Remains 216 /269 variables (removed 53) and now considering 291/349 (removed 58) transitions.
// Phase 1: matrix 291 rows 216 cols
[2024-05-30 02:28:32] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:28:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 02:28:32] [INFO ] Invariant cache hit.
[2024-05-30 02:28:33] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-05-30 02:28:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 291/507 variables, 216/219 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/507 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 219 constraints, problems are : Problem set: 0 solved, 290 unsolved in 17136 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 291/507 variables, 216/219 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 290/509 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/507 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 509 constraints, problems are : Problem set: 0 solved, 290 unsolved in 16340 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 33528ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 33532ms
Starting structural reductions in LTL mode, iteration 1 : 216/269 places, 291/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33816 ms. Remains : 216/269 places, 291/349 transitions.
[2024-05-30 02:29:06] [INFO ] Flatten gal took : 51 ms
[2024-05-30 02:29:06] [INFO ] Flatten gal took : 19 ms
[2024-05-30 02:29:06] [INFO ] Input system was already deterministic with 291 transitions.
[2024-05-30 02:29:06] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:29:06] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:29:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1398797072288445780.gal : 4 ms
[2024-05-30 02:29:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9884306318677416870.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/CTLFireability1398797072288445780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9884306318677416870.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,9.27718e+16,0.871199,21080,2,3756,5,82953,6,0,1145,81787,0


Converting to forward existential form...Done !
original formula: AG(((EX((p155==0)) + AX((p505==0))) + AX(((EG((p211==1)) + (p122==0)) + (p64==0)))))
=> equivalent forward existential formula: [(((EY((FwdU(Init,TRUE) * !((EX((p155==0)) + !(EX(!((p505==0)))))))) * !((p64==0))) * !((p122==0))) * !(EG((p211...171
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t205, t221,...292
(forward)formula 0,1,6.61561,144340,1,0,385,720916,611,271,6296,732562,652
FORMULA SmartHome-PT-17-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 242 transition count 322
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 242 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 242 transition count 319
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 70 place count 229 transition count 306
Iterating global reduction 1 with 13 rules applied. Total rules applied 83 place count 229 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 229 transition count 305
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 219 transition count 295
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 219 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 219 transition count 294
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 217 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 217 transition count 292
Applied a total of 109 rules in 14 ms. Remains 217 /269 variables (removed 52) and now considering 292/349 (removed 57) transitions.
// Phase 1: matrix 292 rows 217 cols
[2024-05-30 02:29:13] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:29:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-30 02:29:13] [INFO ] Invariant cache hit.
[2024-05-30 02:29:13] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-30 02:29:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/509 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 0/509 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 220 constraints, problems are : Problem set: 0 solved, 291 unsolved in 19258 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/509 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 291/511 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 0/509 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 511 constraints, problems are : Problem set: 0 solved, 291 unsolved in 15857 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints]
After SMT, in 35158ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 35162ms
Starting structural reductions in LTL mode, iteration 1 : 217/269 places, 292/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35536 ms. Remains : 217/269 places, 292/349 transitions.
[2024-05-30 02:29:48] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:29:48] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:29:48] [INFO ] Input system was already deterministic with 292 transitions.
[2024-05-30 02:29:48] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:29:48] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:29:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11809206497862707229.gal : 3 ms
[2024-05-30 02:29:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7289099643010744475.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/CTLFireability11809206497862707229.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7289099643010744475.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,7.92905e+16,0.743704,22936,2,4064,5,91561,6,0,1150,90216,0


Converting to forward existential form...Done !
original formula: EF(((A(AX((p194==1)) U (p356==1)) * AX(FALSE)) * (((p315==0) + A(EF((p294==1)) U A((p424==1) U (p391==1)))) + EX((p85==1)))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!((E(!((p356==1)) U (!(!(EX(!((p194==1))))) * !((p356==1)))) + EG(!((p356==1))))) * !(EX...755
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t28, t31, t61, t94, t97, t114, t120, t137, t140, t152, t155, t172, t187, t207, t222,...292
Detected timeout of ITS tools.
[2024-05-30 02:30:19] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:30:19] [INFO ] Applying decomposition
[2024-05-30 02:30:19] [INFO ] Flatten gal took : 12 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/graph18186349699356200963.txt' '-o' '/tmp/graph18186349699356200963.bin' '-w' '/tmp/graph18186349699356200963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18186349699356200963.bin' '-l' '-1' '-v' '-w' '/tmp/graph18186349699356200963.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:30:19] [INFO ] Decomposing Gal with order
[2024-05-30 02:30:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:30:19] [INFO ] Removed a total of 76 redundant transitions.
[2024-05-30 02:30:19] [INFO ] Flatten gal took : 32 ms
[2024-05-30 02:30:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 02:30:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9158546723382549472.gal : 9 ms
[2024-05-30 02:30:19] [INFO ] Time to serialize properties into /tmp/CTLFireability931452441225778582.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/CTLFireability9158546723382549472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability931452441225778582.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 -...261
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,7.92905e+16,0.214979,7644,490,43,7909,509,520,11680,60,1468,0


Converting to forward existential form...Done !
original formula: EF(((A(AX((i5.u29.p194==1)) U (i9.i1.u62.p356==1)) * AX(FALSE)) * (((i8.u54.p315==0) + A(EF((i7.u42.p294==1)) U A((i11.u81.p424==1) U (i1...203
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!((E(!((i9.i1.u62.p356==1)) U (!(!(EX(!((i5.u29.p194==1))))) * !((i9.i1.u62.p356==1)))) ...1013
Reverse transition relation is NOT exact ! Due to transitions t10, t31, t97, t140, t155, i0.i0.u2.t261, i0.i1.u82.t8, i1.u10.t258, i2.i0.u17.t244, i3.i2.u2...436
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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 a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,5.01748,110340,1,0,186006,776,3619,413073,331,2959,168402
FORMULA SmartHome-PT-17-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Graph (trivial) has 260 edges and 269 vertex of which 97 / 269 are part of one of the 10 SCC in 1 ms
Free SCC test removed 87 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 181 transition count 165
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 87 rules applied. Total rules applied 159 place count 110 transition count 149
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 170 place count 101 transition count 147
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 174 place count 100 transition count 144
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 178 place count 97 transition count 143
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 178 place count 97 transition count 137
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 190 place count 91 transition count 137
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 200 place count 81 transition count 125
Iterating global reduction 5 with 10 rules applied. Total rules applied 210 place count 81 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 214 place count 81 transition count 121
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 215 place count 80 transition count 120
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 80 transition count 120
Performed 33 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 282 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 5 rules applied. Total rules applied 287 place count 47 transition count 79
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 291 place count 45 transition count 77
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 292 place count 44 transition count 76
Iterating global reduction 8 with 1 rules applied. Total rules applied 293 place count 44 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 295 place count 43 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 311 place count 43 transition count 59
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 312 place count 42 transition count 57
Iterating global reduction 8 with 1 rules applied. Total rules applied 313 place count 42 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 315 place count 40 transition count 55
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 13 edges and 38 vertex of which 2 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 318 place count 37 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 320 place count 37 transition count 53
Applied a total of 320 rules in 37 ms. Remains 37 /269 variables (removed 232) and now considering 53/349 (removed 296) transitions.
[2024-05-30 02:30:24] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
// Phase 1: matrix 46 rows 37 cols
[2024-05-30 02:30:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 02:30:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 02:30:24] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2024-05-30 02:30:24] [INFO ] Invariant cache hit.
[2024-05-30 02:30:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 02:30:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-30 02:30:24] [INFO ] Redundant transitions in 36 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 02:30:24] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2024-05-30 02:30:24] [INFO ] Invariant cache hit.
[2024-05-30 02:30:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 40/68 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 12/80 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/80 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/83 variables, and 38 constraints, problems are : Problem set: 0 solved, 30 unsolved in 588 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 40/68 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 12/80 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/83 variables, and 68 constraints, problems are : Problem set: 0 solved, 30 unsolved in 649 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1246ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1247ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/269 places, 53/349 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1455 ms. Remains : 37/269 places, 53/349 transitions.
[2024-05-30 02:30:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:30:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:30:25] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-30 02:30:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:30:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:30:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9421332782428067234.gal : 2 ms
[2024-05-30 02:30:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10127648225326773197.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/CTLFireability9421332782428067234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10127648225326773197.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52099e+07,0.017683,3628,2,186,5,908,6,0,182,799,0


Converting to forward existential form...Done !
original formula: AG(((A((((!((p418==1)&&(p564==1)))||(p266==1))||(p442==1)) U (p127!=1)) + E((p368==1) U (p129==1))) + (A((p301==1) U (p261==1)) + ((p101=...178
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((!((E(!((p127!=1)) U (!((((!((p418==1)&&(p564==1)))||(p266==1))||(p442==1))) * !((p127!...592
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t9, t12, t14, t17, t25, t28, t36, t44, t45, Intersection with reachable at each ...216
Hit Full ! (commute/partial/dont) 51/0/2
(forward)formula 0,0,0.703862,20292,1,0,345,101373,149,202,1114,145230,412
FORMULA SmartHome-PT-17-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Graph (trivial) has 281 edges and 269 vertex of which 147 / 269 are part of one of the 12 SCC in 1 ms
Free SCC test removed 135 places
Ensure Unique test removed 174 transitions
Reduce isomorphic transitions removed 174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 133 transition count 123
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 64 rules applied. Total rules applied 116 place count 82 transition count 110
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 123 place count 76 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 75 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 124 place count 75 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 132 place count 71 transition count 105
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 141 place count 62 transition count 94
Iterating global reduction 4 with 9 rules applied. Total rules applied 150 place count 62 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 62 transition count 92
Performed 29 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 210 place count 33 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 211 place count 33 transition count 60
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 212 place count 32 transition count 56
Iterating global reduction 6 with 1 rules applied. Total rules applied 213 place count 32 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 31 transition count 55
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 216 place count 30 transition count 51
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 30 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 229 place count 30 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 29 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 230 place count 29 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 232 place count 28 transition count 38
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 234 place count 26 transition count 34
Iterating global reduction 7 with 2 rules applied. Total rules applied 236 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 11 edges and 24 vertex of which 2 / 24 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 239 place count 23 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 241 place count 23 transition count 31
Applied a total of 241 rules in 26 ms. Remains 23 /269 variables (removed 246) and now considering 31/349 (removed 318) transitions.
[2024-05-30 02:30:26] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-30 02:30:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 02:30:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 02:30:26] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2024-05-30 02:30:26] [INFO ] Invariant cache hit.
[2024-05-30 02:30:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-30 02:30:26] [INFO ] Redundant transitions in 30 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 02:30:26] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
[2024-05-30 02:30:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/45 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/48 variables, and 23 constraints, problems are : Problem set: 0 solved, 14 unsolved in 199 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/45 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/48 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 224 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 429ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/269 places, 31/349 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 565 ms. Remains : 23/269 places, 31/349 transitions.
[2024-05-30 02:30:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:30:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:30:27] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-30 02:30:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:30:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:30:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17347155268745192252.gal : 2 ms
[2024-05-30 02:30:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6848445307955597165.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17347155268745192252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6848445307955597165.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,123648,0.007369,3492,2,63,5,339,6,0,106,314,0


Converting to forward existential form...Done !
original formula: E(AG(EF((p208==1))) U (p442==1))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(E(TRUE U (p208==1)))))) * (p442==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t14, t18, t20, t23, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,0,0.027761,4076,1,0,63,4636,81,33,604,4635,80
FORMULA SmartHome-PT-17-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 241 transition count 321
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 241 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 241 transition count 318
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 72 place count 228 transition count 305
Iterating global reduction 1 with 13 rules applied. Total rules applied 85 place count 228 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 228 transition count 304
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 220 transition count 296
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 220 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 219 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 219 transition count 295
Applied a total of 104 rules in 47 ms. Remains 219 /269 variables (removed 50) and now considering 295/349 (removed 54) transitions.
// Phase 1: matrix 295 rows 219 cols
[2024-05-30 02:30:27] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:30:27] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 02:30:27] [INFO ] Invariant cache hit.
[2024-05-30 02:30:27] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-30 02:30:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/514 variables, 219/222 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/514 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 222 constraints, problems are : Problem set: 0 solved, 294 unsolved in 18838 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/219 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/514 variables, 219/222 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 294/516 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 516 constraints, problems are : Problem set: 0 solved, 294 unsolved in 17304 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 36208ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 36214ms
Starting structural reductions in LTL mode, iteration 1 : 219/269 places, 295/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36560 ms. Remains : 219/269 places, 295/349 transitions.
[2024-05-30 02:31:03] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:31:03] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:31:03] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-30 02:31:03] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:31:03] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:31:03] [INFO ] Time to serialize gal into /tmp/CTLFireability11029299183455896713.gal : 4 ms
[2024-05-30 02:31:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13890626774032587686.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/CTLFireability11029299183455896713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13890626774032587686.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00687e+17,0.904231,22260,2,3754,5,89770,6,0,1161,89292,0


Converting to forward existential form...Done !
original formula: (EX((E(!(EG((p230==1))) U !((A((p380==1) U (p387==1)) + EX((p87==1))))) * E(AG(E((p304==1) U (p92==1))) U ((p199==1) * EX((p265==1)))))) ...284
=> equivalent forward existential formula: ([(EY((FwdU((EY(Init) * E(!(EG((p230==1))) U !((!((E(!((p387==1)) U (!((p380==1)) * !((p387==1)))) + EG(!((p387=...559
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t63, t95, t98, t115, t119, t137, t140, t152, t155, t172, t187, t207, t222,...292
Detected timeout of ITS tools.
[2024-05-30 02:31:33] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:31:33] [INFO ] Applying decomposition
[2024-05-30 02:31:33] [INFO ] Flatten gal took : 8 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/graph15065155864983167045.txt' '-o' '/tmp/graph15065155864983167045.bin' '-w' '/tmp/graph15065155864983167045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15065155864983167045.bin' '-l' '-1' '-v' '-w' '/tmp/graph15065155864983167045.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:31:33] [INFO ] Decomposing Gal with order
[2024-05-30 02:31:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:31:33] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-30 02:31:33] [INFO ] Flatten gal took : 21 ms
[2024-05-30 02:31:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-30 02:31:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14704730125260614167.gal : 3 ms
[2024-05-30 02:31:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13178364749219886254.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/CTLFireability14704730125260614167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13178364749219886254.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,1.00687e+17,0.196899,7120,391,39,6317,723,491,10195,60,2027,0


Converting to forward existential form...Done !
original formula: (EX((E(!(EG((i7.u39.p230==1))) U !((A((i12.i0.u67.p380==1) U (i12.i0.u70.p387==1)) + EX((i2.u15.p87==1))))) * E(AG(E((i10.u51.p304==1) U ...415
=> equivalent forward existential formula: ([(EY((FwdU((EY(Init) * E(!(EG((i7.u39.p230==1))) U !((!((E(!((i12.i0.u70.p387==1)) U (!((i12.i0.u67.p380==1)) *...746
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t98, t140, t155, i0.u83.t8, i1.i0.u8.t261, i2.u13.t243, i3.i0.u2.t264, i4.u21.t222,...432
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,1.4029,40912,1,0,74172,723,3617,150631,317,2027,130004
FORMULA SmartHome-PT-17-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Graph (trivial) has 274 edges and 269 vertex of which 133 / 269 are part of one of the 10 SCC in 1 ms
Free SCC test removed 123 places
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 145 transition count 132
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 72 rules applied. Total rules applied 131 place count 87 transition count 118
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 140 place count 80 transition count 116
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 79 transition count 115
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 142 place count 79 transition count 110
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 152 place count 74 transition count 110
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 163 place count 63 transition count 97
Iterating global reduction 4 with 11 rules applied. Total rules applied 174 place count 63 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 178 place count 63 transition count 93
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 180 place count 61 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 182 place count 61 transition count 91
Performed 29 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 240 place count 32 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 243 place count 32 transition count 57
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 245 place count 31 transition count 56
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 246 place count 30 transition count 52
Iterating global reduction 7 with 1 rules applied. Total rules applied 247 place count 30 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 29 transition count 51
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 250 place count 28 transition count 47
Iterating global reduction 7 with 1 rules applied. Total rules applied 251 place count 28 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 258 place count 28 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 259 place count 27 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 259 place count 27 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 261 place count 26 transition count 39
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 262 place count 25 transition count 37
Iterating global reduction 8 with 1 rules applied. Total rules applied 263 place count 25 transition count 37
Applied a total of 263 rules in 31 ms. Remains 25 /269 variables (removed 244) and now considering 37/349 (removed 312) transitions.
[2024-05-30 02:31:35] [INFO ] Flow matrix only has 29 transitions (discarded 8 similar events)
// Phase 1: matrix 29 rows 25 cols
[2024-05-30 02:31:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 02:31:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 02:31:35] [INFO ] Flow matrix only has 29 transitions (discarded 8 similar events)
[2024-05-30 02:31:35] [INFO ] Invariant cache hit.
[2024-05-30 02:31:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-30 02:31:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-30 02:31:35] [INFO ] Redundant transitions in 38 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 02:31:35] [INFO ] Flow matrix only has 29 transitions (discarded 8 similar events)
[2024-05-30 02:31:35] [INFO ] Invariant cache hit.
[2024-05-30 02:31:35] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 28/53 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/54 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 38 constraints, problems are : Problem set: 0 solved, 36 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 28/53 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/54 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 74 constraints, problems are : Problem set: 0 solved, 36 unsolved in 897 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1812ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1813ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/269 places, 37/349 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1977 ms. Remains : 25/269 places, 37/349 transitions.
[2024-05-30 02:31:37] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:31:37] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:31:37] [INFO ] Input system was already deterministic with 37 transitions.
[2024-05-30 02:31:37] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:31:37] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:31:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14721804786216485025.gal : 1 ms
[2024-05-30 02:31:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2292465125684000703.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/CTLFireability14721804786216485025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2292465125684000703.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,317953,0.012336,3556,2,72,5,451,6,0,124,424,0


Converting to forward existential form...Done !
original formula: AG(E(!(((p2==1)&&(p230==1))) U AF(EG(AG(((p2==1)&&(p450==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(((p2==1)&&(p230==1))) U !(EG(!(EG(!(E(TRUE U !(((p2==1)&&(p450==1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t10, t12, t14, t18, t20, t23, t33, Intersection with reachable at each s...215
(forward)formula 0,0,0.104094,5460,1,0,143,11972,103,73,832,14282,158
FORMULA SmartHome-PT-17-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Graph (trivial) has 284 edges and 269 vertex of which 154 / 269 are part of one of the 12 SCC in 1 ms
Free SCC test removed 142 places
Ensure Unique test removed 183 transitions
Reduce isomorphic transitions removed 183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 126 transition count 115
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 65 rules applied. Total rules applied 116 place count 76 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 123 place count 69 transition count 100
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 123 place count 69 transition count 97
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 129 place count 66 transition count 97
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 138 place count 57 transition count 86
Iterating global reduction 3 with 9 rules applied. Total rules applied 147 place count 57 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 57 transition count 84
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 203 place count 30 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 30 transition count 55
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 205 place count 29 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 29 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 28 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 209 place count 27 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 223 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 225 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 225 place count 25 transition count 32
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 227 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 229 place count 22 transition count 28
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 21 transition count 27
Applied a total of 232 rules in 21 ms. Remains 21 /269 variables (removed 248) and now considering 27/349 (removed 322) transitions.
[2024-05-30 02:31:37] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2024-05-30 02:31:37] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 02:31:37] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 02:31:37] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:31:37] [INFO ] Invariant cache hit.
[2024-05-30 02:31:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 02:31:37] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-30 02:31:37] [INFO ] Redundant transitions in 34 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 02:31:37] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:31:37] [INFO ] Invariant cache hit.
[2024-05-30 02:31:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/37 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/42 variables, and 22 constraints, problems are : Problem set: 0 solved, 13 unsolved in 272 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/37 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/39 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/42 variables, and 36 constraints, problems are : Problem set: 0 solved, 13 unsolved in 371 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 648ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 648ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/269 places, 27/349 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 828 ms. Remains : 21/269 places, 27/349 transitions.
[2024-05-30 02:31:38] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:31:38] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:31:38] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-30 02:31:38] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:31:38] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:31:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13046876369292306626.gal : 1 ms
[2024-05-30 02:31:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6957277116797226581.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13046876369292306626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6957277116797226581.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,43008,0.009672,3472,2,66,5,330,6,0,92,309,0


Converting to forward existential form...Done !
original formula: EF(AG((p264==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p264==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t17, t19, t22, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,1,0.025226,3792,1,0,57,2769,69,26,538,2185,57
FORMULA SmartHome-PT-17-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Graph (trivial) has 285 edges and 269 vertex of which 154 / 269 are part of one of the 12 SCC in 1 ms
Free SCC test removed 142 places
Ensure Unique test removed 183 transitions
Reduce isomorphic transitions removed 183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 126 transition count 114
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 66 rules applied. Total rules applied 118 place count 75 transition count 99
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 68 transition count 99
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 125 place count 68 transition count 97
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 66 transition count 97
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 138 place count 57 transition count 86
Iterating global reduction 3 with 9 rules applied. Total rules applied 147 place count 57 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 57 transition count 84
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 205 place count 29 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 29 transition count 54
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 207 place count 28 transition count 50
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 28 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 27 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 211 place count 26 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 26 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 225 place count 26 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 227 place count 24 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 227 place count 24 transition count 31
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 229 place count 23 transition count 31
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 231 place count 21 transition count 27
Iterating global reduction 6 with 2 rules applied. Total rules applied 233 place count 21 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 234 place count 20 transition count 26
Applied a total of 234 rules in 31 ms. Remains 20 /269 variables (removed 249) and now considering 26/349 (removed 323) transitions.
[2024-05-30 02:31:38] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 20 cols
[2024-05-30 02:31:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 02:31:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 02:31:38] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-05-30 02:31:38] [INFO ] Invariant cache hit.
[2024-05-30 02:31:38] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-30 02:31:38] [INFO ] Redundant transitions in 34 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 02:31:38] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-05-30 02:31:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 17/34 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/35 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/40 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 193 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 17/34 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/37 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 306 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 505ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 505ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/269 places, 26/349 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 679 ms. Remains : 20/269 places, 26/349 transitions.
[2024-05-30 02:31:39] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:31:39] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:31:39] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-30 02:31:39] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:31:39] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:31:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9108804504308991355.gal : 1 ms
[2024-05-30 02:31:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15728721237594194450.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9108804504308991355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15728721237594194450.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 5236 steps (350 resets) in 28 ms. (180 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-17-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 238 transition count 318
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 238 transition count 318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 238 transition count 315
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 78 place count 225 transition count 302
Iterating global reduction 1 with 13 rules applied. Total rules applied 91 place count 225 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 225 transition count 301
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 103 place count 214 transition count 290
Iterating global reduction 2 with 11 rules applied. Total rules applied 114 place count 214 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 214 transition count 289
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 212 transition count 287
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 212 transition count 287
Applied a total of 119 rules in 18 ms. Remains 212 /269 variables (removed 57) and now considering 287/349 (removed 62) transitions.
// Phase 1: matrix 287 rows 212 cols
[2024-05-30 02:31:39] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:31:39] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 02:31:39] [INFO ] Invariant cache hit.
[2024-05-30 02:31:39] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-30 02:31:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 215 constraints, problems are : Problem set: 0 solved, 286 unsolved in 14054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 286/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 501 constraints, problems are : Problem set: 0 solved, 286 unsolved in 12633 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
After SMT, in 26740ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 26749ms
Starting structural reductions in LTL mode, iteration 1 : 212/269 places, 287/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27122 ms. Remains : 212/269 places, 287/349 transitions.
[2024-05-30 02:32:06] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:32:06] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:32:06] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-30 02:32:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:32:06] [INFO ] Time to serialize gal into /tmp/CTLFireability903202549334886453.gal : 8 ms
[2024-05-30 02:32:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14408242656633050583.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/CTLFireability903202549334886453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14408242656633050583.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,6.84055e+16,0.73365,21428,2,3926,5,85241,6,0,1125,83053,0


Converting to forward existential form...Done !
original formula: EF(AX(((AG((p250==1)) * (p341==0)) * (p86==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((!(E(TRUE U !((p250==1)))) * (p341==0)) * (p86==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t135, t148, t151, t168, t183, t203, t218,...292
(forward)formula 0,1,6.23623,136420,1,0,341,677249,598,245,6368,639733,588
FORMULA SmartHome-PT-17-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Graph (trivial) has 275 edges and 269 vertex of which 142 / 269 are part of one of the 11 SCC in 0 ms
Free SCC test removed 131 places
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 137 transition count 128
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 63 rules applied. Total rules applied 116 place count 85 transition count 117
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 121 place count 80 transition count 117
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 121 place count 80 transition count 112
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 131 place count 75 transition count 112
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 141 place count 65 transition count 100
Iterating global reduction 3 with 10 rules applied. Total rules applied 151 place count 65 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 65 transition count 98
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 64 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 64 transition count 97
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 211 place count 36 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 215 place count 36 transition count 64
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 217 place count 35 transition count 63
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 218 place count 34 transition count 59
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 34 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 33 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 227 place count 33 transition count 52
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 228 place count 32 transition count 49
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 32 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 230 place count 31 transition count 48
Applied a total of 230 rules in 16 ms. Remains 31 /269 variables (removed 238) and now considering 48/349 (removed 301) transitions.
[2024-05-30 02:32:12] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
// Phase 1: matrix 36 rows 31 cols
[2024-05-30 02:32:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-30 02:32:12] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 02:32:12] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
[2024-05-30 02:32:12] [INFO ] Invariant cache hit.
[2024-05-30 02:32:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-30 02:32:12] [INFO ] Redundant transitions in 42 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-30 02:32:12] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
[2024-05-30 02:32:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/67 variables, and 33 constraints, problems are : Problem set: 0 solved, 27 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/31 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/64 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/67 variables, and 60 constraints, problems are : Problem set: 0 solved, 27 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/31 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 1010ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1010ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/269 places, 48/349 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1168 ms. Remains : 31/269 places, 48/349 transitions.
[2024-05-30 02:32:13] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:32:13] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:32:13] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-30 02:32:13] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:32:13] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:32:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5561369906475639633.gal : 1 ms
[2024-05-30 02:32:13] [INFO ] Time to serialize properties into /tmp/CTLFireability549168077676703113.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/CTLFireability5561369906475639633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability549168077676703113.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.0016e+06,0.016274,3616,2,95,5,912,6,0,151,822,0


Converting to forward existential form...Done !
original formula: E(AF((p154!=1)) U (!(A(EF(((p450==1)&&(p455==1))) U (p383==1))) + (p28==1)))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,!(EG(!((p154!=1))))),!((p383==1))) * !((p383==1))) * !(E(TRUE U ((p450==1)&&(p455==1)))))] !...284
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t18, t26, t28, t31, Intersection with reachable at each step enabled. (destroyed/rev...187
Hit Full ! (commute/partial/dont) 46/0/2
(forward)formula 0,1,0.167575,7104,1,0,164,20440,129,118,991,25199,224
FORMULA SmartHome-PT-17-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 349/349 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 238 transition count 318
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 238 transition count 318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 238 transition count 315
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 79 place count 224 transition count 301
Iterating global reduction 1 with 14 rules applied. Total rules applied 93 place count 224 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 224 transition count 300
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 104 place count 214 transition count 290
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 214 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 214 transition count 289
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 212 transition count 287
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 212 transition count 287
Applied a total of 119 rules in 22 ms. Remains 212 /269 variables (removed 57) and now considering 287/349 (removed 62) transitions.
// Phase 1: matrix 287 rows 212 cols
[2024-05-30 02:32:13] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:32:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 02:32:14] [INFO ] Invariant cache hit.
[2024-05-30 02:32:14] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-30 02:32:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 215 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15694 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/499 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 286/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 501 constraints, problems are : Problem set: 0 solved, 286 unsolved in 12803 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
After SMT, in 28550ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 28555ms
Starting structural reductions in LTL mode, iteration 1 : 212/269 places, 287/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28926 ms. Remains : 212/269 places, 287/349 transitions.
[2024-05-30 02:32:42] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:32:42] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:32:42] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-30 02:32:42] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:32:42] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:32:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17197356140463864411.gal : 4 ms
[2024-05-30 02:32:42] [INFO ] Time to serialize properties into /tmp/CTLFireability3788231912964578832.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/CTLFireability17197356140463864411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3788231912964578832.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,6.81678e+16,0.849687,21512,2,3918,5,86082,6,0,1125,85181,0


Converting to forward existential form...Done !
original formula: (AG(((p70==0) * AG(EX(TRUE)))) + EG((p94==0)))
=> equivalent forward existential formula: ([(FwdU((Init * !(EG((p94==0)))),TRUE) * !((p70==0)))] = FALSE * [(FwdU(FwdU((Init * !(EG((p94==0)))),TRUE),TRUE...181
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...292
Detected timeout of ITS tools.
[2024-05-30 02:33:13] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:33:13] [INFO ] Applying decomposition
[2024-05-30 02:33:13] [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/graph7766023699243228219.txt' '-o' '/tmp/graph7766023699243228219.bin' '-w' '/tmp/graph7766023699243228219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7766023699243228219.bin' '-l' '-1' '-v' '-w' '/tmp/graph7766023699243228219.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:33:13] [INFO ] Decomposing Gal with order
[2024-05-30 02:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:33:13] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-30 02:33:13] [INFO ] Flatten gal took : 16 ms
[2024-05-30 02:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-30 02:33:13] [INFO ] Time to serialize gal into /tmp/CTLFireability645309605609839071.gal : 4 ms
[2024-05-30 02:33:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1391757222782981242.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/CTLFireability645309605609839071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1391757222782981242.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 -...261
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,6.81678e+16,0.1389,7548,368,38,7592,431,478,12591,52,1128,0


Converting to forward existential form...Done !
original formula: (AG(((i1.u10.p70==0) * AG(EX(TRUE)))) + EG((i2.u15.p94==0)))
=> equivalent forward existential formula: ([(FwdU((Init * !(EG((i2.u15.p94==0)))),TRUE) * !((i1.u10.p70==0)))] = FALSE * [(FwdU(FwdU((Init * !(EG((i2.u15....202
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i1.u10.t253, i2.u12.t239, i3.u21.t216, i4.u27.t201, i5.u29.t...424
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,0.421693,16788,1,0,22085,431,3065,56455,250,1372,50500
FORMULA SmartHome-PT-17-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-30 02:33:13] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:33:13] [INFO ] Flatten gal took : 7 ms
Total runtime 438791 ms.

BK_STOP 1717036393658

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

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