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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 03:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 03:40 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 64K 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-08-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-08-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717031239741

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 01:07:22] [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 01:07:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:07:22] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-05-30 01:07:22] [INFO ] Transformed 252 places.
[2024-05-30 01:07:22] [INFO ] Transformed 291 transitions.
[2024-05-30 01:07:22] [INFO ] Found NUPN structural information;
[2024-05-30 01:07:22] [INFO ] Parsed PT model containing 252 places and 291 transitions and 664 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 21 transitions.
FORMULA SmartHome-PT-08-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 270/270 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 187 transition count 225
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 187 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 187 transition count 221
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 182 transition count 216
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 182 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 178 transition count 212
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 178 transition count 212
Applied a total of 112 rules in 137 ms. Remains 178 /232 variables (removed 54) and now considering 212/270 (removed 58) transitions.
// Phase 1: matrix 212 rows 178 cols
[2024-05-30 01:07:23] [INFO ] Computed 11 invariants in 36 ms
[2024-05-30 01:07:23] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-30 01:07:23] [INFO ] Invariant cache hit.
[2024-05-30 01:07:24] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-30 01:07:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-30 01:07:27] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 41 ms to minimize.
[2024-05-30 01:07:27] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 4 ms to minimize.
[2024-05-30 01:07:27] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 4 ms to minimize.
[2024-05-30 01:07:27] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 4 ms to minimize.
[2024-05-30 01:07:28] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 4 ms to minimize.
[2024-05-30 01:07:28] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 4 ms to minimize.
[2024-05-30 01:07:28] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 4 ms to minimize.
[2024-05-30 01:07:28] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 3 ms to minimize.
[2024-05-30 01:07:28] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 4 ms to minimize.
[2024-05-30 01:07:28] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 4 ms to minimize.
[2024-05-30 01:07:28] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 3 ms to minimize.
[2024-05-30 01:07:29] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:07:29] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-30 01:07:30] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-30 01:07:30] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-30 01:07:34] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:07:34] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 212/390 variables, 178/206 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-30 01:07:38] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 207 constraints, problems are : Problem set: 0 solved, 211 unsolved in 22551 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-30 01:07:48] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/390 variables, 178/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 211/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-30 01:07:52] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 4 ms to minimize.
[2024-05-30 01:07:52] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 421 constraints, problems are : Problem set: 0 solved, 211 unsolved in 17580 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 21/21 constraints]
After SMT, in 40264ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 40300ms
Starting structural reductions in LTL mode, iteration 1 : 178/232 places, 212/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41348 ms. Remains : 178/232 places, 212/270 transitions.
Support contains 61 out of 178 places after structural reductions.
[2024-05-30 01:08:04] [INFO ] Flatten gal took : 81 ms
[2024-05-30 01:08:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-08-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:08:04] [INFO ] Flatten gal took : 34 ms
[2024-05-30 01:08:04] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 60 out of 178 places (down from 61) after GAL structural reductions.
RANDOM walk for 40000 steps (253 resets) in 1443 ms. (27 steps per ms) remains 1/45 properties
BEST_FIRST walk for 40004 steps (41 resets) in 309 ms. (129 steps per ms) remains 1/1 properties
[2024-05-30 01:08:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/178 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/390 variables, 178/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/390 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 178/178 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 152/178 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 01:08:05] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-30 01:08:06] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 3 ms to minimize.
[2024-05-30 01:08:06] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 212/390 variables, 178/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 727ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 212/212 transitions.
Graph (trivial) has 173 edges and 178 vertex of which 79 / 178 are part of one of the 6 SCC in 9 ms
Free SCC test removed 73 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 105 transition count 81
Reduce places removed 32 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 37 rules applied. Total rules applied 70 place count 73 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 71 transition count 76
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 72 place count 71 transition count 69
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 86 place count 64 transition count 69
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 95 place count 55 transition count 60
Iterating global reduction 3 with 9 rules applied. Total rules applied 104 place count 55 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 55 transition count 59
Performed 23 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 151 place count 32 transition count 32
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 97 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 11 rules applied. Total rules applied 162 place count 30 transition count 22
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 168 place count 30 transition count 16
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 174 place count 24 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 23 transition count 15
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 11 rules applied. Total rules applied 186 place count 18 transition count 9
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 192 place count 12 transition count 9
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 192 place count 12 transition count 4
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 204 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 204 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 206 place count 4 transition count 3
Applied a total of 206 rules in 80 ms. Remains 4 /178 variables (removed 174) and now considering 3/212 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 4/178 places, 3/212 transitions.
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
[2024-05-30 01:08:06] [INFO ] Flatten gal took : 23 ms
[2024-05-30 01:08:06] [INFO ] Flatten gal took : 25 ms
[2024-05-30 01:08:06] [INFO ] Input system was already deterministic with 212 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 193
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 159 transition count 191
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 151 transition count 183
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 151 transition count 183
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 147 transition count 179
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 147 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 145 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 145 transition count 177
Applied a total of 68 rules in 20 ms. Remains 145 /178 variables (removed 33) and now considering 177/212 (removed 35) transitions.
// Phase 1: matrix 177 rows 145 cols
[2024-05-30 01:08:06] [INFO ] Computed 11 invariants in 7 ms
[2024-05-30 01:08:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-30 01:08:06] [INFO ] Invariant cache hit.
[2024-05-30 01:08:06] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 01:08:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 01:08:08] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 7 ms to minimize.
[2024-05-30 01:08:08] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-30 01:08:09] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 45 ms to minimize.
[2024-05-30 01:08:09] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 46 ms to minimize.
[2024-05-30 01:08:09] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-30 01:08:09] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-30 01:08:09] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 2 ms to minimize.
[2024-05-30 01:08:09] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-30 01:08:09] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-30 01:08:10] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 3 ms to minimize.
[2024-05-30 01:08:10] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 01:08:10] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-30 01:08:11] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/322 variables, 145/169 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 01:08:13] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 170 constraints, problems are : Problem set: 0 solved, 176 unsolved in 12469 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/322 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 176/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 346 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8752 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 14/14 constraints]
After SMT, in 21284ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 21290ms
Starting structural reductions in LTL mode, iteration 1 : 145/178 places, 177/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21595 ms. Remains : 145/178 places, 177/212 transitions.
[2024-05-30 01:08:28] [INFO ] Flatten gal took : 19 ms
[2024-05-30 01:08:28] [INFO ] Flatten gal took : 19 ms
[2024-05-30 01:08:28] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-30 01:08:28] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:08:28] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:08:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6255295107673125224.gal : 8 ms
[2024-05-30 01:08:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11065389219552558684.ctl : 5 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/CTLCardinality6255295107673125224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11065389219552558684.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.25345e+09,0.413053,13524,2,3645,5,47109,6,0,759,43136,0


Converting to forward existential form...Done !
original formula: (EX((AG((p131==1)) * (p199==1))) + AG((((((p155==1) * EF(EG((p192==0)))) + (p19==0)) + ((p50==1)||((p26==0)&&(p146==1)))) + ((EF(((p88==0...268
=> equivalent forward existential formula: ([((((FwdU((Init * !(EX((!(E(TRUE U !((p131==1)))) * (p199==1))))),TRUE) * !(((E(TRUE U ((p88==0)||(p147==1))) +...636
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t10, t11, t13, t31, t34, t72, t73, t96, t116, t152, Intersection with reachable at e...222
(forward)formula 0,1,13.3399,320924,1,0,577,2.00094e+06,396,331,4518,1.81405e+06,749
FORMULA SmartHome-PT-08-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 152 transition count 186
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 152 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 152 transition count 184
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 144 transition count 176
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 144 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 139 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 139 transition count 171
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 136 transition count 168
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 136 transition count 168
Applied a total of 86 rules in 14 ms. Remains 136 /178 variables (removed 42) and now considering 168/212 (removed 44) transitions.
// Phase 1: matrix 168 rows 136 cols
[2024-05-30 01:08:41] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:08:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 01:08:41] [INFO ] Invariant cache hit.
[2024-05-30 01:08:42] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-30 01:08:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-30 01:08:44] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 4 ms to minimize.
[2024-05-30 01:08:44] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-30 01:08:44] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-30 01:08:44] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 3 ms to minimize.
[2024-05-30 01:08:44] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-30 01:08:44] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/304 variables, 136/153 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 153 constraints, problems are : Problem set: 0 solved, 167 unsolved in 8891 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/304 variables, 136/153 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 167/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 320 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6576 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 6/6 constraints]
After SMT, in 15510ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15514ms
Starting structural reductions in LTL mode, iteration 1 : 136/178 places, 168/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15798 ms. Remains : 136/178 places, 168/212 transitions.
[2024-05-30 01:08:57] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:08:57] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:08:57] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-30 01:08:57] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:08:57] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:08:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality11196746931394801390.gal : 5 ms
[2024-05-30 01:08:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality5441564138511585717.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/CTLCardinality11196746931394801390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5441564138511585717.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.52802e+09,0.376638,13548,2,2749,5,48516,6,0,714,41373,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(A((p98==0) U ((p65==0)||(p148==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!((E(!(((p65==0)||(p148==1))) U (!((p98==0)) * !(((p65==0)||(p148==1))))) ...202
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t67, t87, t108, t143, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,3.66944,90496,1,0,281,512781,368,188,4240,414422,463
FORMULA SmartHome-PT-08-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 152 transition count 186
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 152 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 152 transition count 184
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 142 transition count 174
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 142 transition count 174
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 136 transition count 168
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 136 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 136 transition count 167
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 133 transition count 164
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 133 transition count 164
Applied a total of 93 rules in 24 ms. Remains 133 /178 variables (removed 45) and now considering 164/212 (removed 48) transitions.
// Phase 1: matrix 164 rows 133 cols
[2024-05-30 01:09:01] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:09:01] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 01:09:01] [INFO ] Invariant cache hit.
[2024-05-30 01:09:01] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-30 01:09:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-30 01:09:03] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 3 ms to minimize.
[2024-05-30 01:09:03] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-30 01:09:03] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-30 01:09:03] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 3 ms to minimize.
[2024-05-30 01:09:03] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-30 01:09:04] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 3 ms to minimize.
[2024-05-30 01:09:04] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-30 01:09:04] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-30 01:09:05] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/297 variables, 133/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 153 constraints, problems are : Problem set: 0 solved, 163 unsolved in 9829 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/297 variables, 133/153 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 163/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 316 constraints, problems are : Problem set: 0 solved, 163 unsolved in 7671 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 9/9 constraints]
After SMT, in 17543ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 17548ms
Starting structural reductions in LTL mode, iteration 1 : 133/178 places, 164/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17822 ms. Remains : 133/178 places, 164/212 transitions.
[2024-05-30 01:09:19] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:09:19] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:09:19] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-30 01:09:19] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:09:19] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:09:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16016807909867497681.gal : 9 ms
[2024-05-30 01:09:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality10842635358838797951.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/CTLCardinality16016807909867497681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10842635358838797951.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,3.06807e+09,0.31317,13000,2,2616,5,44684,6,0,698,39290,0


Converting to forward existential form...Done !
original formula: AF(AX(AG(AX(((p19==0)||(p120==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(E(TRUE U !(!(EX(!(((p19==0)||(p120==1)))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t64, t84, t104, t139, Intersection with reachable at each step enabled. (...202
(forward)formula 0,0,24.9373,618228,1,0,609,2.4067e+06,356,420,4166,4.81474e+06,645
FORMULA SmartHome-PT-08-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Graph (trivial) has 170 edges and 178 vertex of which 68 / 178 are part of one of the 6 SCC in 2 ms
Free SCC test removed 62 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 115 transition count 96
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 44 rules applied. Total rules applied 81 place count 79 transition count 88
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 87 place count 75 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 73 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 89 place count 73 transition count 79
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 103 place count 66 transition count 79
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 113 place count 56 transition count 69
Iterating global reduction 4 with 10 rules applied. Total rules applied 123 place count 56 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 56 transition count 68
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 160 place count 38 transition count 49
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 163 place count 38 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 6 with 6 rules applied. Total rules applied 169 place count 35 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 179 place count 35 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 181 place count 33 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 183 place count 31 transition count 31
Applied a total of 183 rules in 42 ms. Remains 31 /178 variables (removed 147) and now considering 31/212 (removed 181) transitions.
[2024-05-30 01:09:44] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 31 cols
[2024-05-30 01:09:44] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:09:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 01:09:44] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2024-05-30 01:09:44] [INFO ] Invariant cache hit.
[2024-05-30 01:09:44] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-30 01:09:44] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-30 01:09:44] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2024-05-30 01:09:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 25/56 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/57 variables, and 40 constraints, problems are : Problem set: 0 solved, 16 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 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/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 25/56 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/57 variables, and 56 constraints, problems are : Problem set: 0 solved, 16 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 613ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/178 places, 31/212 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 784 ms. Remains : 31/178 places, 31/212 transitions.
[2024-05-30 01:09:45] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:09:45] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:09:45] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-30 01:09:45] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:09:45] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:09:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17519346621038310615.gal : 2 ms
[2024-05-30 01:09:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality979378736824384657.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/CTLCardinality17519346621038310615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality979378736824384657.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,5760,0.014382,3520,2,171,5,717,6,0,152,547,0


Converting to forward existential form...Done !
original formula: EF((AG((p39==1)) * (p66==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p66==0)) * !(E(TRUE U !((p39==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.031792,3836,1,0,7,3166,15,1,705,1010,5
FORMULA SmartHome-PT-08-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 152 transition count 186
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 152 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 152 transition count 184
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 142 transition count 174
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 142 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 137 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 137 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 137 transition count 168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 134 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 134 transition count 165
Applied a total of 91 rules in 25 ms. Remains 134 /178 variables (removed 44) and now considering 165/212 (removed 47) transitions.
// Phase 1: matrix 165 rows 134 cols
[2024-05-30 01:09:45] [INFO ] Computed 11 invariants in 1 ms
[2024-05-30 01:09:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 01:09:45] [INFO ] Invariant cache hit.
[2024-05-30 01:09:45] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-30 01:09:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 3 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 3 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 17 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:09:47] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/299 variables, 134/155 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/299 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 155 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8590 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/299 variables, 134/155 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 164/319 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 319 constraints, problems are : Problem set: 0 solved, 164 unsolved in 7397 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 10/10 constraints]
After SMT, in 16015ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 16020ms
Starting structural reductions in LTL mode, iteration 1 : 134/178 places, 165/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16255 ms. Remains : 134/178 places, 165/212 transitions.
[2024-05-30 01:10:01] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:10:01] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:10:01] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-30 01:10:01] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:10:01] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:10:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2528665270755914782.gal : 2 ms
[2024-05-30 01:10:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality18139938139080248606.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/CTLCardinality2528665270755914782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18139938139080248606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.13391e+09,0.240839,10892,2,2637,5,33360,6,0,703,29396,0


Converting to forward existential form...Done !
original formula: !(E(AX(FALSE) U EX(!(EG(EF((p127==1)))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,!(EX(!(FALSE))))) * !(EG(E(TRUE U (p127==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t65, t86, t106, t140, Intersection with reachable at each step enabled. (...202
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.22918,57456,1,0,219,274901,363,151,4406,211406,371
FORMULA SmartHome-PT-08-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 151 transition count 185
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 151 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 151 transition count 183
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 141 transition count 173
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 141 transition count 173
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 135 transition count 167
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 135 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 135 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 132 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 132 transition count 163
Applied a total of 95 rules in 20 ms. Remains 132 /178 variables (removed 46) and now considering 163/212 (removed 49) transitions.
// Phase 1: matrix 163 rows 132 cols
[2024-05-30 01:10:03] [INFO ] Computed 11 invariants in 7 ms
[2024-05-30 01:10:03] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 01:10:03] [INFO ] Invariant cache hit.
[2024-05-30 01:10:04] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-30 01:10:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 01:10:06] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 4 ms to minimize.
[2024-05-30 01:10:06] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 3 ms to minimize.
[2024-05-30 01:10:06] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 3 ms to minimize.
[2024-05-30 01:10:06] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-05-30 01:10:06] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-30 01:10:06] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 3 ms to minimize.
[2024-05-30 01:10:06] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-30 01:10:06] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 162/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 313 constraints, problems are : Problem set: 0 solved, 162 unsolved in 6773 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
After SMT, in 15849ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 15854ms
Starting structural reductions in LTL mode, iteration 1 : 132/178 places, 163/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16119 ms. Remains : 132/178 places, 163/212 transitions.
[2024-05-30 01:10:19] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:10:20] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:10:20] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-30 01:10:20] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:10:20] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:10:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality4541546963011723835.gal : 2 ms
[2024-05-30 01:10:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality9956289700656523388.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/CTLCardinality4541546963011723835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9956289700656523388.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.87687e+09,0.360072,13256,2,2657,5,46629,6,0,693,41485,0


Converting to forward existential form...Done !
original formula: EF(AX((p122==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p122==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t64, t84, t104, t138, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,2.22234,44180,1,0,199,185708,343,137,3818,155892,333
FORMULA SmartHome-PT-08-CTLCardinality-2024-08 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 : 178/178 places, 212/212 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 190
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 156 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 148 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 148 transition count 180
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 144 transition count 176
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 144 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 144 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 142 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 142 transition count 173
Applied a total of 75 rules in 16 ms. Remains 142 /178 variables (removed 36) and now considering 173/212 (removed 39) transitions.
// Phase 1: matrix 173 rows 142 cols
[2024-05-30 01:10:22] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:10:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 01:10:22] [INFO ] Invariant cache hit.
[2024-05-30 01:10:22] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-30 01:10:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-30 01:10:24] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 3 ms to minimize.
[2024-05-30 01:10:24] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-05-30 01:10:24] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 3 ms to minimize.
[2024-05-30 01:10:24] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-30 01:10:24] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/315 variables, 142/158 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/315 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 158 constraints, problems are : Problem set: 0 solved, 172 unsolved in 9507 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/315 variables, 142/158 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 172/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-30 01:10:35] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 331 constraints, problems are : Problem set: 0 solved, 172 unsolved in 9050 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 6/6 constraints]
After SMT, in 18596ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 18599ms
Starting structural reductions in LTL mode, iteration 1 : 142/178 places, 173/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18911 ms. Remains : 142/178 places, 173/212 transitions.
[2024-05-30 01:10:41] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:10:41] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:10:41] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-30 01:10:41] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:10:41] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:10:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality224497864500808804.gal : 5 ms
[2024-05-30 01:10:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality15639862629502798949.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/CTLCardinality224497864500808804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15639862629502798949.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,4.00518e+09,0.341191,14632,2,3222,5,53447,6,0,743,44706,0


Converting to forward existential form...Done !
original formula: EF((EG((p162==1)) + (AX(FALSE) * ((AG((p200!=1)) + EF(((p197==0)&&(p205==1)))) + ((p206==1)||((p84==0)&&(p153==1)))))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(p162==1))] != FALSE + (([((FwdU(Init,TRUE) * !(EX(!(FALSE)))) * !(E(TRUE U !((p200!=1)))...345
Hit Full ! (commute/partial/dont) 171/0/2
(forward)formula 0,1,1.09917,34376,1,0,17,179430,19,2,3449,52029,16
FORMULA SmartHome-PT-08-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Graph (trivial) has 169 edges and 178 vertex of which 72 / 178 are part of one of the 6 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 111 transition count 94
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 78 transition count 91
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 77 transition count 90
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 76 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 75 transition count 88
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 76 place count 75 transition count 80
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 92 place count 67 transition count 80
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 101 place count 58 transition count 71
Iterating global reduction 5 with 9 rules applied. Total rules applied 110 place count 58 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 111 place count 58 transition count 70
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 147 place count 40 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 150 place count 40 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 156 place count 37 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 165 place count 37 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 166 place count 36 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 168 place count 34 transition count 34
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 16 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 170 place count 32 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 172 place count 32 transition count 32
Applied a total of 172 rules in 27 ms. Remains 32 /178 variables (removed 146) and now considering 32/212 (removed 180) transitions.
[2024-05-30 01:10:42] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 32 cols
[2024-05-30 01:10:42] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:10:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 01:10:42] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-30 01:10:42] [INFO ] Invariant cache hit.
[2024-05-30 01:10:42] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-30 01:10:42] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-30 01:10:42] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-30 01:10:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 26/58 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/59 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 26/58 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/59 variables, and 58 constraints, problems are : Problem set: 0 solved, 17 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 699ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 700ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/178 places, 32/212 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 858 ms. Remains : 32/178 places, 32/212 transitions.
[2024-05-30 01:10:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:10:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:10:43] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-30 01:10:43] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:10:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:10:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality16293705267834160030.gal : 1 ms
[2024-05-30 01:10:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4752131617760702550.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/CTLCardinality16293705267834160030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4752131617760702550.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,7680,0.016005,3528,2,136,5,746,6,0,157,596,0


Converting to forward existential form...Done !
original formula: AG(!(E((p86==1) U (p166!=0))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),(p86==1)) * (p166!=0))] = FALSE
Hit Full ! (commute/partial/dont) 30/0/2
(forward)formula 0,0,0.020292,3844,1,0,8,822,15,1,288,596,4
FORMULA SmartHome-PT-08-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 154 transition count 188
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 154 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 154 transition count 186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 148 transition count 180
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 148 transition count 180
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 144 transition count 176
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 144 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 144 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 143 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 143 transition count 174
Applied a total of 73 rules in 15 ms. Remains 143 /178 variables (removed 35) and now considering 174/212 (removed 38) transitions.
// Phase 1: matrix 174 rows 143 cols
[2024-05-30 01:10:43] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:10:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-30 01:10:43] [INFO ] Invariant cache hit.
[2024-05-30 01:10:43] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-30 01:10:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-30 01:10:45] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-30 01:10:45] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-30 01:10:46] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 3 ms to minimize.
[2024-05-30 01:10:46] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-30 01:10:47] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 3 ms to minimize.
[2024-05-30 01:10:47] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/317 variables, 143/160 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 160 constraints, problems are : Problem set: 0 solved, 173 unsolved in 10774 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-30 01:10:55] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/317 variables, 143/161 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 173/334 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 334 constraints, problems are : Problem set: 0 solved, 173 unsolved in 8382 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 7/7 constraints]
After SMT, in 19179ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 19181ms
Starting structural reductions in LTL mode, iteration 1 : 143/178 places, 174/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19402 ms. Remains : 143/178 places, 174/212 transitions.
[2024-05-30 01:11:02] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:11:02] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:11:02] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-30 01:11:02] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:11:02] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:11:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality13919174185673479751.gal : 1 ms
[2024-05-30 01:11:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality12351670451669186281.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/CTLCardinality13919174185673479751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12351670451669186281.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,4.32653e+09,0.377233,15168,2,3364,5,55245,6,0,748,46915,0


Converting to forward existential form...Done !
original formula: AG((EG(((((p76==0)&&(p154==0))&&(p243==1)) + EG((p32==0)))) * (AX(((p187==1) + EF((p117==1)))) + (p49==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(((((p76==0)&&(p154==0))&&(p243==1)) + EG((p32==0))))))] = FALSE * [((EY((FwdU(Init,TRU...225
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t36, t68, t90, t111, t126, t149, Intersection with reachable at each step enab...208
(forward)formula 0,0,2.84967,78032,1,0,230,402048,373,159,4325,292225,379
FORMULA SmartHome-PT-08-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 212/212 transitions.
Graph (trivial) has 161 edges and 178 vertex of which 59 / 178 are part of one of the 6 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 124 transition count 106
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 45 rules applied. Total rules applied 84 place count 86 transition count 99
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 91 place count 83 transition count 95
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 95 place count 79 transition count 95
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 95 place count 79 transition count 88
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 109 place count 72 transition count 88
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 117 place count 64 transition count 80
Iterating global reduction 4 with 8 rules applied. Total rules applied 125 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 64 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 129 place count 63 transition count 77
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 165 place count 45 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 168 place count 45 transition count 55
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 7 with 6 rules applied. Total rules applied 174 place count 42 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 181 place count 42 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 183 place count 40 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 184 place count 39 transition count 43
Applied a total of 184 rules in 25 ms. Remains 39 /178 variables (removed 139) and now considering 43/212 (removed 169) transitions.
[2024-05-30 01:11:05] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
// Phase 1: matrix 38 rows 39 cols
[2024-05-30 01:11:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:11:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 01:11:05] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
[2024-05-30 01:11:05] [INFO ] Invariant cache hit.
[2024-05-30 01:11:05] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-30 01:11:05] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-30 01:11:05] [INFO ] Flow matrix only has 38 transitions (discarded 5 similar events)
[2024-05-30 01:11:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 37/76 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/77 variables, and 49 constraints, problems are : Problem set: 0 solved, 23 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 37/76 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/77 variables, and 72 constraints, problems are : Problem set: 0 solved, 23 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 712ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/178 places, 43/212 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 888 ms. Remains : 39/178 places, 43/212 transitions.
[2024-05-30 01:11:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:11:06] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:11:06] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-30 01:11:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:11:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:11:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16407803157442846137.gal : 1 ms
[2024-05-30 01:11:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality3151713427235829964.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/CTLCardinality16407803157442846137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3151713427235829964.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,64800,0.015334,3596,2,194,5,935,6,0,196,707,0


Converting to forward existential form...Done !
original formula: AF(E((AF(((p225!=1) + EG((p100==0)))) + (AF(((p121==0)||(p91==1))) * !(((p159==0)||(p67==1))))) U (p126==1)))
=> equivalent forward existential formula: [FwdG(Init,!(E((!(EG(!(((p225!=1) + EG((p100==0)))))) + (!(EG(!(((p121==0)||(p91==1))))) * !(((p159==0)||(p67==1...184
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 41/0/2
Using saturation style SCC detection
(forward)formula 0,1,0.207065,10776,1,0,89,41440,43,58,1021,51012,60
FORMULA SmartHome-PT-08-CTLCardinality-2023-14 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 : 178/178 places, 212/212 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 160 transition count 194
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 160 transition count 194
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 152 transition count 186
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 152 transition count 186
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 148 transition count 182
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 148 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 148 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 147 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 147 transition count 180
Applied a total of 63 rules in 10 ms. Remains 147 /178 variables (removed 31) and now considering 180/212 (removed 32) transitions.
// Phase 1: matrix 180 rows 147 cols
[2024-05-30 01:11:06] [INFO ] Computed 11 invariants in 3 ms
[2024-05-30 01:11:06] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 01:11:06] [INFO ] Invariant cache hit.
[2024-05-30 01:11:06] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-30 01:11:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-30 01:11:08] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 4 ms to minimize.
[2024-05-30 01:11:09] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:11:09] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
[2024-05-30 01:11:09] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/327 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 162 constraints, problems are : Problem set: 0 solved, 179 unsolved in 9682 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-30 01:11:18] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-30 01:11:18] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:11:18] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/327 variables, 147/165 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 179/344 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-30 01:11:21] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 345 constraints, problems are : Problem set: 0 solved, 179 unsolved in 12779 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 8/8 constraints]
After SMT, in 22498ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 22501ms
Starting structural reductions in LTL mode, iteration 1 : 147/178 places, 180/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22750 ms. Remains : 147/178 places, 180/212 transitions.
[2024-05-30 01:11:29] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:11:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:11:29] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-30 01:11:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:11:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:11:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15351935379181116789.gal : 2 ms
[2024-05-30 01:11:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1232072342616624715.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/CTLCardinality15351935379181116789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1232072342616624715.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.91356e+09,0.56438,15996,2,3310,5,58155,6,0,770,53594,0


Converting to forward existential form...Done !
original formula: E(((EF(!(((p194==0)||(p4==1)))) * AF(E((p0==0) U (p15==1)))) * (E(AF(((((p210==0)||(p86==1))&&(p112==1))&&(p94==0))) U ((((p239!=1) * AG(...309
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U !(((p194==0)||(p4==1)))) * !(EG(!(E((p0==0) U (p15==1)))))) * (E(!(EG(!(((((p210==0)||(p8...474
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t10, t13, t14, t37, t38, t70, t94, t117, t152, t153, Intersection with reachable at ...223
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,29.3952,757984,1,0,1370,4.69358e+06,434,986,4807,4.8125e+06,1818
FORMULA SmartHome-PT-08-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 01:11:59] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:11:59] [INFO ] Flatten gal took : 6 ms
Total runtime 276901 ms.

BK_STOP 1717031519251

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

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