Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r378-smll-171683811500449.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SmartHome-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811500449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 03:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 03:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 03:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 102K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717034526385

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 02:02:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 02:02:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:02:09] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-30 02:02:09] [INFO ] Transformed 427 places.
[2024-05-30 02:02:09] [INFO ] Transformed 451 transitions.
[2024-05-30 02:02:09] [INFO ] Found NUPN structural information;
[2024-05-30 02:02:09] [INFO ] Parsed PT model containing 427 places and 451 transitions and 1038 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Deduced a syphon composed of 134 places in 27 ms
Reduce places removed 134 places and 107 transitions.
FORMULA SmartHome-PT-15-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 344/344 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 284 transition count 344
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 69 place count 224 transition count 284
Iterating global reduction 1 with 60 rules applied. Total rules applied 129 place count 224 transition count 284
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 135 place count 224 transition count 278
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 217 transition count 271
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 217 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 213 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 213 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 212 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 212 transition count 266
Applied a total of 159 rules in 179 ms. Remains 212 /293 variables (removed 81) and now considering 266/344 (removed 78) transitions.
// Phase 1: matrix 266 rows 212 cols
[2024-05-30 02:02:09] [INFO ] Computed 5 invariants in 34 ms
[2024-05-30 02:02:10] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-30 02:02:10] [INFO ] Invariant cache hit.
[2024-05-30 02:02:10] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-05-30 02:02:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 3/212 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/478 variables, 212/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-30 02:02:18] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 30 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 218 constraints, problems are : Problem set: 0 solved, 265 unsolved in 20246 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 3/212 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/478 variables, 212/218 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 265/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-30 02:02:41] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/478 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 484 constraints, problems are : Problem set: 0 solved, 265 unsolved in 24942 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints]
After SMT, in 45385ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 45422ms
Starting structural reductions in LTL mode, iteration 1 : 212/293 places, 266/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46550 ms. Remains : 212/293 places, 266/344 transitions.
Support contains 58 out of 212 places after structural reductions.
[2024-05-30 02:02:56] [INFO ] Flatten gal took : 99 ms
[2024-05-30 02:02:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SmartHome-PT-15-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:02:56] [INFO ] Flatten gal took : 37 ms
[2024-05-30 02:02:56] [INFO ] Input system was already deterministic with 266 transitions.
Support contains 40 out of 212 places (down from 58) after GAL structural reductions.
RANDOM walk for 40000 steps (194 resets) in 1933 ms. (20 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40003 steps (28 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
[2024-05-30 02:02:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/47 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/102 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/106 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 59/165 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 146/311 variables, 87/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 77/388 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/388 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/389 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 46/435 variables, 25/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 24/459 variables, 13/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/459 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 12/471 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/471 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/477 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/477 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/478 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/478 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/478 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/20 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/47 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 55/102 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/106 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/165 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/165 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 146/311 variables, 87/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 77/388 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/388 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/389 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 46/435 variables, 25/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/435 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 24/459 variables, 13/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/459 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 12/471 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/471 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/477 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/478 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/478 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 697ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 266/266 transitions.
Graph (trivial) has 216 edges and 212 vertex of which 111 / 212 are part of one of the 8 SCC in 7 ms
Free SCC test removed 103 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 146 transitions.
Graph (complete) has 164 edges and 109 vertex of which 103 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 103 transition count 70
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 95 place count 64 transition count 64
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 98 place count 62 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 61 transition count 63
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 99 place count 61 transition count 56
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 113 place count 54 transition count 56
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 118 place count 49 transition count 51
Iterating global reduction 4 with 5 rules applied. Total rules applied 123 place count 49 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 49 transition count 49
Performed 25 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 175 place count 24 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 38 edges and 24 vertex of which 15 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 5 with 6 rules applied. Total rules applied 181 place count 15 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 184 place count 15 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 185 place count 14 transition count 10
Reduce places removed 3 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 5 rules applied. Total rules applied 190 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 192 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 192 place count 9 transition count 7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 194 place count 8 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 195 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 196 place count 7 transition count 6
Applied a total of 196 rules in 59 ms. Remains 7 /212 variables (removed 205) and now considering 6/266 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 7/212 places, 6/266 transitions.
RANDOM walk for 3366 steps (1 resets) in 31 ms. (105 steps per ms) remains 0/1 properties
[2024-05-30 02:02:58] [INFO ] Flatten gal took : 26 ms
[2024-05-30 02:02:58] [INFO ] Flatten gal took : 34 ms
[2024-05-30 02:02:58] [INFO ] Input system was already deterministic with 266 transitions.
Computed a total of 52 stabilizing places and 51 stable transitions
Graph (complete) has 319 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 186 transition count 242
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 186 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 186 transition count 240
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 64 place count 174 transition count 228
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 174 transition count 228
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 165 transition count 219
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 165 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 165 transition count 217
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 162 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 162 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 160 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 160 transition count 212
Applied a total of 106 rules in 40 ms. Remains 160 /212 variables (removed 52) and now considering 212/266 (removed 54) transitions.
// Phase 1: matrix 212 rows 160 cols
[2024-05-30 02:02:58] [INFO ] Computed 3 invariants in 7 ms
[2024-05-30 02:02:58] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-30 02:02:58] [INFO ] Invariant cache hit.
[2024-05-30 02:02:59] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-30 02:02:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/372 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/372 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 163 constraints, problems are : Problem set: 0 solved, 211 unsolved in 9580 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/372 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 211/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 374 constraints, problems are : Problem set: 0 solved, 211 unsolved in 9886 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 19512ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 19517ms
Starting structural reductions in LTL mode, iteration 1 : 160/212 places, 212/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19871 ms. Remains : 160/212 places, 212/266 transitions.
[2024-05-30 02:03:18] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:03:18] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:03:18] [INFO ] Input system was already deterministic with 212 transitions.
[2024-05-30 02:03:18] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:03:18] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:03:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality9376256150340468950.gal : 6 ms
[2024-05-30 02:03:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15805146026226512199.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9376256150340468950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15805146026226512199.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33218e+12,0.351764,12612,2,2590,5,41536,6,0,846,44953,0


Converting to forward existential form...Done !
original formula: AF(AG(EX(((p84==0)||(p101==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX(((p84==0)||(p101==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t151, t169, t183, t186, t189,...268
(forward)formula 0,0,7.08601,174964,1,0,325,1.07876e+06,449,218,5209,859696,520
FORMULA SmartHome-PT-15-CTLCardinality-2024-00 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 : 212/212 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 266
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 186 transition count 241
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 186 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 186 transition count 239
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 65 place count 174 transition count 227
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 174 transition count 227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 86 place count 165 transition count 218
Iterating global reduction 2 with 9 rules applied. Total rules applied 95 place count 165 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 165 transition count 216
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 161 transition count 212
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 161 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 159 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 159 transition count 210
Applied a total of 109 rules in 20 ms. Remains 159 /212 variables (removed 53) and now considering 210/266 (removed 56) transitions.
// Phase 1: matrix 210 rows 159 cols
[2024-05-30 02:03:25] [INFO ] Computed 4 invariants in 1 ms
[2024-05-30 02:03:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 02:03:25] [INFO ] Invariant cache hit.
[2024-05-30 02:03:26] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 02:03:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 2/159 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/369 variables, 159/163 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 02:03:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/369 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 164 constraints, problems are : Problem set: 0 solved, 209 unsolved in 12416 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 2/159 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/369 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 209/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 373 constraints, problems are : Problem set: 0 solved, 209 unsolved in 9611 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints]
After SMT, in 22071ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 22074ms
Starting structural reductions in LTL mode, iteration 1 : 159/212 places, 210/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22353 ms. Remains : 159/212 places, 210/266 transitions.
[2024-05-30 02:03:48] [INFO ] Flatten gal took : 17 ms
[2024-05-30 02:03:48] [INFO ] Flatten gal took : 17 ms
[2024-05-30 02:03:48] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-30 02:03:48] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:03:48] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:03:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality425161341599096661.gal : 5 ms
[2024-05-30 02:03:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8725541896893814387.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality425161341599096661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8725541896893814387.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08912e+12,0.485189,12940,2,2719,5,44278,6,0,838,44379,0


Converting to forward existential form...Done !
original formula: (EX(AG((p283==1))) + EG(AG((((p256==0)&&(p167==0))&&(p275==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((p283==1)))))] != FALSE + [FwdG(Init,!(E(TRUE U !((((p256==0)&&(p167==0))&&(p275==1))...170
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t32, t60, t92, t95, t115, t132, t135, t147, t150, t167, t181, t184, t187, ...267
(forward)formula 0,0,2.86417,69392,1,0,262,346066,450,181,4809,305337,442
FORMULA SmartHome-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 184 transition count 240
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 184 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 184 transition count 238
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 68 place count 172 transition count 226
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 172 transition count 226
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 163 transition count 217
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 163 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 163 transition count 215
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 159 transition count 211
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 159 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 157 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 157 transition count 209
Applied a total of 112 rules in 34 ms. Remains 157 /212 variables (removed 55) and now considering 209/266 (removed 57) transitions.
// Phase 1: matrix 209 rows 157 cols
[2024-05-30 02:03:51] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:03:51] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-30 02:03:51] [INFO ] Invariant cache hit.
[2024-05-30 02:03:51] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-30 02:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 160 constraints, problems are : Problem set: 0 solved, 208 unsolved in 9225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 208/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 368 constraints, problems are : Problem set: 0 solved, 208 unsolved in 8969 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 18246ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 18250ms
Starting structural reductions in LTL mode, iteration 1 : 157/212 places, 209/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18570 ms. Remains : 157/212 places, 209/266 transitions.
[2024-05-30 02:04:09] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:04:09] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:04:09] [INFO ] Input system was already deterministic with 209 transitions.
[2024-05-30 02:04:09] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:04:09] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:04:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality8437971414263391240.gal : 2 ms
[2024-05-30 02:04:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality7774034834518358078.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8437971414263391240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7774034834518358078.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.368609,12932,1,0,6,43076,7,1,1011,45888,1
FORMULA SmartHome-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Graph (trivial) has 213 edges and 212 vertex of which 108 / 212 are part of one of the 8 SCC in 2 ms
Free SCC test removed 100 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Graph (complete) has 190 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 109 transition count 98
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 44 rules applied. Total rules applied 85 place count 70 transition count 93
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 68 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 67 transition count 92
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 89 place count 67 transition count 86
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 101 place count 61 transition count 86
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 106 place count 56 transition count 81
Iterating global reduction 4 with 5 rules applied. Total rules applied 111 place count 56 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 113 place count 56 transition count 79
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 159 place count 33 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 162 place count 33 transition count 53
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 163 place count 32 transition count 52
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 32 transition count 52
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 168 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 180 place count 30 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 181 place count 29 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 181 place count 29 transition count 37
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 183 place count 28 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 184 place count 27 transition count 36
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 11 edges and 26 vertex of which 2 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 186 place count 25 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 188 place count 25 transition count 34
Applied a total of 188 rules in 39 ms. Remains 25 /212 variables (removed 187) and now considering 34/266 (removed 232) transitions.
[2024-05-30 02:04:10] [INFO ] Flow matrix only has 27 transitions (discarded 7 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-05-30 02:04:10] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 02:04:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 02:04:10] [INFO ] Flow matrix only has 27 transitions (discarded 7 similar events)
[2024-05-30 02:04:10] [INFO ] Invariant cache hit.
[2024-05-30 02:04:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 02:04:10] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-30 02:04:10] [INFO ] Redundant transitions in 45 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-30 02:04:10] [INFO ] Flow matrix only has 27 transitions (discarded 7 similar events)
[2024-05-30 02:04:10] [INFO ] Invariant cache hit.
[2024-05-30 02:04:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 23/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 4/47 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/52 variables, and 25 constraints, problems are : Problem set: 0 solved, 16 unsolved in 365 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 23/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/47 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/48 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 1/49 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/49 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/49 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 16 unsolved in 393 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 771ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 772ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/212 places, 34/266 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 958 ms. Remains : 25/212 places, 34/266 transitions.
[2024-05-30 02:04:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:04:11] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:04:11] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-30 02:04:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:04:11] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:04:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality3798544374617176061.gal : 1 ms
[2024-05-30 02:04:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16341374828470451490.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3798544374617176061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16341374828470451490.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,72192,0.010743,3492,2,113,5,558,6,0,114,528,0


Converting to forward existential form...Done !
original formula: AG((((p276==0)||(p193==1)) + AF((p200==0))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(((p276==0)||(p193==1)))),!((p200==0)))] = FALSE
Hit Full ! (commute/partial/dont) 32/0/2
(forward)formula 0,0,0.045776,4072,1,0,11,2999,22,5,577,2824,9
FORMULA SmartHome-PT-15-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 185 transition count 241
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 185 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 185 transition count 239
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 64 place count 175 transition count 229
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 175 transition count 229
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 166 transition count 220
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 166 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 166 transition count 218
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 162 transition count 214
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 162 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 160 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 160 transition count 212
Applied a total of 106 rules in 39 ms. Remains 160 /212 variables (removed 52) and now considering 212/266 (removed 54) transitions.
// Phase 1: matrix 212 rows 160 cols
[2024-05-30 02:04:11] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:04:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 02:04:11] [INFO ] Invariant cache hit.
[2024-05-30 02:04:11] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-30 02:04:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/372 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/372 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 163 constraints, problems are : Problem set: 0 solved, 211 unsolved in 10483 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/372 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 211/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 374 constraints, problems are : Problem set: 0 solved, 211 unsolved in 9300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 19831ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 19835ms
Starting structural reductions in LTL mode, iteration 1 : 160/212 places, 212/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20144 ms. Remains : 160/212 places, 212/266 transitions.
[2024-05-30 02:04:31] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:04:31] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:04:31] [INFO ] Input system was already deterministic with 212 transitions.
[2024-05-30 02:04:31] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:04:31] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:04:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality5506089345450367473.gal : 2 ms
[2024-05-30 02:04:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality4473874327589237285.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5506089345450367473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4473874327589237285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41077e+12,0.507745,12948,2,2784,5,42513,6,0,846,45144,0


Converting to forward existential form...Done !
original formula: AG((EX(AG((p170!=1))) + A(!(AF((p273==1))) U AG(EF((p150==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!((E(!(!(E(TRUE U !(E(TRUE U (p150==1)))))) U (!(!(!(EG(!((p273==1)))))) * !(!(E(TRUE U !...275
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t113, t117, t134, t137, t149, t152, t169, t183, t186, t189,...268
(forward)formula 0,0,22.1805,548680,1,0,847,3.43333e+06,456,491,4945,3.49748e+06,1109
FORMULA SmartHome-PT-15-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 189 transition count 245
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 189 transition count 245
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 179 transition count 235
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 179 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 172 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 172 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 172 transition count 227
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 168 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 168 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 166 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 166 transition count 221
Applied a total of 91 rules in 19 ms. Remains 166 /212 variables (removed 46) and now considering 221/266 (removed 45) transitions.
// Phase 1: matrix 221 rows 166 cols
[2024-05-30 02:04:53] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:04:53] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 02:04:53] [INFO ] Invariant cache hit.
[2024-05-30 02:04:54] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-30 02:04:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/387 variables, 166/169 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/387 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 169 constraints, problems are : Problem set: 0 solved, 220 unsolved in 11280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/387 variables, 166/169 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 220/389 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 389 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 21503ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 21506ms
Starting structural reductions in LTL mode, iteration 1 : 166/212 places, 221/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21731 ms. Remains : 166/212 places, 221/266 transitions.
[2024-05-30 02:05:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:05:15] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:05:15] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-30 02:05:15] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:05:15] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:05:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality13460103359962747553.gal : 2 ms
[2024-05-30 02:05:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality4289492418930779632.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13460103359962747553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4289492418930779632.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.84292e+12,0.433884,16196,2,3151,5,57355,6,0,879,61712,0


Converting to forward existential form...Done !
original formula: E((AF((EX(((p28==0)||(p23==1))) * (p230==0))) * (AG(EX((p89==1))) + ((!(EX((p119==0))) * (p297==1)) * ((p102==1) * !(EX((p83==1))))))) U ...184
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(EG(!((EX(((p28==0)||(p23==1))) * (p230==0))))) * (!(E(TRUE U !(EX((p89==1))))) + ((!(EX((p11...255
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t29, t32, t65, t97, t100, t117, t120, t137, t141, t153, t156, t174, t188, t191, t192...281
(forward)formula 0,1,4.31992,110460,1,0,290,581963,475,200,5317,559568,474
FORMULA SmartHome-PT-15-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 185 transition count 241
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 185 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 185 transition count 239
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 174 transition count 228
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 174 transition count 228
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 166 transition count 220
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 166 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 166 transition count 218
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 163 transition count 215
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 163 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 161 transition count 213
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 161 transition count 213
Applied a total of 104 rules in 13 ms. Remains 161 /212 variables (removed 51) and now considering 213/266 (removed 53) transitions.
// Phase 1: matrix 213 rows 161 cols
[2024-05-30 02:05:19] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:05:20] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 02:05:20] [INFO ] Invariant cache hit.
[2024-05-30 02:05:20] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-30 02:05:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 164 constraints, problems are : Problem set: 0 solved, 212 unsolved in 10894 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 212/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 376 constraints, problems are : Problem set: 0 solved, 212 unsolved in 9965 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 20897ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 20904ms
Starting structural reductions in LTL mode, iteration 1 : 161/212 places, 213/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21166 ms. Remains : 161/212 places, 213/266 transitions.
[2024-05-30 02:05:41] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:05:41] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:05:41] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-30 02:05:41] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:05:41] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:05:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality3900067215889298021.gal : 3 ms
[2024-05-30 02:05:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16425731776136955319.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3900067215889298021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16425731776136955319.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AG(AX((AF((p319!=1)) + (p129!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!((!(EG(!((p319!=1)))) + (p129!=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t31, t34, t63, t95, t98, t115, t118, t135, t138, t150, t153, t170, t184, t187, t190,...268
(forward)formula 0,0,3.2498,86380,1,0,309,442353,455,207,4993,409800,495
FORMULA SmartHome-PT-15-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Graph (trivial) has 219 edges and 212 vertex of which 111 / 212 are part of one of the 8 SCC in 1 ms
Free SCC test removed 103 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Graph (complete) has 186 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 106 transition count 91
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 48 rules applied. Total rules applied 92 place count 64 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 62 transition count 85
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 94 place count 62 transition count 81
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 102 place count 58 transition count 81
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 108 place count 52 transition count 75
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 52 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 52 transition count 73
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 162 place count 29 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 165 place count 29 transition count 47
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 166 place count 28 transition count 46
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 28 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 173 place count 25 transition count 43
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 186 place count 25 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 188 place count 23 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 188 place count 23 transition count 29
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 190 place count 22 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 21 transition count 27
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 21 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 20 transition count 26
Applied a total of 193 rules in 26 ms. Remains 20 /212 variables (removed 192) and now considering 26/266 (removed 240) transitions.
[2024-05-30 02:05:44] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 20 cols
[2024-05-30 02:05:44] [INFO ] Computed 1 invariants in 14 ms
[2024-05-30 02:05:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 02:05:44] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-05-30 02:05:44] [INFO ] Invariant cache hit.
[2024-05-30 02:05:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-30 02:05:44] [INFO ] Redundant transitions in 30 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 02:05:44] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-05-30 02:05:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 17/34 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/35 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/40 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 176 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 17/34 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/37 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 290 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 474ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/212 places, 26/266 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 667 ms. Remains : 20/212 places, 26/266 transitions.
[2024-05-30 02:05:45] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:05:45] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:05:45] [INFO ] Input system was already deterministic with 26 transitions.
RANDOM walk for 1406 steps (130 resets) in 15 ms. (87 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-15-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 02:05:45] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:05:45] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:05:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8786844981917851346.gal : 1 ms
[2024-05-30 02:05:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16933976529414202711.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8786844981917851346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16933976529414202711.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 188 transition count 244
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 188 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 188 transition count 242
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 60 place count 176 transition count 230
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 176 transition count 230
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 81 place count 167 transition count 221
Iterating global reduction 2 with 9 rules applied. Total rules applied 90 place count 167 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 167 transition count 220
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 164 transition count 217
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 164 transition count 217
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 163 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 163 transition count 216
Applied a total of 99 rules in 14 ms. Remains 163 /212 variables (removed 49) and now considering 216/266 (removed 50) transitions.
// Phase 1: matrix 216 rows 163 cols
[2024-05-30 02:05:45] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:05:45] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 02:05:45] [INFO ] Invariant cache hit.
[2024-05-30 02:05:45] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-30 02:05:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/379 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/379 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 166 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/379 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 215/381 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 381 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10076 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 20568ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20572ms
Starting structural reductions in LTL mode, iteration 1 : 163/212 places, 216/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20854 ms. Remains : 163/212 places, 216/266 transitions.
[2024-05-30 02:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:06:06] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-30 02:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:06:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality15005028575782380253.gal : 2 ms
[2024-05-30 02:06:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality838921182267461646.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15005028575782380253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality838921182267461646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.63652e+12,0.319361,13488,2,2851,5,46074,6,0,862,49145,0


Converting to forward existential form...Done !
original formula: AF(((AG(E((AX(((p128==0)||(p142==1))) + (p276==1)) U EF((p217==1)))) * EF(EG((p91!=1)))) * ((AG((p221==0)) + (EF(AG((p274==1))) * EX((p84...190
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(E((!(EX(!(((p128==0)||(p142==1))))) + (p276==1)) U E(TRUE U (p217==1)))))) * E(TRUE ...295
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t60, t96, t99, t116, t119, t136, t139, t141, t152, t155, t173, t187, t190,...268
(forward)formula 0,0,19.3555,485144,1,0,733,2.80053e+06,474,430,5322,3.44001e+06,960
FORMULA SmartHome-PT-15-CTLCardinality-2024-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 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 185 transition count 241
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 185 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 185 transition count 239
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 66 place count 173 transition count 227
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 173 transition count 227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 164 transition count 218
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 164 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 164 transition count 216
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 160 transition count 212
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 160 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 158 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 158 transition count 210
Applied a total of 110 rules in 11 ms. Remains 158 /212 variables (removed 54) and now considering 210/266 (removed 56) transitions.
// Phase 1: matrix 210 rows 158 cols
[2024-05-30 02:06:25] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:06:25] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 02:06:25] [INFO ] Invariant cache hit.
[2024-05-30 02:06:25] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 02:06:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 161 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10782 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 209/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 370 constraints, problems are : Problem set: 0 solved, 209 unsolved in 7349 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 18158ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 18161ms
Starting structural reductions in LTL mode, iteration 1 : 158/212 places, 210/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18365 ms. Remains : 158/212 places, 210/266 transitions.
[2024-05-30 02:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:06:43] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-30 02:06:43] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:06:43] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:06:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality12363104853863922167.gal : 2 ms
[2024-05-30 02:06:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3451266016529781571.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12363104853863922167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3451266016529781571.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((EX(((p142==1)||(p103==0))) + AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,(EX(((p142==1)||(p103==0))) + !(EX(!(FALSE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t147, t150, t167, t181, t184, t187,...268
(forward)formula 0,1,2.68377,74032,1,0,263,340561,440,187,4924,373720,440
FORMULA SmartHome-PT-15-CTLCardinality-2024-10 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 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 184 transition count 240
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 184 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 184 transition count 238
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 68 place count 172 transition count 226
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 172 transition count 226
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 163 transition count 217
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 163 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 163 transition count 215
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 159 transition count 211
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 159 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 157 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 157 transition count 209
Applied a total of 112 rules in 8 ms. Remains 157 /212 variables (removed 55) and now considering 209/266 (removed 57) transitions.
// Phase 1: matrix 209 rows 157 cols
[2024-05-30 02:06:46] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:06:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 02:06:46] [INFO ] Invariant cache hit.
[2024-05-30 02:06:46] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-30 02:06:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 160 constraints, problems are : Problem set: 0 solved, 208 unsolved in 10775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/366 variables, 157/160 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 208/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 368 constraints, problems are : Problem set: 0 solved, 208 unsolved in 9347 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 20147ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 20151ms
Starting structural reductions in LTL mode, iteration 1 : 157/212 places, 209/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20332 ms. Remains : 157/212 places, 209/266 transitions.
[2024-05-30 02:07:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:07:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:07:07] [INFO ] Input system was already deterministic with 209 transitions.
[2024-05-30 02:07:07] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:07:07] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:07:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality10431287000958564861.gal : 2 ms
[2024-05-30 02:07:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality16068275673941256733.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10431287000958564861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16068275673941256733.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AX(EF(EX(TRUE))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U 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, t180, t183, t186,...268
(forward)formula 0,0,3.10438,76660,1,0,259,392328,438,182,4864,357688,431
FORMULA SmartHome-PT-15-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 185 transition count 241
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 185 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 185 transition count 239
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 66 place count 173 transition count 227
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 173 transition count 227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 164 transition count 218
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 164 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 164 transition count 216
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 160 transition count 212
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 160 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 158 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 158 transition count 210
Applied a total of 110 rules in 11 ms. Remains 158 /212 variables (removed 54) and now considering 210/266 (removed 56) transitions.
// Phase 1: matrix 210 rows 158 cols
[2024-05-30 02:07:10] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:07:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 02:07:10] [INFO ] Invariant cache hit.
[2024-05-30 02:07:10] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 02:07:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 161 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10987 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 209/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 370 constraints, problems are : Problem set: 0 solved, 209 unsolved in 9786 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 20799ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 20803ms
Starting structural reductions in LTL mode, iteration 1 : 158/212 places, 210/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21005 ms. Remains : 158/212 places, 210/266 transitions.
[2024-05-30 02:07:31] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:07:31] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:07:31] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-30 02:07:31] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:07:31] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:07:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality939507065298712963.gal : 2 ms
[2024-05-30 02:07:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3141372860563560140.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality939507065298712963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3141372860563560140.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((EG(AG(EF((p165==0)))) * (AF((EG((p413==1)) + AX(FALSE))) + (p417==0))))
=> equivalent forward existential formula: [FwdG(Init,(EG(!(E(TRUE U !(E(TRUE U (p165==0)))))) * (!(EG(!((EG((p413==1)) + !(EX(!(FALSE))))))) + (p417==0)))...166
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t112, t115, t132, t135, t147, t150, t167, t181, t184, t187,...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-30 02:08:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:08:01] [INFO ] Applying decomposition
[2024-05-30 02:08:01] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8216405363429355375.txt' '-o' '/tmp/graph8216405363429355375.bin' '-w' '/tmp/graph8216405363429355375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8216405363429355375.bin' '-l' '-1' '-v' '-w' '/tmp/graph8216405363429355375.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:08:01] [INFO ] Decomposing Gal with order
[2024-05-30 02:08:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:08:01] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-30 02:08:01] [INFO ] Flatten gal took : 62 ms
[2024-05-30 02:08:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-30 02:08:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality5494596838498012518.gal : 6 ms
[2024-05-30 02:08:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality15662758429642167153.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5494596838498012518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15662758429642167153.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,2.21922e+12,0.120103,6764,403,45,6361,689,392,8823,60,1836,0


Converting to forward existential form...Done !
original formula: EG((EG(AG(EF((i6.u25.p165==0)))) * (AF((EG((i4.u16.p413==1)) + AX(FALSE))) + (i12.u56.p417==0))))
=> equivalent forward existential formula: [FwdG(Init,(EG(!(E(TRUE U !(E(TRUE U (i6.u25.p165==0)))))) * (!(EG(!((EG((i4.u16.p413==1)) + !(EX(!(FALSE)))))))...188
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t115, t135, t150, i0.u54.t8, i1.u8.t181, i2.u14.t167, i3.u1.t184, i4.t189, i4....360
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 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
(forward)formula 0,1,8.45129,186548,1,0,428420,689,2538,515813,298,3076,378669
FORMULA SmartHome-PT-15-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 266
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 187 transition count 243
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 187 transition count 243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 187 transition count 241
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 60 place count 177 transition count 231
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 177 transition count 231
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 170 transition count 224
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 170 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 170 transition count 222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 169 transition count 221
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 169 transition count 221
Applied a total of 88 rules in 8 ms. Remains 169 /212 variables (removed 43) and now considering 221/266 (removed 45) transitions.
// Phase 1: matrix 221 rows 169 cols
[2024-05-30 02:08:10] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:08:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 02:08:10] [INFO ] Invariant cache hit.
[2024-05-30 02:08:10] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-30 02:08:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/390 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/390 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 172 constraints, problems are : Problem set: 0 solved, 220 unsolved in 11950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/390 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 220/392 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/390 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 392 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 22052ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 22054ms
Starting structural reductions in LTL mode, iteration 1 : 169/212 places, 221/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22277 ms. Remains : 169/212 places, 221/266 transitions.
[2024-05-30 02:08:32] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:08:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:08:32] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-30 02:08:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:08:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:08:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality6024835282307453638.gal : 2 ms
[2024-05-30 02:08:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality156280743634941392.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6024835282307453638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality156280743634941392.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7411e+12,0.596065,15652,2,3255,5,54888,6,0,891,59373,0


Converting to forward existential form...Done !
original formula: (AG(EX(TRUE)) + EF((EF(((p87==1)||(p254==1))) + AG(EX(((p214==0)&&(p287==1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U (E(TRUE U ((p87==1)||(p254==1))) + !(E(TRUE U !(EX(((p214==0)&&(p287==1)))))))))),TRUE...180
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t35, t64, t101, t104, t121, t124, t141, t144, t156, t160, t178, t192, t195, t19...270
(forward)formula 0,1,5.00925,127368,1,0,297,722999,464,208,5036,626764,490
FORMULA SmartHome-PT-15-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 02:08:37] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:08:37] [INFO ] Flatten gal took : 6 ms
Total runtime 388794 ms.

BK_STOP 1717034917714

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-15, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683811500449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-15.tgz
mv SmartHome-PT-15 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;