Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901995100834.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-19, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901995100834
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 181K 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-19-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-19-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-19-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-19-CTLFireability-2023-15
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-00
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-01
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-02
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-03
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-04
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-05
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-06
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-07
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-08
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-09
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-10
FORMULA_NAME SmartHome-PT-19-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749252334703

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 23:25:35] [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:25:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:25:36] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2025-06-06 23:25:36] [INFO ] Transformed 741 places.
[2025-06-06 23:25:36] [INFO ] Transformed 809 transitions.
[2025-06-06 23:25:36] [INFO ] Found NUPN structural information;
[2025-06-06 23:25:36] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 227 places in 9 ms
Reduce places removed 227 places and 198 transitions.
FORMULA SmartHome-PT-19-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 495 transition count 611
Discarding 109 places :
Symmetric choice reduction at 1 with 109 rule applications. Total rules 128 place count 386 transition count 502
Iterating global reduction 1 with 109 rules applied. Total rules applied 237 place count 386 transition count 502
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 246 place count 386 transition count 493
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 265 place count 367 transition count 474
Iterating global reduction 2 with 19 rules applied. Total rules applied 284 place count 367 transition count 474
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 302 place count 349 transition count 456
Iterating global reduction 2 with 18 rules applied. Total rules applied 320 place count 349 transition count 456
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 322 place count 349 transition count 454
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 326 place count 345 transition count 450
Iterating global reduction 3 with 4 rules applied. Total rules applied 330 place count 345 transition count 450
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 331 place count 344 transition count 449
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 344 transition count 449
Applied a total of 332 rules in 120 ms. Remains 344 /514 variables (removed 170) and now considering 449/611 (removed 162) transitions.
// Phase 1: matrix 449 rows 344 cols
[2025-06-06 23:25:36] [INFO ] Computed 3 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:25:36] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-06 23:25:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:25:36] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2025-06-06 23:25:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/344 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 449/793 variables, 344/347 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 793/793 variables, and 347 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/344 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 449/793 variables, 344/347 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 448/795 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:26:23] [INFO ] Deduced a trap along path composed of 4 places in 43 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/793 variables, and 796 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 344/514 places, 449/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60809 ms. Remains : 344/514 places, 449/611 transitions.
Support contains 84 out of 344 places after structural reductions.
[2025-06-06 23:26:37] [INFO ] Flatten gal took : 51 ms
[2025-06-06 23:26:37] [INFO ] Flatten gal took : 23 ms
[2025-06-06 23:26:37] [INFO ] Input system was already deterministic with 449 transitions.
Support contains 65 out of 344 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (109 resets) in 1382 ms. (28 steps per ms) remains 3/52 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 84 ms. (470 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 41 ms. (952 steps per ms) remains 1/2 properties
[2025-06-06 23:26:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/26 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/59 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/125 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/131 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 158/289 variables, 50/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 151/440 variables, 70/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/441 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/441 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/441 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 118/559 variables, 59/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 97/656 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 51/707 variables, 30/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/707 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 19/726 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/726 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/731 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/731 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/735 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/735 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 5/740 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/740 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 10/750 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/750 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 11/761 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/761 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 10/771 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/771 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 12/783 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/783 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 8/791 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/791 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 2/793 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/793 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/793 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/26 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/59 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/125 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/131 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 158/289 variables, 50/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 151/440 variables, 70/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/441 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/441 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/441 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 118/559 variables, 59/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 97/656 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 51/707 variables, 30/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/707 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 19/726 variables, 13/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/726 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 5/731 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/731 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/735 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/735 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 5/740 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/740 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 10/750 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/750 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 11/761 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/761 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 10/771 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/771 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 12/783 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/783 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 8/791 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/791 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/793 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/793 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/793 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 793/793 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1193ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 449/449 transitions.
Graph (trivial) has 367 edges and 344 vertex of which 197 / 344 are part of one of the 15 SCC in 2 ms
Free SCC test removed 182 places
Drop transitions (Empty/Sink Transition effects.) removed 263 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 270 transitions.
Graph (complete) has 250 edges and 162 vertex of which 152 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 152 transition count 114
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 66 rules applied. Total rules applied 126 place count 95 transition count 105
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 90 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 131 place count 90 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 86 transition count 101
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 159 place count 66 transition count 81
Iterating global reduction 3 with 20 rules applied. Total rules applied 179 place count 66 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 184 place count 66 transition count 76
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 186 place count 65 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 186 place count 65 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 62 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 62 transition count 72
Performed 33 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 258 place count 29 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 43 edges and 29 vertex of which 15 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 5 with 23 rules applied. Total rules applied 281 place count 15 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 283 place count 15 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 284 place count 14 transition count 11
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 6 rules applied. Total rules applied 290 place count 10 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 292 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 292 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 296 place count 6 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 297 place count 5 transition count 6
Applied a total of 297 rules in 25 ms. Remains 5 /344 variables (removed 339) and now considering 6/449 (removed 443) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/344 places, 6/449 transitions.
RANDOM walk for 24 steps (2 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
[2025-06-06 23:26:39] [INFO ] Flatten gal took : 17 ms
[2025-06-06 23:26:39] [INFO ] Flatten gal took : 18 ms
[2025-06-06 23:26:39] [INFO ] Input system was already deterministic with 449 transitions.
Computed a total of 74 stabilizing places and 73 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Graph (trivial) has 368 edges and 344 vertex of which 201 / 344 are part of one of the 16 SCC in 1 ms
Free SCC test removed 185 places
Ensure Unique test removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 158 transition count 148
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 63 rules applied. Total rules applied 121 place count 101 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 98 transition count 142
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 124 place count 98 transition count 138
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 94 transition count 138
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 150 place count 76 transition count 117
Iterating global reduction 3 with 18 rules applied. Total rules applied 168 place count 76 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 170 place count 76 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 74 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 74 transition count 113
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 246 place count 38 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 250 place count 38 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 37 transition count 72
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 255 place count 33 transition count 59
Iterating global reduction 6 with 4 rules applied. Total rules applied 259 place count 33 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 263 place count 31 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 278 place count 31 transition count 42
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 280 place count 29 transition count 38
Iterating global reduction 6 with 2 rules applied. Total rules applied 282 place count 29 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 284 place count 27 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 285 place count 26 transition count 36
Applied a total of 285 rules in 22 ms. Remains 26 /344 variables (removed 318) and now considering 36/449 (removed 413) transitions.
[2025-06-06 23:26:39] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
// Phase 1: matrix 28 rows 26 cols
[2025-06-06 23:26:39] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-06 23:26:39] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
[2025-06-06 23:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:26:39] [INFO ] Redundant transitions in 20 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 23:26:39] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
[2025-06-06 23:26:39] [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) 1/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 23/44 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 5/49 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/54 variables, and 26 constraints, problems are : Problem set: 0 solved, 14 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/26 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) 1/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 23/44 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 5/49 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/50 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/50 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/51 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/51 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/54 variables, and 41 constraints, problems are : Problem set: 0 solved, 14 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 428ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/344 places, 36/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 528 ms. Remains : 26/344 places, 36/449 transitions.
[2025-06-06 23:26:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:26:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 23:26:39] [INFO ] Input system was already deterministic with 36 transitions.
RANDOM walk for 71 steps (1 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-19-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 23:26:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:26:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 23:26:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17252210787042529821.gal : 1 ms
[2025-06-06 23:26:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7838340236592735965.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17252210787042529821.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7838340236592735965.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Graph (trivial) has 367 edges and 344 vertex of which 190 / 344 are part of one of the 16 SCC in 1 ms
Free SCC test removed 174 places
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 169 transition count 151
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 78 rules applied. Total rules applied 146 place count 102 transition count 140
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 96 transition count 139
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 95 transition count 138
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 155 place count 95 transition count 135
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 161 place count 92 transition count 135
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 181 place count 72 transition count 112
Iterating global reduction 4 with 20 rules applied. Total rules applied 201 place count 72 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 204 place count 72 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 206 place count 70 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 70 transition count 107
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 278 place count 35 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 279 place count 35 transition count 70
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 285 place count 29 transition count 50
Iterating global reduction 6 with 6 rules applied. Total rules applied 291 place count 29 transition count 50
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 293 place count 28 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 306 place count 28 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 308 place count 26 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 308 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 7 with 2 rules applied. Total rules applied 310 place count 25 transition count 35
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 312 place count 23 transition count 31
Iterating global reduction 7 with 2 rules applied. Total rules applied 314 place count 23 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 315 place count 22 transition count 30
Applied a total of 315 rules in 20 ms. Remains 22 /344 variables (removed 322) and now considering 30/449 (removed 419) transitions.
[2025-06-06 23:26:39] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 22 cols
[2025-06-06 23:26:39] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 23:26:39] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2025-06-06 23:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:26:39] [INFO ] Redundant transitions in 16 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-06 23:26:39] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2025-06-06 23:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/46 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 128 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/22 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/46 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 195 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 327ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/344 places, 30/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 418 ms. Remains : 22/344 places, 30/449 transitions.
[2025-06-06 23:26:40] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:26:40] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:26:40] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-06 23:26:40] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:26:40] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12413072251374927036.gal : 0 ms
[2025-06-06 23:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13299361483225629584.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/CTLFireability12413072251374927036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13299361483225629584.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,145728,0.012106,3836,2,74,5,425,6,0,101,407,0


Converting to forward existential form...Done !
original formula: (AF((p405!=1)) * EF((p459==1)))
=> equivalent forward existential formula: ([FwdG(Init,!((p405!=1)))] = FALSE * [(Init * !(E(TRUE U (p459==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t21, t23, t24, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,1,0.022567,4604,1,0,57,3920,84,30,602,3370,66
FORMULA SmartHome-PT-19-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Graph (trivial) has 370 edges and 344 vertex of which 207 / 344 are part of one of the 16 SCC in 1 ms
Free SCC test removed 191 places
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 251 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 152 transition count 141
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 119 place count 96 transition count 135
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 122 place count 93 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 122 place count 93 transition count 132
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 90 transition count 132
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 148 place count 70 transition count 109
Iterating global reduction 3 with 20 rules applied. Total rules applied 168 place count 70 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 70 transition count 106
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 173 place count 68 transition count 104
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 68 transition count 104
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 245 place count 33 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 246 place count 33 transition count 67
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 252 place count 27 transition count 47
Iterating global reduction 5 with 6 rules applied. Total rules applied 258 place count 27 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 26 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 273 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 275 place count 24 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 275 place count 24 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 277 place count 23 transition count 32
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 279 place count 21 transition count 28
Iterating global reduction 6 with 2 rules applied. Total rules applied 281 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 282 place count 20 transition count 27
Applied a total of 282 rules in 17 ms. Remains 20 /344 variables (removed 324) and now considering 27/449 (removed 422) transitions.
[2025-06-06 23:26:40] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 20 cols
[2025-06-06 23:26:40] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-06 23:26:40] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 23:26:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:40] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:26:40] [INFO ] Redundant transitions in 29 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-06 23:26:40] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2025-06-06 23:26:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/41 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 116 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/41 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 272ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 272ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/344 places, 27/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 372 ms. Remains : 20/344 places, 27/449 transitions.
[2025-06-06 23:26:40] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:26:40] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:26:40] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 23:26:40] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:26:40] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14612245921039562268.gal : 0 ms
[2025-06-06 23:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9140369868194952363.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/CTLFireability14612245921039562268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9140369868194952363.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,72864,0.003953,3844,2,57,5,323,6,0,89,324,0


Converting to forward existential form...Done !
original formula: AG(EF((p353!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p353!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t19, t20, t21, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
(forward)formula 0,1,0.010618,4228,1,0,52,2765,68,23,522,2320,57
FORMULA SmartHome-PT-19-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 305 transition count 410
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 305 transition count 410
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 305 transition count 406
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 97 place count 290 transition count 391
Iterating global reduction 1 with 15 rules applied. Total rules applied 112 place count 290 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 113 place count 290 transition count 390
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 123 place count 280 transition count 380
Iterating global reduction 2 with 10 rules applied. Total rules applied 133 place count 280 transition count 380
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 140 place count 273 transition count 373
Iterating global reduction 2 with 7 rules applied. Total rules applied 147 place count 273 transition count 373
Applied a total of 147 rules in 24 ms. Remains 273 /344 variables (removed 71) and now considering 373/449 (removed 76) transitions.
// Phase 1: matrix 373 rows 273 cols
[2025-06-06 23:26:40] [INFO ] Computed 3 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:40] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 23:26:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:26:40] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2025-06-06 23:26:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 276 constraints, problems are : Problem set: 0 solved, 372 unsolved in 25566 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 372/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:27:16] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 649 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55630ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 55631ms
Starting structural reductions in LTL mode, iteration 1 : 273/344 places, 373/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55861 ms. Remains : 273/344 places, 373/449 transitions.
[2025-06-06 23:27:36] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:27:36] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:27:36] [INFO ] Input system was already deterministic with 373 transitions.
[2025-06-06 23:27:36] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:27:36] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:27:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16343419679197143393.gal : 7 ms
[2025-06-06 23:27:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1472362991267936435.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/CTLFireability16343419679197143393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1472362991267936435.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,2.91677e+21,1.36584,54324,2,7918,5,248976,6,0,1451,234522,0


Converting to forward existential form...Done !
original formula: AG(((p296==1) + AG(EX(TRUE))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((p296==1))),TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t203, t218,...316
(forward)formula 0,0,10.1417,312940,1,0,424,1.42295e+06,764,316,8198,1.47916e+06,755
FORMULA SmartHome-PT-19-CTLFireability-2025-03 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 : 344/344 places, 449/449 transitions.
Graph (trivial) has 363 edges and 344 vertex of which 199 / 344 are part of one of the 16 SCC in 1 ms
Free SCC test removed 183 places
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 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 160 transition count 153
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 59 rules applied. Total rules applied 115 place count 105 transition count 149
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 103 transition count 147
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 101 transition count 146
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 122 place count 101 transition count 141
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 132 place count 96 transition count 141
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 150 place count 78 transition count 120
Iterating global reduction 4 with 18 rules applied. Total rules applied 168 place count 78 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 171 place count 78 transition count 117
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 76 transition count 115
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 76 transition count 115
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 249 place count 39 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 252 place count 39 transition count 74
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 256 place count 35 transition count 62
Iterating global reduction 6 with 4 rules applied. Total rules applied 260 place count 35 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 264 place count 33 transition count 60
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 280 place count 33 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 281 place count 32 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 281 place count 32 transition count 43
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 283 place count 31 transition count 43
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 285 place count 29 transition count 39
Iterating global reduction 7 with 2 rules applied. Total rules applied 287 place count 29 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 288 place count 28 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 289 place count 27 transition count 38
Applied a total of 289 rules in 23 ms. Remains 27 /344 variables (removed 317) and now considering 38/449 (removed 411) transitions.
[2025-06-06 23:27:46] [INFO ] Flow matrix only has 30 transitions (discarded 8 similar events)
// Phase 1: matrix 30 rows 27 cols
[2025-06-06 23:27:46] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:46] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 23:27:46] [INFO ] Flow matrix only has 30 transitions (discarded 8 similar events)
[2025-06-06 23:27:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:27:46] [INFO ] Redundant transitions in 18 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-06 23:27:46] [INFO ] Flow matrix only has 30 transitions (discarded 8 similar events)
[2025-06-06 23:27:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 25/47 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 5/52 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/57 variables, and 26 constraints, problems are : Problem set: 0 solved, 16 unsolved in 200 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 25/47 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 5/52 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/53 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/54 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/54 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/54 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/57 variables, and 43 constraints, problems are : Problem set: 0 solved, 16 unsolved in 310 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 530ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/344 places, 38/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 629 ms. Remains : 27/344 places, 38/449 transitions.
[2025-06-06 23:27:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:47] [INFO ] Input system was already deterministic with 38 transitions.
[2025-06-06 23:27:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:47] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6652897019557313314.gal : 0 ms
[2025-06-06 23:27:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2446357871395739315.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/CTLFireability6652897019557313314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2446357871395739315.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.27181e+06,0.005204,4000,2,74,5,407,6,0,124,369,0


Converting to forward existential form...Done !
original formula: E(!(EG(((p400==1)&&(p67!=1)))) U (p500==1))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(((p400==1)&&(p67!=1))))) * (p500==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t15, t21, t26, t30, t31, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,1,0.044123,6048,1,0,131,12099,94,101,705,17727,183
FORMULA SmartHome-PT-19-CTLFireability-2025-04 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 : 344/344 places, 449/449 transitions.
Graph (trivial) has 369 edges and 344 vertex of which 201 / 344 are part of one of the 16 SCC in 0 ms
Free SCC test removed 185 places
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 244 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 158 transition count 145
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 65 rules applied. Total rules applied 125 place count 99 transition count 139
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 129 place count 96 transition count 138
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 132 place count 95 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 94 transition count 136
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 133 place count 94 transition count 133
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 139 place count 91 transition count 133
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 159 place count 71 transition count 110
Iterating global reduction 5 with 20 rules applied. Total rules applied 179 place count 71 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 182 place count 71 transition count 107
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 184 place count 69 transition count 105
Iterating global reduction 6 with 2 rules applied. Total rules applied 186 place count 69 transition count 105
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 256 place count 34 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 257 place count 34 transition count 68
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 262 place count 29 transition count 52
Iterating global reduction 7 with 5 rules applied. Total rules applied 267 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 269 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 284 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 286 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 286 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 288 place count 25 transition count 35
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 290 place count 23 transition count 31
Iterating global reduction 8 with 2 rules applied. Total rules applied 292 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 293 place count 22 transition count 30
Applied a total of 293 rules in 25 ms. Remains 22 /344 variables (removed 322) and now considering 30/449 (removed 419) transitions.
[2025-06-06 23:27:47] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
// Phase 1: matrix 23 rows 22 cols
[2025-06-06 23:27:47] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 23:27:47] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2025-06-06 23:27:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:27:47] [INFO ] Redundant transitions in 16 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:27:47] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2025-06-06 23:27:47] [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 136 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 186 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 326ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 328ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/344 places, 30/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 436 ms. Remains : 22/344 places, 30/449 transitions.
[2025-06-06 23:27:48] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:27:48] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:27:48] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-06 23:27:48] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:48] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16108256390369031280.gal : 3 ms
[2025-06-06 23:27:48] [INFO ] Time to serialize properties into /tmp/CTLFireability11261092187513846185.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/CTLFireability16108256390369031280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11261092187513846185.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,176640,0.004291,3872,2,56,5,343,6,0,97,337,0


Converting to forward existential form...Done !
original formula: EG(AF((p309==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p309==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t21, t23, t24, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
(forward)formula 0,0,0.044558,6176,1,0,142,14512,79,83,568,20273,172
FORMULA SmartHome-PT-19-CTLFireability-2025-06 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 : 344/344 places, 449/449 transitions.
Graph (trivial) has 364 edges and 344 vertex of which 197 / 344 are part of one of the 15 SCC in 1 ms
Free SCC test removed 182 places
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 161 transition count 148
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 66 rules applied. Total rules applied 127 place count 101 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 130 place count 98 transition count 142
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 130 place count 98 transition count 139
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 95 transition count 139
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 158 place count 73 transition count 114
Iterating global reduction 3 with 22 rules applied. Total rules applied 180 place count 73 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 183 place count 73 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 71 transition count 109
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 71 transition count 109
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 259 place count 35 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 263 place count 35 transition count 68
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 265 place count 34 transition count 67
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 270 place count 29 transition count 50
Iterating global reduction 6 with 5 rules applied. Total rules applied 275 place count 29 transition count 50
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 277 place count 28 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 283 place count 28 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 284 place count 27 transition count 43
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 285 place count 26 transition count 40
Iterating global reduction 7 with 1 rules applied. Total rules applied 286 place count 26 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 25 transition count 39
Applied a total of 287 rules in 22 ms. Remains 25 /344 variables (removed 319) and now considering 39/449 (removed 410) transitions.
[2025-06-06 23:27:48] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
// Phase 1: matrix 27 rows 25 cols
[2025-06-06 23:27:48] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-06 23:27:48] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2025-06-06 23:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:48] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:27:48] [INFO ] Redundant transitions in 21 ms returned []
Running 21 sub problems to find dead transitions.
[2025-06-06 23:27:48] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2025-06-06 23:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 25/48 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 1/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/52 variables, and 26 constraints, problems are : Problem set: 0 solved, 21 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 25/48 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/49 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/49 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/52 variables, and 47 constraints, problems are : Problem set: 0 solved, 21 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 562ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/344 places, 39/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 665 ms. Remains : 25/344 places, 39/449 transitions.
[2025-06-06 23:27:48] [INFO ] Flatten gal took : 3 ms
[2025-06-06 23:27:48] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:27:48] [INFO ] Input system was already deterministic with 39 transitions.
[2025-06-06 23:27:48] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:27:48] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:27:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7908510319603263932.gal : 0 ms
[2025-06-06 23:27:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9454706822230895821.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7908510319603263932.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9454706822230895821.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 126 steps (3 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-19-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 308 transition count 413
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 308 transition count 413
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 308 transition count 409
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 295 transition count 396
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 295 transition count 396
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 111 place count 286 transition count 387
Iterating global reduction 1 with 9 rules applied. Total rules applied 120 place count 286 transition count 387
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 126 place count 280 transition count 381
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 280 transition count 381
Applied a total of 132 rules in 17 ms. Remains 280 /344 variables (removed 64) and now considering 381/449 (removed 68) transitions.
// Phase 1: matrix 381 rows 280 cols
[2025-06-06 23:27:48] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-06 23:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:27:48] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-06 23:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 381/661 variables, 280/283 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (OVERLAPS) 0/661 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 283 constraints, problems are : Problem set: 0 solved, 380 unsolved in 27037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (OVERLAPS) 381/661 variables, 280/283 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 380/663 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:28:26] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 664 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57078ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 57078ms
Starting structural reductions in LTL mode, iteration 1 : 280/344 places, 381/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57260 ms. Remains : 280/344 places, 381/449 transitions.
[2025-06-06 23:28:46] [INFO ] Flatten gal took : 12 ms
[2025-06-06 23:28:46] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:28:46] [INFO ] Input system was already deterministic with 381 transitions.
[2025-06-06 23:28:46] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:28:46] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:28:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4794792900600887364.gal : 2 ms
[2025-06-06 23:28:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8366135254775058107.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/CTLFireability4794792900600887364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8366135254775058107.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,3.41168e+21,1.50291,61040,2,9075,5,271738,6,0,1487,265450,0


Converting to forward existential form...Done !
original formula: E((EF((EX((p87==1)) * AF((p317==1)))) + (p380!=1)) U AG(!((((!((p588==1)&&(p374==1)))&&(p62==1)) * AG(((p410==1)&&(p730==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (EX((p87==1)) * !(EG(!((p317==1)))))) + (p380!=1))) * !(E(TRUE U !(!((((!((p588==1)&&(p374...229
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t29, t32, t61, t93, t96, t113, t116, t133, t136, t148, t155, t172, t187, t207, t222,...316
Detected timeout of ITS tools.
[2025-06-06 23:29:16] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:29:16] [INFO ] Applying decomposition
[2025-06-06 23:29:16] [INFO ] Flatten gal took : 10 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/graph13877447859722920932.txt' '-o' '/tmp/graph13877447859722920932.bin' '-w' '/tmp/graph13877447859722920932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13877447859722920932.bin' '-l' '-1' '-v' '-w' '/tmp/graph13877447859722920932.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:29:16] [INFO ] Decomposing Gal with order
[2025-06-06 23:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:29:16] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-06 23:29:16] [INFO ] Flatten gal took : 58 ms
[2025-06-06 23:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-06 23:29:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12055019939633206381.gal : 5 ms
[2025-06-06 23:29:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4312176189533711093.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/CTLFireability12055019939633206381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4312176189533711093.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.41168e+21,0.173246,11476,600,42,14750,1398,600,23491,65,4183,0


Converting to forward existential form...Done !
original formula: E((EF((EX((i2.i2.u13.p87==1)) * AF((i8.u49.p317==1)))) + (i11.i1.u59.p380!=1)) U AG(!((((!((i0.i1.u99.p588==1)&&(i10.u58.p374==1)))&&(i2....218
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (EX((i2.i2.u13.p87==1)) * !(EG(!((i8.u49.p317==1)))))) + (i11.i1.u59.p380!=1))) * !(E(TRUE...300
Reverse transition relation is NOT exact ! Due to transitions t32, t96, t116, t136, t155, i0.i0.u102.t8, i0.i1.u95.t11, i0.i1.u96.t29, i1.u33.t257, i2.i0.u...500
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
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 304 transition count 409
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 304 transition count 409
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 304 transition count 405
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 100 place count 288 transition count 389
Iterating global reduction 1 with 16 rules applied. Total rules applied 116 place count 288 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 117 place count 288 transition count 388
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 127 place count 278 transition count 378
Iterating global reduction 2 with 10 rules applied. Total rules applied 137 place count 278 transition count 378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 144 place count 271 transition count 371
Iterating global reduction 2 with 7 rules applied. Total rules applied 151 place count 271 transition count 371
Applied a total of 151 rules in 23 ms. Remains 271 /344 variables (removed 73) and now considering 371/449 (removed 78) transitions.
// Phase 1: matrix 371 rows 271 cols
[2025-06-06 23:29:46] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:46] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 23:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:29:46] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-06 23:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 24210 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:30:20] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 645 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54248ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 54249ms
Starting structural reductions in LTL mode, iteration 1 : 271/344 places, 371/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54486 ms. Remains : 271/344 places, 371/449 transitions.
[2025-06-06 23:30:41] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:30:41] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:30:41] [INFO ] Input system was already deterministic with 371 transitions.
[2025-06-06 23:30:41] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:30:41] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:30:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4960764863573742504.gal : 2 ms
[2025-06-06 23:30:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15288741387465216299.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/CTLFireability4960764863573742504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15288741387465216299.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,2.57362e+21,1.37752,58756,2,8184,5,262962,6,0,1441,252928,0


Converting to forward existential form...Done !
original formula: (AX(AX(FALSE)) * AG((EX((p501!=1)) + AX(((p2!=1)||(p519!=1))))))
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(FALSE))] = FALSE * [(EY((FwdU(Init,TRUE) * !(EX((p501!=1))))) * !(((p2!=1)||(p519!=1))))] = ...161
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,...316
(forward)formula 0,0,11.1849,338472,1,0,426,1.51471e+06,760,315,7919,1.58573e+06,753
FORMULA SmartHome-PT-19-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 313 transition count 418
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 313 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 313 transition count 414
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 302 transition count 403
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 302 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 302 transition count 402
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 296 transition count 396
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 296 transition count 396
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 293 transition count 393
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 293 transition count 393
Applied a total of 107 rules in 16 ms. Remains 293 /344 variables (removed 51) and now considering 393/449 (removed 56) transitions.
// Phase 1: matrix 393 rows 293 cols
[2025-06-06 23:30:52] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:30:52] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 23:30:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:30:52] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2025-06-06 23:30:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/293 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/686 variables, 293/296 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 0/686 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 296 constraints, problems are : Problem set: 0 solved, 392 unsolved in 27853 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/293 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/686 variables, 293/296 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 392/688 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:31:31] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/686 variables, and 689 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57894ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 57895ms
Starting structural reductions in LTL mode, iteration 1 : 293/344 places, 393/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58082 ms. Remains : 293/344 places, 393/449 transitions.
[2025-06-06 23:31:50] [INFO ] Flatten gal took : 10 ms
[2025-06-06 23:31:50] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:31:50] [INFO ] Input system was already deterministic with 393 transitions.
[2025-06-06 23:31:50] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:31:50] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:31:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15865381367311458755.gal : 2 ms
[2025-06-06 23:31:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15526474597752936113.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/CTLFireability15865381367311458755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15526474597752936113.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.33729e+21,1.8917,68824,2,9937,5,317754,6,0,1551,308823,0


Converting to forward existential form...Done !
original formula: (E(A((A(A((p487==1) U (p436==1)) U AF((p103==1))) * A((p573==1) U ((p132==1)&&(p256==1)))) U (((EX((p192==1)) + !(((p567==1)&&(p739==1)))...291
=> equivalent forward existential formula: ([(EY((Init * E(!((E(!((((EX((p192==1)) + !(((p567==1)&&(p739==1)))) + ((p275==1)||(p397==1))) + !(EG((p591==1))...1505
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t28, t31, t60, t93, t96, t113, t118, t135, t139, t141, t154, t157, t174, t189, t...332
Detected timeout of ITS tools.
[2025-06-06 23:32:20] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:32:20] [INFO ] Applying decomposition
[2025-06-06 23:32:20] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10941515704500565758.txt' '-o' '/tmp/graph10941515704500565758.bin' '-w' '/tmp/graph10941515704500565758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10941515704500565758.bin' '-l' '-1' '-v' '-w' '/tmp/graph10941515704500565758.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:32:20] [INFO ] Decomposing Gal with order
[2025-06-06 23:32:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:32:20] [INFO ] Removed a total of 81 redundant transitions.
[2025-06-06 23:32:20] [INFO ] Flatten gal took : 41 ms
[2025-06-06 23:32:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-06 23:32:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15591593974136197181.gal : 4 ms
[2025-06-06 23:32:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9768185983569905006.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/CTLFireability15591593974136197181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9768185983569905006.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 -...263
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.33729e+21,0.179041,9980,689,46,11391,757,622,18034,69,2224,0


Converting to forward existential form...Done !
original formula: (E(A((A(A((i15.u87.p487==1) U (i12.u78.p436==1)) U AF((i1.i1.i2.u20.p103==1))) * A((i17.u111.p573==1) U ((i2.u25.p132==1)&&(i6.u46.p256==...434
=> equivalent forward existential formula: ([(EY((Init * E(!((E(!((((EX((i4.u31.p192==1)) + !(((i16.u96.p567==1)&&(i16.u116.p739==1)))) + ((i7.u49.p275==1)...2136
Reverse transition relation is NOT exact ! Due to transitions t10, t31, t96, t157, i0.t3, i0.u112.t8, i1.i1.i0.u9.t354, i2.u24.t320, i3.u30.t301, i4.u31.t2...522
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 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 a local 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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
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 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 a local 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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,4.45105,151932,1,0,277483,877,4757,586162,370,3265,315685
FORMULA SmartHome-PT-19-CTLFireability-2025-10 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 : 344/344 places, 449/449 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 305 transition count 410
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 305 transition count 410
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 305 transition count 406
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 97 place count 290 transition count 391
Iterating global reduction 1 with 15 rules applied. Total rules applied 112 place count 290 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 113 place count 290 transition count 390
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 122 place count 281 transition count 381
Iterating global reduction 2 with 9 rules applied. Total rules applied 131 place count 281 transition count 381
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 138 place count 274 transition count 374
Iterating global reduction 2 with 7 rules applied. Total rules applied 145 place count 274 transition count 374
Applied a total of 145 rules in 23 ms. Remains 274 /344 variables (removed 70) and now considering 374/449 (removed 75) transitions.
// Phase 1: matrix 374 rows 274 cols
[2025-06-06 23:32:25] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:32:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-06 23:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:32:25] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-06 23:32: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/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 277 constraints, problems are : Problem set: 0 solved, 373 unsolved in 25497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 373/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:33:01] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 651 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55538ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 55539ms
Starting structural reductions in LTL mode, iteration 1 : 274/344 places, 374/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55733 ms. Remains : 274/344 places, 374/449 transitions.
[2025-06-06 23:33:20] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:33:20] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:33:21] [INFO ] Input system was already deterministic with 374 transitions.
[2025-06-06 23:33:21] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:33:21] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:33:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10772053898123782911.gal : 2 ms
[2025-06-06 23:33:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7328261540133216446.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/CTLFireability10772053898123782911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7328261540133216446.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,2.60553e+21,1.38161,56776,2,8054,5,259409,6,0,1456,245740,0


Converting to forward existential form...Done !
original formula: EX(EF((p562==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p562==1))] != FALSE
(forward)formula 0,1,2.18785,58056,1,0,9,259666,9,1,2793,245740,4
FORMULA SmartHome-PT-19-CTLFireability-2025-11 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 : 344/344 places, 449/449 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 309 transition count 414
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 309 transition count 414
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 309 transition count 411
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 89 place count 293 transition count 395
Iterating global reduction 1 with 16 rules applied. Total rules applied 105 place count 293 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 293 transition count 394
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 116 place count 283 transition count 384
Iterating global reduction 2 with 10 rules applied. Total rules applied 126 place count 283 transition count 384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 277 transition count 378
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 277 transition count 378
Applied a total of 138 rules in 30 ms. Remains 277 /344 variables (removed 67) and now considering 378/449 (removed 71) transitions.
// Phase 1: matrix 378 rows 277 cols
[2025-06-06 23:33:23] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:33:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-06 23:33:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:33:23] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2025-06-06 23:33: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/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/655 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 280 constraints, problems are : Problem set: 0 solved, 377 unsolved in 25773 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 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/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/655 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 377/657 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:33:59] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/655 variables, and 658 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55822ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 55822ms
Starting structural reductions in LTL mode, iteration 1 : 277/344 places, 378/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56064 ms. Remains : 277/344 places, 378/449 transitions.
[2025-06-06 23:34:19] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:34:19] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:34:19] [INFO ] Input system was already deterministic with 378 transitions.
[2025-06-06 23:34:19] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:34:19] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:34:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2771865432284893878.gal : 1 ms
[2025-06-06 23:34:19] [INFO ] Time to serialize properties into /tmp/CTLFireability520608171685375133.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/CTLFireability2771865432284893878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability520608171685375133.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,4.78925e+21,1.73102,65764,2,8778,5,298688,6,0,1472,291450,0


Converting to forward existential form...Done !
original formula: E((E(EF((p71==1)) U (((p340!=1) * E(((p2==1)&&(p472==1)) U (p286==1))) * E((p458==1) U (p308==1)))) + (p383!=1)) U (EX((p98==1)) + A((p60...190
=> equivalent forward existential formula: ([(EY(FwdU(Init,(E(E(TRUE U (p71==1)) U (((p340!=1) * E(((p2==1)&&(p472==1)) U (p286==1))) * E((p458==1) U (p308...465
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t9, t11, t28, t31, t61, t93, t96, t114, t117, t134, t138, t150, t153, t170, t185, t20...336
Detected timeout of ITS tools.
[2025-06-06 23:34:49] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:34:49] [INFO ] Applying decomposition
[2025-06-06 23:34:49] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4042288326803502950.txt' '-o' '/tmp/graph4042288326803502950.bin' '-w' '/tmp/graph4042288326803502950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4042288326803502950.bin' '-l' '-1' '-v' '-w' '/tmp/graph4042288326803502950.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:34:49] [INFO ] Decomposing Gal with order
[2025-06-06 23:34:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:34:49] [INFO ] Removed a total of 96 redundant transitions.
[2025-06-06 23:34:49] [INFO ] Flatten gal took : 36 ms
[2025-06-06 23:34:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2025-06-06 23:34:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1878789646162012615.gal : 3 ms
[2025-06-06 23:34:49] [INFO ] Time to serialize properties into /tmp/CTLFireability585414065507112092.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/CTLFireability1878789646162012615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability585414065507112092.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.78925e+21,0.127084,9384,578,47,10565,758,562,17351,65,2172,0


Converting to forward existential form...Done !
original formula: E((E(EF((i2.i1.i2.u14.p71==1)) U (((i10.u54.p340!=1) * E(((i16.u1.p2==1)&&(i0.u73.p472==1)) U (i8.u46.p286==1))) * E((i0.u74.p458==1) U (...297
=> equivalent forward existential formula: ([(EY(FwdU(Init,(E(E(TRUE U (i2.i1.i2.u14.p71==1)) U (((i10.u54.p340!=1) * E(((i16.u1.p2==1)&&(i0.u73.p472==1)) ...668
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t31, t96, t117, t153, t223, i0.u73.t114, i1.u62.t170, i2.i0.i0.u10.t309, i2.i0.i0.u1...537
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 311 transition count 416
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 311 transition count 416
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 311 transition count 412
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 82 place count 299 transition count 400
Iterating global reduction 1 with 12 rules applied. Total rules applied 94 place count 299 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 299 transition count 399
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 103 place count 291 transition count 391
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 291 transition count 391
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 287 transition count 387
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 287 transition count 387
Applied a total of 119 rules in 26 ms. Remains 287 /344 variables (removed 57) and now considering 387/449 (removed 62) transitions.
// Phase 1: matrix 387 rows 287 cols
[2025-06-06 23:35: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:35:19] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-06 23:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:35:19] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2025-06-06 23:35: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/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (OVERLAPS) 387/674 variables, 287/290 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (OVERLAPS) 0/674 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 290 constraints, problems are : Problem set: 0 solved, 386 unsolved in 28075 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (OVERLAPS) 387/674 variables, 287/290 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 386/676 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:35:58] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 677 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58124ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 58124ms
Starting structural reductions in LTL mode, iteration 1 : 287/344 places, 387/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58361 ms. Remains : 287/344 places, 387/449 transitions.
[2025-06-06 23:36:17] [INFO ] Flatten gal took : 8 ms
[2025-06-06 23:36:17] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:36:17] [INFO ] Input system was already deterministic with 387 transitions.
[2025-06-06 23:36:17] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:36:17] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:36:17] [INFO ] Time to serialize gal into /tmp/CTLFireability7567259133648228205.gal : 1 ms
[2025-06-06 23:36:17] [INFO ] Time to serialize properties into /tmp/CTLFireability525462884830749095.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/CTLFireability7567259133648228205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability525462884830749095.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,7.47336e+21,1.7709,69348,2,9408,5,322086,6,0,1521,308353,0


Converting to forward existential form...Done !
original formula: (E((((!((E((p296==1) U (p440==1)) * (p400==1))) * (p224!=1)) * !(AX((p214==1)))) + (p273==1)) U EX(((p271==1)&&(p151==1)))) * AG(EX(EG(((...179
=> equivalent forward existential formula: ([(Init * !(E((((!((E((p296==1) U (p440==1)) * (p400==1))) * (p224!=1)) * !(!(EX(!((p214==1)))))) + (p273==1)) U...261
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t91, t94, t111, t114, t116, t132, t136, t148, t151, t168, t183, t...326
Detected timeout of ITS tools.
[2025-06-06 23:36:48] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:36:48] [INFO ] Applying decomposition
[2025-06-06 23:36:48] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17711540988910480775.txt' '-o' '/tmp/graph17711540988910480775.bin' '-w' '/tmp/graph17711540988910480775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17711540988910480775.bin' '-l' '-1' '-v' '-w' '/tmp/graph17711540988910480775.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:36:48] [INFO ] Decomposing Gal with order
[2025-06-06 23:36:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:36:48] [INFO ] Removed a total of 91 redundant transitions.
[2025-06-06 23:36:48] [INFO ] Flatten gal took : 13 ms
[2025-06-06 23:36:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2025-06-06 23:36:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16940178106982713994.gal : 3 ms
[2025-06-06 23:36:48] [INFO ] Time to serialize properties into /tmp/CTLFireability18327042329986082336.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/CTLFireability16940178106982713994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18327042329986082336.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,7.47336e+21,0.173127,10576,701,46,12767,1416,612,21148,64,4628,0


Converting to forward existential form...Done !
original formula: (E((((!((E((i8.i0.u51.p296==1) U (i13.u76.p440==1)) * (i12.u69.p400==1))) * (i5.i1.u33.p224!=1)) * !(AX((i5.i0.u35.p214==1)))) + (i7.i1.u...272
=> equivalent forward existential formula: ([(Init * !(E((((!((E((i8.i0.u51.p296==1) U (i13.u76.p440==1)) * (i12.u69.p400==1))) * (i5.i1.u33.p224!=1)) * !(...354
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t151, i0.i0.u1.t351, i0.i1.t3, i0.i1.u111.t8, i1.u28.t285, i2.i0.u17.t34...535
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,0.868887,36048,1,0,67081,1416,4189,105981,318,4628,187974
FORMULA SmartHome-PT-19-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Graph (trivial) has 368 edges and 344 vertex of which 185 / 344 are part of one of the 15 SCC in 2 ms
Free SCC test removed 170 places
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 173 transition count 154
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 77 rules applied. Total rules applied 147 place count 104 transition count 146
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 153 place count 100 transition count 144
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 99 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 98 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 156 place count 98 transition count 139
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 164 place count 94 transition count 139
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 183 place count 75 transition count 117
Iterating global reduction 5 with 19 rules applied. Total rules applied 202 place count 75 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 206 place count 75 transition count 113
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 208 place count 73 transition count 111
Iterating global reduction 6 with 2 rules applied. Total rules applied 210 place count 73 transition count 111
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 284 place count 36 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 288 place count 36 transition count 70
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 291 place count 35 transition count 68
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 293 place count 34 transition count 67
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 298 place count 29 transition count 51
Iterating global reduction 9 with 5 rules applied. Total rules applied 303 place count 29 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 307 place count 27 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 322 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 324 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 324 place count 25 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 326 place count 24 transition count 33
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 328 place count 22 transition count 29
Iterating global reduction 10 with 2 rules applied. Total rules applied 330 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 331 place count 21 transition count 28
Applied a total of 331 rules in 20 ms. Remains 21 /344 variables (removed 323) and now considering 28/449 (removed 421) transitions.
[2025-06-06 23:36:49] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 21 cols
[2025-06-06 23:36:49] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:36:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-06 23:36:49] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 23:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:36:49] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:36:49] [INFO ] Redundant transitions in 16 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:36:49] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2025-06-06 23:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/36 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 124 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 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/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/36 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 179 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/344 places, 28/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 397 ms. Remains : 21/344 places, 28/449 transitions.
[2025-06-06 23:36:49] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:36:49] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:36:49] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-06 23:36:49] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:36:49] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-19-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-06 23:36:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7341526501918924661.gal : 1 ms
[2025-06-06 23:36:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8362372762453284860.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7341526501918924661.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8362372762453284860.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 449/449 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 306 transition count 411
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 306 transition count 411
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 79 place count 306 transition count 408
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 93 place count 292 transition count 394
Iterating global reduction 1 with 14 rules applied. Total rules applied 107 place count 292 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 292 transition count 393
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 117 place count 283 transition count 384
Iterating global reduction 2 with 9 rules applied. Total rules applied 126 place count 283 transition count 384
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 277 transition count 378
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 277 transition count 378
Applied a total of 138 rules in 21 ms. Remains 277 /344 variables (removed 67) and now considering 378/449 (removed 71) transitions.
// Phase 1: matrix 378 rows 277 cols
[2025-06-06 23:36:49] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:36:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-06 23:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:36:49] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2025-06-06 23:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/655 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 280 constraints, problems are : Problem set: 0 solved, 377 unsolved in 25822 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 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/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/655 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 377/657 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:37:25] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 23:37:25] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 2/659 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/655 variables, and 659 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55868ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 55869ms
Starting structural reductions in LTL mode, iteration 1 : 277/344 places, 378/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56054 ms. Remains : 277/344 places, 378/449 transitions.
[2025-06-06 23:37:45] [INFO ] Flatten gal took : 9 ms
[2025-06-06 23:37:45] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:37:45] [INFO ] Input system was already deterministic with 378 transitions.
[2025-06-06 23:37:45] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:37:45] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:37:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16558047144994422192.gal : 2 ms
[2025-06-06 23:37:45] [INFO ] Time to serialize properties into /tmp/CTLFireability737488676519561250.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/CTLFireability16558047144994422192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability737488676519561250.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,5.34622e+21,2.0377,72668,2,10327,5,336444,6,0,1472,333188,0


Converting to forward existential form...Done !
original formula: E((p538==1) U A((EG(EX((p67==1))) * AX((((p133==1)&&(p298==1))&&(p217==1)))) U AX(EF(((p430==1)&&(p5==1))))))
=> equivalent forward existential formula: [((FwdU(Init,(p538==1)) * !(EG(!(!(EX(!(E(TRUE U ((p430==1)&&(p5==1)))))))))) * !(E(!(!(EX(!(E(TRUE U ((p430==1)...303
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t115, t133, t136, t148, t151, t168, t183, t203, t218,...328
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
Hit Full ! (commute/partial/dont) 376/0/2
(forward)formula 0,1,24.2241,712160,1,0,542,4.13916e+06,798,390,9057,3.87787e+06,901
FORMULA SmartHome-PT-19-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-06 23:38:09] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:38:09] [INFO ] Flatten gal took : 6 ms
[2025-06-06 23:38:09] [INFO ] Applying decomposition
[2025-06-06 23:38:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16052224746838845773.txt' '-o' '/tmp/graph16052224746838845773.bin' '-w' '/tmp/graph16052224746838845773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16052224746838845773.bin' '-l' '-1' '-v' '-w' '/tmp/graph16052224746838845773.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:38:10] [INFO ] Decomposing Gal with order
[2025-06-06 23:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:38:10] [INFO ] Removed a total of 77 redundant transitions.
[2025-06-06 23:38:10] [INFO ] Flatten gal took : 15 ms
[2025-06-06 23:38:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2025-06-06 23:38:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3241602933242997385.gal : 3 ms
[2025-06-06 23:38:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11769417932018968407.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/CTLFireability3241602933242997385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11769417932018968407.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 -...263
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5011e+23,0.242656,14256,977,50,19206,629,685,38494,80,2236,0


Converting to forward existential form...Done !
original formula: E((EF((EX((i0.i1.i0.u17.p87==1)) * AF((i9.u59.p317==1)))) + (i11.u76.p380!=1)) U AG(!((((!((i16.u125.p588==1)&&(i11.u71.p374==1)))&&(i0.i...221
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (EX((i0.i1.i0.u17.p87==1)) * !(EG(!((i9.u59.p317==1)))))) + (i11.u76.p380!=1))) * !(E(TRUE...303
Reverse transition relation is NOT exact ! Due to transitions t3, t35, t306, i0.i0.i0.u9.t368, i0.i0.i0.u9.t403, i0.i0.i0.u131.t8, i0.i0.i0.u131.t9, i0.i0....733
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
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
[2025-06-07 00:02:21] [INFO ] Applying decomposition
[2025-06-07 00:02:21] [INFO ] Flatten gal took : 6 ms
[2025-06-07 00:02:21] [INFO ] Decomposing Gal with order
[2025-06-07 00:02:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 00:02:21] [INFO ] Removed a total of 32 redundant transitions.
[2025-06-07 00:02:21] [INFO ] Flatten gal took : 11 ms
[2025-06-07 00:02:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 12 ms.
[2025-06-07 00:02:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1176589780909789080.gal : 2 ms
[2025-06-07 00:02:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13791437290477342569.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/CTLFireability1176589780909789080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13791437290477342569.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 -...263
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.5011e+23,2.29024,111992,2536,246,244276,3753,482,758955,346,15361,0


Converting to forward existential form...Done !
original formula: E((EF((EX((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p87==1)) * AF((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.u25.p317==1)))) + (i0.i1.i0.i...389
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (EX((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u18.p87==1)) * !(EG(!((i0.i1.i0.i0.i0...471
Reverse transition relation is NOT exact ! Due to transitions t411, t412, t416, i0.u2.t406, i0.u2.t407, i0.u2.t408, i0.u2.t409, i0.i1.u33.t13, i0.i1.u33.t3...1533
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

BK_TIME_CONFINEMENT_REACHED

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

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