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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 12 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 12 03:47 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 68K 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-10-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-10-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717032224268

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 01:23:46] [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:23:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:23:47] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-05-30 01:23:47] [INFO ] Transformed 273 places.
[2024-05-30 01:23:47] [INFO ] Transformed 308 transitions.
[2024-05-30 01:23:47] [INFO ] Found NUPN structural information;
[2024-05-30 01:23:47] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 192 transition count 222
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 192 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 192 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 188 transition count 216
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 188 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 185 transition count 213
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 185 transition count 213
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 184 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 184 transition count 212
Applied a total of 100 rules in 146 ms. Remains 184 /233 variables (removed 49) and now considering 212/263 (removed 51) transitions.
// Phase 1: matrix 212 rows 184 cols
[2024-05-30 01:23:47] [INFO ] Computed 12 invariants in 35 ms
[2024-05-30 01:23:48] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-30 01:23:48] [INFO ] Invariant cache hit.
[2024-05-30 01:23:48] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-30 01:23:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-30 01:23:52] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 42 ms to minimize.
[2024-05-30 01:23:52] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 4 ms to minimize.
[2024-05-30 01:23:52] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 4 ms to minimize.
[2024-05-30 01:23:52] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2024-05-30 01:23:53] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 4 ms to minimize.
[2024-05-30 01:23:53] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 3 ms to minimize.
[2024-05-30 01:23:53] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
[2024-05-30 01:23:53] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-30 01:23:54] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:23:54] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:23:54] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:23:54] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/396 variables, 184/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 208 constraints, problems are : Problem set: 0 solved, 211 unsolved in 14075 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/396 variables, 184/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 211/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-30 01:24:06] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-30 01:24:07] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 3 ms to minimize.
[2024-05-30 01:24:07] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 4 ms to minimize.
[2024-05-30 01:24:08] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 423 constraints, problems are : Problem set: 0 solved, 211 unsolved in 15225 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 16/16 constraints]
After SMT, in 29467ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 29502ms
Starting structural reductions in LTL mode, iteration 1 : 184/233 places, 212/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30580 ms. Remains : 184/233 places, 212/263 transitions.
Support contains 67 out of 184 places after structural reductions.
[2024-05-30 01:24:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-30 01:24:18] [INFO ] Flatten gal took : 76 ms
[2024-05-30 01:24:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SmartHome-PT-10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:24:18] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:24:18] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 52 out of 184 places (down from 67) after GAL structural reductions.
RANDOM walk for 40000 steps (287 resets) in 2146 ms. (18 steps per ms) remains 7/37 properties
BEST_FIRST walk for 40003 steps (49 resets) in 294 ms. (135 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (52 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (45 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (45 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (45 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (46 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
[2024-05-30 01:24:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 101/175 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 01:24:19] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-30 01:24:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/184 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 01:24:19] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 212/396 variables, 184/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 01:24:20] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 200 constraints, problems are : Problem set: 0 solved, 6 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 01:24:20] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 101/175 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 9/184 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 212/396 variables, 184/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 01:24:20] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-05-30 01:24:20] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/396 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 209 constraints, problems are : Problem set: 0 solved, 6 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
After SMT, in 1192ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2170 ms.
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 212/212 transitions.
Graph (trivial) has 166 edges and 184 vertex of which 87 / 184 are part of one of the 6 SCC in 5 ms
Free SCC test removed 81 places
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 103 transition count 80
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 79 transition count 74
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 76 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 76 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 75 transition count 73
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 70 place count 65 transition count 63
Iterating global reduction 3 with 10 rules applied. Total rules applied 80 place count 65 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 65 transition count 62
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 119 place count 46 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 123 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 7 rules applied. Total rules applied 126 place count 44 transition count 37
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 132 place count 44 transition count 31
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 138 place count 38 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 37 transition count 30
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 144 place count 33 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 145 place count 32 transition count 29
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 145 place count 32 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 153 place count 28 transition count 25
Applied a total of 153 rules in 71 ms. Remains 28 /184 variables (removed 156) and now considering 25/212 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 28/184 places, 25/212 transitions.
RANDOM walk for 120 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/6 properties
[2024-05-30 01:24:23] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:24:23] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:24:23] [INFO ] Input system was already deterministic with 212 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Graph (trivial) has 168 edges and 184 vertex of which 69 / 184 are part of one of the 6 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 120 transition count 96
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 44 rules applied. Total rules applied 80 place count 85 transition count 87
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 87 place count 80 transition count 85
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 79 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 78 transition count 84
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 90 place count 78 transition count 81
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 96 place count 75 transition count 81
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 108 place count 63 transition count 69
Iterating global reduction 5 with 12 rules applied. Total rules applied 120 place count 63 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 63 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 121 place count 63 transition count 67
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 123 place count 62 transition count 67
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 161 place count 43 transition count 48
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 6 with 2 rules applied. Total rules applied 163 place count 43 transition count 46
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 165 place count 42 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 171 place count 42 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 173 place count 40 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 175 place count 38 transition count 37
Applied a total of 175 rules in 30 ms. Remains 38 /184 variables (removed 146) and now considering 37/212 (removed 175) transitions.
[2024-05-30 01:24:23] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2024-05-30 01:24:23] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 01:24:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 01:24:23] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-30 01:24:23] [INFO ] Invariant cache hit.
[2024-05-30 01:24:23] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-30 01:24:23] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-30 01:24:23] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-30 01:24:23] [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, 1/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 31/69 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/70 variables, and 48 constraints, problems are : Problem set: 0 solved, 23 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 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, 1/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 31/69 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 23/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/70 variables, and 71 constraints, problems are : Problem set: 0 solved, 23 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 974ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 976ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/184 places, 37/212 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1198 ms. Remains : 38/184 places, 37/212 transitions.
[2024-05-30 01:24:24] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:24:24] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:24:24] [INFO ] Input system was already deterministic with 37 transitions.
RANDOM walk for 53 steps (4 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:24:24] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:24:24] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:24:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11113187520267503140.gal : 2 ms
[2024-05-30 01:24:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6432435467299567872.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11113187520267503140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6432435467299567872.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Graph (trivial) has 165 edges and 184 vertex of which 80 / 184 are part of one of the 6 SCC in 1 ms
Free SCC test removed 74 places
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 109 transition count 91
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 35 rules applied. Total rules applied 62 place count 83 transition count 82
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 69 place count 78 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 76 transition count 80
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 71 place count 76 transition count 77
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 77 place count 73 transition count 77
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 87 place count 63 transition count 67
Iterating global reduction 4 with 10 rules applied. Total rules applied 97 place count 63 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 63 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 98 place count 63 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 100 place count 62 transition count 65
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 134 place count 45 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 140 place count 45 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 142 place count 43 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 144 place count 41 transition count 40
Applied a total of 144 rules in 30 ms. Remains 41 /184 variables (removed 143) and now considering 40/212 (removed 172) transitions.
[2024-05-30 01:24:24] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
// Phase 1: matrix 35 rows 41 cols
[2024-05-30 01:24:24] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:24:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 01:24:24] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
[2024-05-30 01:24:24] [INFO ] Invariant cache hit.
[2024-05-30 01:24:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 01:24:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-30 01:24:24] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-30 01:24:24] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
[2024-05-30 01:24:24] [INFO ] Invariant cache hit.
[2024-05-30 01:24:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 3/41 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-30 01:24:24] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 34/75 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/75 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/76 variables, and 53 constraints, problems are : Problem set: 0 solved, 27 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 3/41 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 34/75 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/75 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/76 variables, and 80 constraints, problems are : Problem set: 0 solved, 27 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
After SMT, in 1187ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1188ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/184 places, 40/212 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1358 ms. Remains : 41/184 places, 40/212 transitions.
[2024-05-30 01:24:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:24:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:24:25] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-30 01:24:25] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:24:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:24:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality10035531905083095752.gal : 3 ms
[2024-05-30 01:24:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality2438102455495315075.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10035531905083095752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2438102455495315075.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,7904,0.032585,3844,2,855,5,2802,6,0,200,1879,0


Converting to forward existential form...Done !
original formula: !(E(A(A((p257==0) U (p114==0)) U (p233==1)) U EG(EF((p117==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!((p233==1)) U (!(!((E(!((p114==0)) U (!((p257==0)) * !((p114==0)))) + EG(!((p114==0)))))) ...223
Reverse transition relation is NOT exact ! Due to transitions t10, t29, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
(forward)formula 0,0,0.78779,28264,1,0,342,150645,121,223,1234,142518,445
FORMULA SmartHome-PT-10-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 160 transition count 188
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 160 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 152 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 152 transition count 179
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 146 transition count 173
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 146 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 144 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 144 transition count 171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 143 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 143 transition count 170
Applied a total of 83 rules in 21 ms. Remains 143 /184 variables (removed 41) and now considering 170/212 (removed 42) transitions.
// Phase 1: matrix 170 rows 143 cols
[2024-05-30 01:24:26] [INFO ] Computed 12 invariants in 2 ms
[2024-05-30 01:24:26] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 01:24:26] [INFO ] Invariant cache hit.
[2024-05-30 01:24:26] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-30 01:24:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-30 01:24:28] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-30 01:24:28] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2024-05-30 01:24:28] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 3 ms to minimize.
[2024-05-30 01:24:29] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 159 constraints, problems are : Problem set: 0 solved, 169 unsolved in 8526 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 169/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 328 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6567 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
After SMT, in 15129ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 15134ms
Starting structural reductions in LTL mode, iteration 1 : 143/184 places, 170/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15379 ms. Remains : 143/184 places, 170/212 transitions.
[2024-05-30 01:24:42] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:24:42] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:24:42] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-30 01:24:42] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:24:42] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:24:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality13465835823592232423.gal : 7 ms
[2024-05-30 01:24:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality1133414274890074073.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/CTLCardinality13465835823592232423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1133414274890074073.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX((p258==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p258==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t143, Intersection with reachable at each step enabled. (destroyed/rever...187
(forward)formula 0,1,2.58344,64424,1,0,207,241182,357,143,4073,196923,347
FORMULA SmartHome-PT-10-CTLCardinality-2024-07 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 : 184/184 places, 212/212 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 161 transition count 189
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 161 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 161 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 153 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 153 transition count 180
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 147 transition count 174
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 147 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 145 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 144 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 144 transition count 171
Applied a total of 81 rules in 19 ms. Remains 144 /184 variables (removed 40) and now considering 171/212 (removed 41) transitions.
// Phase 1: matrix 171 rows 144 cols
[2024-05-30 01:24:44] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 01:24:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 01:24:44] [INFO ] Invariant cache hit.
[2024-05-30 01:24:44] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-30 01:24:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-30 01:24:46] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-30 01:24:46] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-30 01:24:49] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 3 ms to minimize.
[2024-05-30 01:24:49] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 160 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9926 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 170/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 330 constraints, problems are : Problem set: 0 solved, 170 unsolved in 8073 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints]
After SMT, in 18029ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 18032ms
Starting structural reductions in LTL mode, iteration 1 : 144/184 places, 171/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18271 ms. Remains : 144/184 places, 171/212 transitions.
[2024-05-30 01:25:03] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:25:03] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:25:03] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-30 01:25:03] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:25:03] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:25:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality17760739017052581719.gal : 6 ms
[2024-05-30 01:25:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2436182100971902407.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/CTLCardinality17760739017052581719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2436182100971902407.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(EF(AG(((p181==0)&&(p171==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(((p181==0)&&(p171==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t98, t144, Intersection with reachable at each step enabled. (destroyed/rever...187
(forward)formula 0,0,2.20569,60188,1,0,206,242725,364,142,4245,177370,352
FORMULA SmartHome-PT-10-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 163 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 163 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 163 transition count 190
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 157 transition count 184
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 157 transition count 184
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 153 transition count 180
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 153 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 152 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 152 transition count 179
Applied a total of 65 rules in 9 ms. Remains 152 /184 variables (removed 32) and now considering 179/212 (removed 33) transitions.
// Phase 1: matrix 179 rows 152 cols
[2024-05-30 01:25:05] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 01:25:05] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 01:25:05] [INFO ] Invariant cache hit.
[2024-05-30 01:25:05] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-30 01:25:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-30 01:25:07] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-30 01:25:07] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 4 ms to minimize.
[2024-05-30 01:25:07] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 3 ms to minimize.
[2024-05-30 01:25:07] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:25:08] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-05-30 01:25:08] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-30 01:25:10] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 179/331 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 171 constraints, problems are : Problem set: 0 solved, 178 unsolved in 9052 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/331 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 178/349 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/331 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 349 constraints, problems are : Problem set: 0 solved, 178 unsolved in 6934 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 7/7 constraints]
After SMT, in 16020ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 16022ms
Starting structural reductions in LTL mode, iteration 1 : 152/184 places, 179/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16251 ms. Remains : 152/184 places, 179/212 transitions.
[2024-05-30 01:25:21] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:25:21] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:25:21] [INFO ] Input system was already deterministic with 179 transitions.
[2024-05-30 01:25:21] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:25:21] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:25:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality7513392592716144635.gal : 3 ms
[2024-05-30 01:25:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality12252792745168594743.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/CTLCardinality7513392592716144635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12252792745168594743.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AF((AF(((p269==0)&&(p197==1))) + EX((p174==1)))) + AX((((p80==1)&&(p199==1)) * AG((p96==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!((!(EG(!(((p269==0)&&(p197==1))))) + EX((p174==1)))))))] != FALSE + [(FwdU(Init,TRUE)...230
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t40, t41, t43, t106, t152, Intersection with reachable at each step enabled. ...203
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,28.1242,695980,1,0,1075,4.59237e+06,388,653,4668,3.68971e+06,1184
FORMULA SmartHome-PT-10-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 160 transition count 188
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 160 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 152 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 152 transition count 179
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 146 transition count 173
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 146 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 144 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 144 transition count 171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 143 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 143 transition count 170
Applied a total of 83 rules in 12 ms. Remains 143 /184 variables (removed 41) and now considering 170/212 (removed 42) transitions.
// Phase 1: matrix 170 rows 143 cols
[2024-05-30 01:25:50] [INFO ] Computed 12 invariants in 2 ms
[2024-05-30 01:25:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 01:25:50] [INFO ] Invariant cache hit.
[2024-05-30 01:25:50] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-30 01:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-30 01:25:52] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 4 ms to minimize.
[2024-05-30 01:25:52] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-05-30 01:25:52] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 5 ms to minimize.
[2024-05-30 01:25:52] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 159 constraints, problems are : Problem set: 0 solved, 169 unsolved in 9627 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 169/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 328 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7533 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
After SMT, in 17186ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 17189ms
Starting structural reductions in LTL mode, iteration 1 : 143/184 places, 170/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17421 ms. Remains : 143/184 places, 170/212 transitions.
[2024-05-30 01:26:07] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:26:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:26:07] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-30 01:26:07] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:26:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:26:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality13206322568652521916.gal : 3 ms
[2024-05-30 01:26:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality8272383166516184153.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/CTLCardinality13206322568652521916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8272383166516184153.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(AX(AG(((p267==0)&&(p270==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(E(TRUE U !(((p267==0)&&(p270==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t143, Intersection with reachable at each step enabled. (destroyed/rever...187
(forward)formula 0,1,2.65301,74868,1,0,213,315658,362,146,4302,238433,356
FORMULA SmartHome-PT-10-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 166 transition count 194
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 166 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 166 transition count 193
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 162 transition count 189
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 162 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 159 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 159 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 158 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 158 transition count 185
Applied a total of 53 rules in 10 ms. Remains 158 /184 variables (removed 26) and now considering 185/212 (removed 27) transitions.
// Phase 1: matrix 185 rows 158 cols
[2024-05-30 01:26:10] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 01:26:10] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 01:26:10] [INFO ] Invariant cache hit.
[2024-05-30 01:26:10] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-30 01:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-30 01:26:12] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-30 01:26:12] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 4 ms to minimize.
[2024-05-30 01:26:13] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-30 01:26:13] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-30 01:26:13] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-30 01:26:14] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-30 01:26:15] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 185/343 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/343 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 177 constraints, problems are : Problem set: 0 solved, 184 unsolved in 11975 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/343 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 184/361 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-30 01:26:25] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:26:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
[2024-05-30 01:26:26] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 364 constraints, problems are : Problem set: 0 solved, 184 unsolved in 11581 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 10/10 constraints]
After SMT, in 23579ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 23582ms
Starting structural reductions in LTL mode, iteration 1 : 158/184 places, 185/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23811 ms. Remains : 158/184 places, 185/212 transitions.
[2024-05-30 01:26:33] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:26:33] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:26:34] [INFO ] Input system was already deterministic with 185 transitions.
[2024-05-30 01:26:34] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:26:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:26:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7203949302733646751.gal : 1 ms
[2024-05-30 01:26:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4673477067960420282.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/CTLCardinality7203949302733646751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4673477067960420282.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.8677e+09,1.05734,31664,2,10119,5,135283,6,0,819,103626,0


Converting to forward existential form...Done !
original formula: AG(A(!((!(((p255==1) + AG(((p142==0)||(p16==1))))) + AX(((p153==0)||(p185==0))))) U A((EF((p74==0)) + AX(((p91==0)||(p202==1)))) U ((EG((...239
=> equivalent forward existential formula: ((([(((FwdU((FwdU(FwdU(Init,TRUE),!(!((E(!(((EG((p156==0)) * (((p51==0)||(p232==1))||(p69==1))) + (EG((p187==1))...2459
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t13, t18, t40, t71, t109, t155, t158, Intersection with reachable at each step enab...208
Detected timeout of ITS tools.
[2024-05-30 01:27:04] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:27:04] [INFO ] Applying decomposition
[2024-05-30 01:27:04] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13605047126938077373.txt' '-o' '/tmp/graph13605047126938077373.bin' '-w' '/tmp/graph13605047126938077373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13605047126938077373.bin' '-l' '-1' '-v' '-w' '/tmp/graph13605047126938077373.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:27:04] [INFO ] Decomposing Gal with order
[2024-05-30 01:27:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:27:04] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-30 01:27:04] [INFO ] Flatten gal took : 61 ms
[2024-05-30 01:27:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-30 01:27:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12837496057897174105.gal : 6 ms
[2024-05-30 01:27:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality18160637446587260090.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/CTLCardinality12837496057897174105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18160637446587260090.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.8677e+09,0.099888,6232,419,77,5763,953,455,6389,94,2026,0


Converting to forward existential form...Done !
original formula: AG(A(!((!(((i8.u49.p255==1) + AG(((i5.u27.p142==0)||(i1.i0.u12.p16==1))))) + AX(((i4.i0.u29.p153==0)||(i6.i0.u34.p185==0))))) U A((EF((i2...373
=> equivalent forward existential formula: ((([(((FwdU((FwdU(FwdU(Init,TRUE),!(!((E(!(((EG((i6.i1.u30.p156==0)) * (((i1.i0.u11.p51==0)||(i4.i1.u43.p232==1)...3751
Reverse transition relation is NOT exact ! Due to transitions t18, t71, i0.t4, i0.u1.t158, i0.u44.t13, i0.u45.t12, i1.i0.u12.t155, i2.i0.t109, i6.i1.t40, ...253
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,0.528605,23128,1,0,41491,1838,2826,81301,486,6406,97302
FORMULA SmartHome-PT-10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Graph (trivial) has 169 edges and 184 vertex of which 86 / 184 are part of one of the 6 SCC in 0 ms
Free SCC test removed 80 places
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 103 transition count 85
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 57 place count 78 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 75 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 60 place count 75 transition count 76
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 72 transition count 76
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 78 place count 60 transition count 64
Iterating global reduction 3 with 12 rules applied. Total rules applied 90 place count 60 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 60 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 91 place count 60 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 59 transition count 62
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 129 place count 41 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 135 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 39 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 37 transition count 36
Applied a total of 139 rules in 19 ms. Remains 37 /184 variables (removed 147) and now considering 36/212 (removed 176) transitions.
[2024-05-30 01:27:04] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2024-05-30 01:27:04] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:27:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 01:27:04] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-30 01:27:04] [INFO ] Invariant cache hit.
[2024-05-30 01:27:05] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-30 01:27:05] [INFO ] Redundant transitions in 1 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-30 01:27:05] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-30 01:27:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 30/67 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/68 variables, and 47 constraints, problems are : Problem set: 0 solved, 22 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 30/67 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 22/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/68 variables, and 69 constraints, problems are : Problem set: 0 solved, 22 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 1024ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 1024ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/184 places, 36/212 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1165 ms. Remains : 37/184 places, 36/212 transitions.
[2024-05-30 01:27:06] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:27:06] [INFO ] Input system was already deterministic with 36 transitions.
RANDOM walk for 67 steps (7 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-10-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:27:06] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:06] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:27:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17138173713556893378.gal : 1 ms
[2024-05-30 01:27:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13440580621113429734.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17138173713556893378.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13440580621113429734.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13440580621113429734.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 190
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 162 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 162 transition count 189
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 154 transition count 181
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 154 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 148 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 148 transition count 175
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 146 transition count 173
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 145 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 145 transition count 172
Applied a total of 79 rules in 14 ms. Remains 145 /184 variables (removed 39) and now considering 172/212 (removed 40) transitions.
// Phase 1: matrix 172 rows 145 cols
[2024-05-30 01:27:06] [INFO ] Computed 12 invariants in 2 ms
[2024-05-30 01:27:06] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 01:27:06] [INFO ] Invariant cache hit.
[2024-05-30 01:27:06] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-30 01:27:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-30 01:27:08] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-05-30 01:27:08] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:27:08] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 8 ms to minimize.
[2024-05-30 01:27:09] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/317 variables, 145/161 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 161 constraints, problems are : Problem set: 0 solved, 171 unsolved in 9850 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/317 variables, 145/161 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 171/332 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 332 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6783 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 4/4 constraints]
After SMT, in 16668ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 16672ms
Starting structural reductions in LTL mode, iteration 1 : 145/184 places, 172/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16997 ms. Remains : 145/184 places, 172/212 transitions.
[2024-05-30 01:27:23] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:27:23] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:27:23] [INFO ] Input system was already deterministic with 172 transitions.
[2024-05-30 01:27:23] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:27:23] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:27:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality4002513106359462183.gal : 2 ms
[2024-05-30 01:27:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality1124030261600669526.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/CTLCardinality4002513106359462183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1124030261600669526.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,5.72903e+09,0.370703,15464,2,3899,5,57030,6,0,754,43880,0


Converting to forward existential form...Done !
original formula: A(AF(AX((p259==1))) U AF((EG(EF((p142==1))) * ((p250==0)||(p29==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((EG(E(TRUE U (p142==1))) * ((p250==0)||(p29==1)))))))))) * !(E(!(!(EG(!((EG(E(TRUE U (p1...307
Reverse transition relation is NOT exact ! Due to transitions t13, t14, t16, t98, t145, Intersection with reachable at each step enabled. (destroyed/rever...187
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,13.192,365272,1,0,691,2.27772e+06,385,541,4701,2.02834e+06,875
FORMULA SmartHome-PT-10-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 212/212 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 166 transition count 194
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 166 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 166 transition count 193
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 161 transition count 188
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 161 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 159 transition count 186
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 159 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 158 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 158 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 157 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 157 transition count 184
Applied a total of 55 rules in 11 ms. Remains 157 /184 variables (removed 27) and now considering 184/212 (removed 28) transitions.
// Phase 1: matrix 184 rows 157 cols
[2024-05-30 01:27:36] [INFO ] Computed 12 invariants in 2 ms
[2024-05-30 01:27:36] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 01:27:36] [INFO ] Invariant cache hit.
[2024-05-30 01:27:36] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-30 01:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-30 01:27:39] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-30 01:27:39] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2024-05-30 01:27:39] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-30 01:27:39] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2024-05-30 01:27:39] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 4 ms to minimize.
[2024-05-30 01:27:39] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 3 ms to minimize.
[2024-05-30 01:27:39] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-30 01:27:40] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-05-30 01:27:40] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-30 01:27:40] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:27:40] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/341 variables, 157/180 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 180 constraints, problems are : Problem set: 0 solved, 183 unsolved in 11831 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/341 variables, 157/180 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 183/363 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-30 01:27:52] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 364 constraints, problems are : Problem set: 0 solved, 183 unsolved in 11939 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 12/12 constraints]
After SMT, in 23798ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 23800ms
Starting structural reductions in LTL mode, iteration 1 : 157/184 places, 184/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24030 ms. Remains : 157/184 places, 184/212 transitions.
[2024-05-30 01:28:00] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:28:00] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:28:00] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-30 01:28:00] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:28:00] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:28:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11154615565245064006.gal : 3 ms
[2024-05-30 01:28:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality1716045191958321475.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/CTLCardinality11154615565245064006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1716045191958321475.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42547e+10,0.722227,17280,2,5863,5,67615,6,0,814,54823,0


Converting to forward existential form...Done !
original formula: E(AG(E((AF((p77==0)) * EX(((p89==0)||(p245==1)))) U ((AX((p107==0)) * EG((p79==1))) * ((p233==1)||(p124==0))))) U (A((p51==1) U (((A((p23...344
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U !(E((!(EG(!((p77==0)))) * EX(((p89==0)||(p245==1)))) U ((!(EX(!((p107==0)))) * EG((p79==...926
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t18, t68, t90, t92, t109, t157, Intersection with reachable at each step enab...208
(forward)formula 0,0,4.53052,119864,1,0,236,542301,393,159,4571,417685,385
FORMULA SmartHome-PT-10-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 01:28:05] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:28:05] [INFO ] Flatten gal took : 6 ms
Total runtime 258393 ms.

BK_STOP 1717032485153

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

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