Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901995100826.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SmartHome-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901995100826
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 159K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SmartHome-PT-18-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-18-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-18-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-18-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-18-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749251723855

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 23:15:25] [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]
[2025-06-06 23:15:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:15:25] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-06 23:15:25] [INFO ] Transformed 653 places.
[2025-06-06 23:15:25] [INFO ] Transformed 706 transitions.
[2025-06-06 23:15:25] [INFO ] Found NUPN structural information;
[2025-06-06 23:15:25] [INFO ] Parsed PT model containing 653 places and 706 transitions and 1618 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 206 places in 7 ms
Reduce places removed 206 places and 176 transitions.
Support contains 55 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 530/530 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 430 transition count 530
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 124 place count 323 transition count 423
Iterating global reduction 1 with 107 rules applied. Total rules applied 231 place count 323 transition count 423
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 241 place count 323 transition count 413
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 257 place count 307 transition count 397
Iterating global reduction 2 with 16 rules applied. Total rules applied 273 place count 307 transition count 397
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 288 place count 292 transition count 382
Iterating global reduction 2 with 15 rules applied. Total rules applied 303 place count 292 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 307 place count 288 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 311 place count 288 transition count 378
Applied a total of 311 rules in 97 ms. Remains 288 /447 variables (removed 159) and now considering 378/530 (removed 152) transitions.
// Phase 1: matrix 378 rows 288 cols
[2025-06-06 23:15:25] [INFO ] Computed 3 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:15:25] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-06 23:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:15:25] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2025-06-06 23:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/288 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/666 variables, 288/291 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 0/666 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 291 constraints, problems are : Problem set: 0 solved, 377 unsolved in 27555 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/288 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/666 variables, 288/291 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 377/668 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:16:04] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:16:04] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 670 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57663ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 57676ms
Starting structural reductions in LTL mode, iteration 1 : 288/447 places, 378/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58252 ms. Remains : 288/447 places, 378/530 transitions.
Support contains 55 out of 288 places after structural reductions.
[2025-06-06 23:16:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-06 23:16:23] [INFO ] Flatten gal took : 55 ms
[2025-06-06 23:16:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA SmartHome-PT-18-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 23:16:23] [INFO ] Flatten gal took : 29 ms
[2025-06-06 23:16:23] [INFO ] Input system was already deterministic with 378 transitions.
Support contains 39 out of 288 places (down from 55) after GAL structural reductions.
RANDOM walk for 39445 steps (128 resets) in 835 ms. (47 steps per ms) remains 0/30 properties
[2025-06-06 23:16:24] [INFO ] Flatten gal took : 22 ms
[2025-06-06 23:16:24] [INFO ] Flatten gal took : 16 ms
[2025-06-06 23:16:24] [INFO ] Input system was already deterministic with 378 transitions.
Computed a total of 63 stabilizing places and 62 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 264 transition count 354
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 264 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 264 transition count 353
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 251 transition count 340
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 251 transition count 340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 240 transition count 329
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 240 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 240 transition count 327
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 236 transition count 323
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 236 transition count 323
Applied a total of 107 rules in 29 ms. Remains 236 /288 variables (removed 52) and now considering 323/378 (removed 55) transitions.
// Phase 1: matrix 323 rows 236 cols
[2025-06-06 23:16:24] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:16:24] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-06 23:16:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:16:24] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2025-06-06 23:16:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 239 constraints, problems are : Problem set: 0 solved, 322 unsolved in 19530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 322/561 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:16:52] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 0/559 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 562 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49620ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 49622ms
Starting structural reductions in LTL mode, iteration 1 : 236/288 places, 323/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50043 ms. Remains : 236/288 places, 323/378 transitions.
[2025-06-06 23:17:14] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:17:14] [INFO ] Flatten gal took : 15 ms
[2025-06-06 23:17:14] [INFO ] Input system was already deterministic with 323 transitions.
[2025-06-06 23:17:14] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:17:14] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:17:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16274912098212178140.gal : 6 ms
[2025-06-06 23:17:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12493656248205534260.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16274912098212178140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12493656248205534260.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.0009e+19,0.939302,38272,2,6543,5,165226,6,0,1255,164773,0


Converting to forward existential form...Done !
original formula: AX(AG(AF((p224==0))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),!((p224==0)))] = FALSE
Hit Full ! (commute/partial/dont) 321/0/2
(forward)formula 0,0,4.61601,147236,1,0,13,828440,21,3,6014,392636,15
FORMULA SmartHome-PT-18-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 267 transition count 357
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 267 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 267 transition count 356
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 256 transition count 345
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 256 transition count 345
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 247 transition count 336
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 247 transition count 336
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 247 transition count 335
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 243 transition count 331
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 243 transition count 331
Applied a total of 92 rules in 25 ms. Remains 243 /288 variables (removed 45) and now considering 331/378 (removed 47) transitions.
// Phase 1: matrix 331 rows 243 cols
[2025-06-06 23:17:19] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:17:19] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 23:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:17:19] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2025-06-06 23:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 331/574 variables, 243/246 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/574 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 246 constraints, problems are : Problem set: 0 solved, 330 unsolved in 20396 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 331/574 variables, 243/246 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 330/576 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:17:48] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 577 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50443ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 50444ms
Starting structural reductions in LTL mode, iteration 1 : 243/288 places, 331/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50651 ms. Remains : 243/288 places, 331/378 transitions.
[2025-06-06 23:18:09] [INFO ] Flatten gal took : 14 ms
[2025-06-06 23:18:09] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:18:09] [INFO ] Input system was already deterministic with 331 transitions.
[2025-06-06 23:18:09] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:18:09] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:18:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12100583891630232816.gal : 5 ms
[2025-06-06 23:18:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4498353666294456990.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12100583891630232816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4498353666294456990.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.42903e+19,1.0096,42236,2,5834,5,192200,6,0,1291,180016,0


Converting to forward existential form...Done !
original formula: AX((((A(A((p415==1) U (p449==1)) U AG((p516==1))) + (p52==1)) + ((p357==1)||(p475==1))) + EX(AG((p82==0)))))
=> equivalent forward existential formula: ([(FwdU((FwdU((((EY(Init) * !(EX(!(E(TRUE U !((p82==0))))))) * !(((p357==1)||(p475==1)))) * !((p52==1))),!(!(E(T...425
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t63, t97, t100, t117, t120, t122, t138, t141, t153, t156, t173, t188, ...315
(forward)formula 0,0,11.5668,334012,1,0,423,1.90057e+06,694,305,7959,1.57925e+06,725
FORMULA SmartHome-PT-18-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 265 transition count 355
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 265 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 265 transition count 354
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 253 transition count 342
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 253 transition count 342
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 81 place count 243 transition count 332
Iterating global reduction 1 with 10 rules applied. Total rules applied 91 place count 243 transition count 332
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 243 transition count 331
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 238 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 238 transition count 326
Applied a total of 102 rules in 17 ms. Remains 238 /288 variables (removed 50) and now considering 326/378 (removed 52) transitions.
// Phase 1: matrix 326 rows 238 cols
[2025-06-06 23:18:21] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:18:21] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-06 23:18:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:18:21] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2025-06-06 23:18:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/564 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/564 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 241 constraints, problems are : Problem set: 0 solved, 325 unsolved in 19629 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/564 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 325/566 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:18:49] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)
(t2 1)
(t3 1)
(t4 0)
(t5 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 567 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49692ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 49693ms
Starting structural reductions in LTL mode, iteration 1 : 238/288 places, 326/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49978 ms. Remains : 238/288 places, 326/378 transitions.
[2025-06-06 23:19:11] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:19:11] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:19:11] [INFO ] Input system was already deterministic with 326 transitions.
[2025-06-06 23:19:11] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:19:11] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:19:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17956809211304123579.gal : 2 ms
[2025-06-06 23:19:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3810908112524275341.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17956809211304123579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3810908112524275341.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.05094e+19,0.795102,34536,2,5866,5,149113,6,0,1266,140531,0


Converting to forward existential form...Done !
original formula: AX(AG(((p1==1) + AG(EF((p401==0))))))
=> equivalent forward existential formula: [(FwdU((FwdU(EY(Init),TRUE) * !((p1==1))),TRUE) * !(E(TRUE U (p401==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t95, t98, t115, t118, t135, t138, t150, t153, t170, t185, t205, t220,...304
(forward)formula 0,1,7.2643,217448,1,0,375,1.08585e+06,673,273,6989,986923,662
FORMULA SmartHome-PT-18-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Graph (trivial) has 307 edges and 288 vertex of which 150 / 288 are part of one of the 14 SCC in 3 ms
Free SCC test removed 136 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 151 transition count 130
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 77 rules applied. Total rules applied 142 place count 87 transition count 117
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 152 place count 80 transition count 114
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 155 place count 78 transition count 113
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 77 transition count 112
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 157 place count 77 transition count 109
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 163 place count 74 transition count 109
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 174 place count 63 transition count 94
Iterating global reduction 5 with 11 rules applied. Total rules applied 185 place count 63 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 186 place count 63 transition count 93
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 187 place count 62 transition count 92
Iterating global reduction 6 with 1 rules applied. Total rules applied 188 place count 62 transition count 92
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 250 place count 31 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 31 transition count 60
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 253 place count 29 transition count 52
Iterating global reduction 7 with 2 rules applied. Total rules applied 255 place count 29 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 257 place count 28 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 272 place count 28 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 274 place count 26 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 274 place count 26 transition count 35
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 276 place count 25 transition count 35
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 278 place count 23 transition count 31
Iterating global reduction 8 with 2 rules applied. Total rules applied 280 place count 23 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 281 place count 22 transition count 30
Applied a total of 281 rules in 35 ms. Remains 22 /288 variables (removed 266) and now considering 30/378 (removed 348) transitions.
[2025-06-06 23:19:18] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
// Phase 1: matrix 23 rows 22 cols
[2025-06-06 23:19:18] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:19:18] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-06 23:19:18] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2025-06-06 23:19:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:19:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:19:19] [INFO ] Redundant transitions in 22 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:19:19] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2025-06-06 23:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/40 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/45 variables, and 21 constraints, problems are : Problem set: 0 solved, 12 unsolved in 177 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/40 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/42 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/45 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 219 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 400ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/288 places, 30/378 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 524 ms. Remains : 22/288 places, 30/378 transitions.
[2025-06-06 23:19:19] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:19:19] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:19:19] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-06 23:19:19] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:19:19] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:19:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8386770668791230545.gal : 0 ms
[2025-06-06 23:19:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4190951250285355905.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8386770668791230545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4190951250285355905.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,141312,0.004597,3876,2,65,5,347,6,0,97,325,0


Converting to forward existential form...Done !
original formula: EF(EG((p420==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p420==1))] != FALSE
Hit Full ! (commute/partial/dont) 28/0/2
(forward)formula 0,1,0.009072,4132,1,0,8,1579,19,2,507,1261,8
FORMULA SmartHome-PT-18-CTLFireability-2025-06 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 : 288/288 places, 378/378 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 266 transition count 356
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 266 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 266 transition count 355
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 255 transition count 344
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 255 transition count 344
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 246 transition count 335
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 246 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 87 place count 246 transition count 333
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 243 transition count 330
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 243 transition count 330
Applied a total of 93 rules in 24 ms. Remains 243 /288 variables (removed 45) and now considering 330/378 (removed 48) transitions.
// Phase 1: matrix 330 rows 243 cols
[2025-06-06 23:19:19] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:19:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-06 23:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:19:19] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2025-06-06 23:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/573 variables, 243/246 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (OVERLAPS) 0/573 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 246 constraints, problems are : Problem set: 0 solved, 329 unsolved in 20172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/573 variables, 243/246 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 329/575 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:19:48] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (OVERLAPS) 0/573 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 576 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50213ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 50213ms
Starting structural reductions in LTL mode, iteration 1 : 243/288 places, 330/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50414 ms. Remains : 243/288 places, 330/378 transitions.
[2025-06-06 23:20:09] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:20:09] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:20:09] [INFO ] Input system was already deterministic with 330 transitions.
[2025-06-06 23:20:09] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:20:09] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:20:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9066772779522048334.gal : 2 ms
[2025-06-06 23:20:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4142824265392096730.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9066772779522048334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4142824265392096730.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26944e+19,0.863616,35224,2,6844,5,153330,6,0,1290,142481,0


Converting to forward existential form...Done !
original formula: EG((EF((p360==1)) * (AX(EG((p154==1))) + AF(((p489==1)||(p235==1))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (p360==1)) * (!(EX(!(EG((p154==1))))) + !(EG(!(((p489==1)||(p235==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t28, t31, t60, t92, t95, t112, t118, t135, t138, t150, t153, t170, t185, t209, t224,...304
Detected timeout of ITS tools.
[2025-06-06 23:20:40] [INFO ] Flatten gal took : 16 ms
[2025-06-06 23:20:40] [INFO ] Applying decomposition
[2025-06-06 23:20:40] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12643160196214537140.txt' '-o' '/tmp/graph12643160196214537140.bin' '-w' '/tmp/graph12643160196214537140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12643160196214537140.bin' '-l' '-1' '-v' '-w' '/tmp/graph12643160196214537140.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:20:40] [INFO ] Decomposing Gal with order
[2025-06-06 23:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:20:40] [INFO ] Removed a total of 83 redundant transitions.
[2025-06-06 23:20:40] [INFO ] Flatten gal took : 170 ms
[2025-06-06 23:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2025-06-06 23:20:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8036026676814628077.gal : 4 ms
[2025-06-06 23:20:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1752202091111914251.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8036026676814628077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1752202091111914251.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.26944e+19,0.102519,8536,470,40,8492,544,534,14958,61,1638,0


Converting to forward existential form...Done !
original formula: EG((EF((i10.u58.p360==1)) * (AX(EG((i5.u25.p154==1))) + AF(((i14.u84.p489==1)||(i6.i1.u37.p235==1))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (i10.u58.p360==1)) * (!(EX(!(EG((i5.u25.p154==1))))) + !(EG(!(((i14.u84.p489==1)||(i6.i1.u3...182
Reverse transition relation is NOT exact ! Due to transitions t31, t95, t138, t153, i0.i0.u1.t296, i0.i0.u91.t8, i1.u11.t293, i2.u13.t279, i3.u21.t259, i4....471
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
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,12.4242,234328,1,0,410493,606,3679,717887,291,2341,365338
FORMULA SmartHome-PT-18-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 266 transition count 356
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 266 transition count 356
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 253 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 253 transition count 343
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 242 transition count 332
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 242 transition count 332
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 242 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 237 transition count 325
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 237 transition count 325
Applied a total of 104 rules in 21 ms. Remains 237 /288 variables (removed 51) and now considering 325/378 (removed 53) transitions.
// Phase 1: matrix 325 rows 237 cols
[2025-06-06 23:20:52] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:20:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 23:20:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:20:53] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-06 23:20:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/562 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/562 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 240 constraints, problems are : Problem set: 0 solved, 324 unsolved in 19756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/562 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 324/564 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:21:20] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:21:20] [INFO ] Deduced a trap along path composed of 2 places in 52 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/562 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 566 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49790ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 49791ms
Starting structural reductions in LTL mode, iteration 1 : 237/288 places, 325/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50010 ms. Remains : 237/288 places, 325/378 transitions.
[2025-06-06 23:21:42] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:21:42] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:21:42] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-06 23:21:42] [INFO ] Flatten gal took : 21 ms
[2025-06-06 23:21:42] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:21:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6552619582421608384.gal : 1 ms
[2025-06-06 23:21:42] [INFO ] Time to serialize properties into /tmp/CTLFireability225284968304632483.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6552619582421608384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability225284968304632483.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.50135e+19,0.856548,35988,2,5945,5,156241,6,0,1261,150055,0


Converting to forward existential form...Done !
original formula: A(!(EX((!(((AG((p35==1)) + (p225==1)) + (p208==1))) * (AG((p427==1)) + AG((p166==1)))))) U (!(EG(EF((p370==1)))) + (p133==1)))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(E(TRUE U (p370==1)))) + (p133==1)))))) * !(E(!((!(EG(E(TRUE U (p370==1)))) + (p133==1))) ...343
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t202, t217,...310
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.95873,287360,1,0,401,1.61349e+06,689,291,7762,1.38819e+06,701
FORMULA SmartHome-PT-18-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Graph (trivial) has 296 edges and 288 vertex of which 154 / 288 are part of one of the 14 SCC in 1 ms
Free SCC test removed 140 places
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 147 transition count 135
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 63 rules applied. Total rules applied 118 place count 93 transition count 126
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 89 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 86 transition count 123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 128 place count 86 transition count 119
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 136 place count 82 transition count 119
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 144 place count 74 transition count 109
Iterating global reduction 4 with 8 rules applied. Total rules applied 152 place count 74 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 74 transition count 108
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 215 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 43 transition count 76
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 42 transition count 72
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 42 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 234 place count 42 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 41 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 235 place count 41 transition count 55
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 237 place count 40 transition count 55
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 239 place count 38 transition count 51
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 38 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 37 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 243 place count 36 transition count 50
Applied a total of 243 rules in 24 ms. Remains 36 /288 variables (removed 252) and now considering 50/378 (removed 328) transitions.
[2025-06-06 23:21:52] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
// Phase 1: matrix 41 rows 36 cols
[2025-06-06 23:21:52] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:21:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 23:21:52] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
[2025-06-06 23:21:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:21:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-06 23:21:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:21:52] [INFO ] Redundant transitions in 25 ms returned []
Running 28 sub problems to find dead transitions.
[2025-06-06 23:21:52] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
[2025-06-06 23:21:52] [INFO ] Invariant cache hit.
[2025-06-06 23:21:52] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 36/65 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 9/74 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/77 variables, and 38 constraints, problems are : Problem set: 0 solved, 28 unsolved in 432 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 35/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 36/65 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 9/74 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/74 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/77 variables, and 66 constraints, problems are : Problem set: 0 solved, 28 unsolved in 381 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 35/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 819ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 820ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/288 places, 50/378 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 938 ms. Remains : 36/288 places, 50/378 transitions.
[2025-06-06 23:21:52] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:21:52] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:21:52] [INFO ] Input system was already deterministic with 50 transitions.
[2025-06-06 23:21:52] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:21:52] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:21:52] [INFO ] Time to serialize gal into /tmp/CTLFireability553316590721308072.gal : 0 ms
[2025-06-06 23:21:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10220459654813026396.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability553316590721308072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10220459654813026396.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.96262e+06,0.009087,3952,2,123,5,645,6,0,169,585,0


Converting to forward existential form...Done !
original formula: EF(((p218==1) + (((p414==0)&&(p134==1)) * E(((p330==1)||(p413==1)) U ((p497==1)&&(p438==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p218==1))] != FALSE + [(FwdU((FwdU(Init,TRUE) * ((p414==0)&&(p134==1))),((p330==1)||(p413=...197
(forward)formula 0,1,0.00974,4208,1,0,7,645,8,1,172,585,1
FORMULA SmartHome-PT-18-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 264 transition count 354
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 264 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 264 transition count 353
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 251 transition count 340
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 251 transition count 340
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 241 transition count 330
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 241 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 241 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 237 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 237 transition count 324
Applied a total of 105 rules in 14 ms. Remains 237 /288 variables (removed 51) and now considering 324/378 (removed 54) transitions.
// Phase 1: matrix 324 rows 237 cols
[2025-06-06 23:21:53] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:21:53] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 23:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:21:53] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2025-06-06 23:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/561 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 240 constraints, problems are : Problem set: 0 solved, 323 unsolved in 19673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 323/563 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:22:20] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 564 constraints, problems are : Problem set: 0 solved, 323 unsolved in 29987 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49693ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 49694ms
Starting structural reductions in LTL mode, iteration 1 : 237/288 places, 324/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49869 ms. Remains : 237/288 places, 324/378 transitions.
[2025-06-06 23:22:42] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:22:42] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:22:42] [INFO ] Input system was already deterministic with 324 transitions.
[2025-06-06 23:22:42] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:22:42] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:22:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6710084076584386789.gal : 2 ms
[2025-06-06 23:22:42] [INFO ] Time to serialize properties into /tmp/CTLFireability12847288642594895014.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6710084076584386789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12847288642594895014.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.00822e+19,0.960155,36992,2,6542,5,157744,6,0,1260,159535,0


Converting to forward existential form...Done !
original formula: AG((((p141==0)||(p330==1)) + (((p265==1)&&(p521==1)) + (AX(FALSE) * (AF((p320==1)) + AF((p371==1)))))))
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !(((p141==0)||(p330==1)))) * !(((p265==1)&&(p521==1))))) * !(FALSE))] = FALSE * [FwdG(...281
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t136, t148, t151, t168, t183, t203, t218,...304
Detected timeout of ITS tools.
[2025-06-06 23:23:13] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:23:13] [INFO ] Applying decomposition
[2025-06-06 23:23:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2507669748703487480.txt' '-o' '/tmp/graph2507669748703487480.bin' '-w' '/tmp/graph2507669748703487480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2507669748703487480.bin' '-l' '-1' '-v' '-w' '/tmp/graph2507669748703487480.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:23:13] [INFO ] Decomposing Gal with order
[2025-06-06 23:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:23:13] [INFO ] Removed a total of 80 redundant transitions.
[2025-06-06 23:23:13] [INFO ] Flatten gal took : 30 ms
[2025-06-06 23:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-06-06 23:23:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16692275638425255548.gal : 3 ms
[2025-06-06 23:23:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10140585195292688532.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16692275638425255548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10140585195292688532.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.00822e+19,0.129916,7444,525,45,6445,518,513,10035,66,1434,0


Converting to forward existential form...Done !
original formula: AG((((i3.u18.p141==0)||(i9.u46.p330==1)) + (((i7.u40.p265==1)&&(i0.u88.p521==1)) + (AX(FALSE) * (AF((i9.u49.p320==1)) + AF((i11.u57.p371=...164
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !(((i3.u18.p141==0)||(i9.u46.p330==1)))) * !(((i7.u40.p265==1)&&(i0.u88.p521==1))))) *...352
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t151, i0.u1.t290, i0.u88.t8, i1.u11.t287, i2.u12.t273, i3.u18.t253, i4.u...457
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
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 4
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,0.462238,24212,1,0,38982,888,4187,82205,372,2992,110602
FORMULA SmartHome-PT-18-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 264 transition count 354
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 264 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 264 transition count 353
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 62 place count 251 transition count 340
Iterating global reduction 1 with 13 rules applied. Total rules applied 75 place count 251 transition count 340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 86 place count 240 transition count 329
Iterating global reduction 1 with 11 rules applied. Total rules applied 97 place count 240 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 240 transition count 327
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 235 transition count 322
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 235 transition count 322
Applied a total of 109 rules in 19 ms. Remains 235 /288 variables (removed 53) and now considering 322/378 (removed 56) transitions.
// Phase 1: matrix 322 rows 235 cols
[2025-06-06 23:23:13] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:23:13] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-06 23:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:23:13] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2025-06-06 23:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 238 constraints, problems are : Problem set: 0 solved, 321 unsolved in 19139 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:23:40] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 560 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49182ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 49182ms
Starting structural reductions in LTL mode, iteration 1 : 235/288 places, 322/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49429 ms. Remains : 235/288 places, 322/378 transitions.
[2025-06-06 23:24:03] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:24:03] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:24:03] [INFO ] Input system was already deterministic with 322 transitions.
[2025-06-06 23:24:03] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:24:03] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:24:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12890987387374292703.gal : 1 ms
[2025-06-06 23:24:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13872634905404569569.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12890987387374292703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13872634905404569569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,9.38341e+18,1.04808,37892,2,5998,5,166703,6,0,1250,156590,0


Converting to forward existential form...Done !
original formula: AF(EX(AF(EG(AG((p477==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!(EG(!(E(TRUE U !((p477==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...304
(forward)formula 0,0,19.5549,596184,1,0,484,3.83428e+06,676,330,7706,2.82834e+06,799
FORMULA SmartHome-PT-18-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 266 transition count 356
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 266 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 266 transition count 355
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 255 transition count 344
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 255 transition count 344
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 247 transition count 336
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 247 transition count 336
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 247 transition count 335
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 243 transition count 331
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 243 transition count 331
Applied a total of 92 rules in 12 ms. Remains 243 /288 variables (removed 45) and now considering 331/378 (removed 47) transitions.
// Phase 1: matrix 331 rows 243 cols
[2025-06-06 23:24:22] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:24:22] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-06 23:24:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:24:23] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2025-06-06 23:24:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 331/574 variables, 243/246 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/574 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 246 constraints, problems are : Problem set: 0 solved, 330 unsolved in 19818 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 331/574 variables, 243/246 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 330/576 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:24:51] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 577 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49847ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 49847ms
Starting structural reductions in LTL mode, iteration 1 : 243/288 places, 331/378 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50062 ms. Remains : 243/288 places, 331/378 transitions.
[2025-06-06 23:25:12] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:25:12] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:25:12] [INFO ] Input system was already deterministic with 331 transitions.
[2025-06-06 23:25:12] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:25:12] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:25:12] [INFO ] Time to serialize gal into /tmp/CTLFireability14757321660895063919.gal : 1 ms
[2025-06-06 23:25:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9390931247620317075.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14757321660895063919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9390931247620317075.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.19997e+19,0.976596,40856,2,6750,5,184917,6,0,1291,171034,0


Converting to forward existential form...Done !
original formula: AG((EF(((p196==0) + EG((p415==1)))) + ((AX(FALSE) * EG((p391==1))) * ((p166==1)||(p401==1)))))
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !(E(TRUE U ((p196==0) + EG((p415==1))))))) * !(FALSE))] = FALSE * [((FwdU(Init,TRUE) *...331
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t97, t103, t120, t123, t140, t143, t155, t158, t175, t190, t210, t225...305
(forward)formula 0,1,9.05786,287176,1,0,468,1.58146e+06,697,316,7522,1.37029e+06,779
FORMULA SmartHome-PT-18-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 288/288 places, 378/378 transitions.
Graph (trivial) has 306 edges and 288 vertex of which 162 / 288 are part of one of the 14 SCC in 0 ms
Free SCC test removed 148 places
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 139 transition count 124
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 118 place count 84 transition count 117
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 81 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 80 transition count 116
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 123 place count 80 transition count 112
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 131 place count 76 transition count 112
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 141 place count 66 transition count 98
Iterating global reduction 4 with 10 rules applied. Total rules applied 151 place count 66 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 66 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 65 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 65 transition count 96
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 216 place count 34 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 217 place count 34 transition count 64
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 219 place count 32 transition count 56
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 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 223 place count 31 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 237 place count 31 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 238 place count 30 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 238 place count 30 transition count 40
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 240 place count 29 transition count 40
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 242 place count 27 transition count 36
Iterating global reduction 7 with 2 rules applied. Total rules applied 244 place count 27 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 245 place count 26 transition count 35
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 12 edges and 25 vertex of which 2 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 247 place count 24 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 249 place count 24 transition count 33
Applied a total of 249 rules in 35 ms. Remains 24 /288 variables (removed 264) and now considering 33/378 (removed 345) transitions.
[2025-06-06 23:25:22] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
// Phase 1: matrix 26 rows 24 cols
[2025-06-06 23:25:22] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:25:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 23:25:22] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2025-06-06 23:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:25:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:25:22] [INFO ] Redundant transitions in 28 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 23:25:22] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2025-06-06 23:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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/50 variables, and 23 constraints, problems are : Problem set: 0 solved, 14 unsolved in 167 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/24 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/46 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/47 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/47 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/50 variables, and 38 constraints, problems are : Problem set: 0 solved, 14 unsolved in 313 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 507ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 507ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/288 places, 33/378 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 649 ms. Remains : 24/288 places, 33/378 transitions.
[2025-06-06 23:25:22] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:25:22] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:25:22] [INFO ] Input system was already deterministic with 33 transitions.
[2025-06-06 23:25:22] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:25:22] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:25:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8595455155351428946.gal : 0 ms
[2025-06-06 23:25:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5387060449454382037.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8595455155351428946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5387060449454382037.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,282624,0.006418,3932,2,71,5,390,6,0,109,360,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(((p336==1)&&(p428==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((p336==1)&&(p428==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t12, t19, t21, t24, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,0,0.015868,4316,1,0,59,3633,80,28,627,2950,68
FORMULA SmartHome-PT-18-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-06 23:25:22] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:25:22] [INFO ] Flatten gal took : 6 ms
Total runtime 597772 ms.

BK_STOP 1749252322889

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-18"
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-5832"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-18, 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 r212-tall-174901995100826"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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