fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r378-smll-171683811400401
Last Updated
July 7, 2024

About the Execution of ITS-Tools for SmartHome-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
958.067 268215.00 327098.00 745.70 FFFTFFFFFFFFTTTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 03:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 03:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 03:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717031793692

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 01:16:36] [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:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:16:36] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2024-05-30 01:16:36] [INFO ] Transformed 253 places.
[2024-05-30 01:16:36] [INFO ] Transformed 293 transitions.
[2024-05-30 01:16:36] [INFO ] Found NUPN structural information;
[2024-05-30 01:16:36] [INFO ] Parsed PT model containing 253 places and 293 transitions and 664 arcs in 485 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 29 places in 6 ms
Reduce places removed 29 places and 30 transitions.
FORMULA SmartHome-PT-09-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 263/263 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 219 transition count 263
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 41 place count 183 transition count 227
Iterating global reduction 1 with 36 rules applied. Total rules applied 77 place count 183 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 183 transition count 223
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 178 transition count 218
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 178 transition count 218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 175 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 175 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 174 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 174 transition count 214
Applied a total of 99 rules in 132 ms. Remains 174 /224 variables (removed 50) and now considering 214/263 (removed 49) transitions.
// Phase 1: matrix 214 rows 174 cols
[2024-05-30 01:16:37] [INFO ] Computed 5 invariants in 32 ms
[2024-05-30 01:16:37] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-30 01:16:37] [INFO ] Invariant cache hit.
[2024-05-30 01:16:37] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-30 01:16:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 3/174 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-30 01:16:41] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 33 ms to minimize.
[2024-05-30 01:16:41] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/388 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 181 constraints, problems are : Problem set: 0 solved, 213 unsolved in 13363 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 3/174 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/388 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 213/394 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-30 01:16:54] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 3 ms to minimize.
[2024-05-30 01:16:55] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/388 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 396 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14787 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 4/4 constraints]
After SMT, in 28328ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 28365ms
Starting structural reductions in LTL mode, iteration 1 : 174/224 places, 214/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29435 ms. Remains : 174/224 places, 214/263 transitions.
Support contains 76 out of 174 places after structural reductions.
[2024-05-30 01:17:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 01:17:06] [INFO ] Flatten gal took : 76 ms
FORMULA SmartHome-PT-09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:17:06] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:17:06] [INFO ] Input system was already deterministic with 214 transitions.
Support contains 64 out of 174 places (down from 76) after GAL structural reductions.
RANDOM walk for 40000 steps (247 resets) in 2024 ms. (19 steps per ms) remains 4/48 properties
BEST_FIRST walk for 40003 steps (39 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (40 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (42 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
[2024-05-30 01:17:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 93/167 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 69/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 68/304 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 57/361 variables, 29/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 22/383 variables, 16/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 4/387 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/388 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/388 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/388 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 179 constraints, problems are : Problem set: 0 solved, 4 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 01:17:08] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 10/74 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 93/167 variables, 74/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 69/236 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 68/304 variables, 32/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 57/361 variables, 29/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 22/383 variables, 16/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/387 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/387 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/388 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/388 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/388 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 184 constraints, problems are : Problem set: 0 solved, 4 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 969ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 244 ms.
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 214/214 transitions.
Graph (trivial) has 172 edges and 174 vertex of which 70 / 174 are part of one of the 6 SCC in 4 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (complete) has 173 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 107 transition count 77
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 53 rules applied. Total rules applied 99 place count 65 transition count 66
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 104 place count 60 transition count 66
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 104 place count 60 transition count 63
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 110 place count 57 transition count 63
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 124 place count 43 transition count 49
Iterating global reduction 3 with 14 rules applied. Total rules applied 138 place count 43 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 43 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 140 place count 43 transition count 46
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 142 place count 42 transition count 46
Graph (complete) has 82 edges and 42 vertex of which 36 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 143 place count 36 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 36 transition count 41
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 177 place count 20 transition count 24
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 28 edges and 20 vertex of which 15 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 11 rules applied. Total rules applied 188 place count 15 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 190 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 190 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 192 place count 14 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 193 place count 13 transition count 10
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 6 rules applied. Total rules applied 199 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 201 place count 8 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 201 place count 8 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 205 place count 6 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 206 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 206 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 208 place count 4 transition count 4
Applied a total of 208 rules in 63 ms. Remains 4 /174 variables (removed 170) and now considering 4/214 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 4/174 places, 4/214 transitions.
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
[2024-05-30 01:17:08] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:17:08] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:17:09] [INFO ] Input system was already deterministic with 214 transitions.
Computed a total of 47 stabilizing places and 46 stable transitions
Graph (complete) has 271 edges and 174 vertex of which 172 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 141 transition count 183
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 141 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 141 transition count 181
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 133 transition count 173
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 133 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 133 transition count 172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 129 transition count 168
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 129 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 126 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 126 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 125 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 125 transition count 164
Applied a total of 99 rules in 28 ms. Remains 125 /174 variables (removed 49) and now considering 164/214 (removed 50) transitions.
// Phase 1: matrix 164 rows 125 cols
[2024-05-30 01:17:09] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 01:17:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 01:17:09] [INFO ] Invariant cache hit.
[2024-05-30 01:17:09] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-30 01:17:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/289 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 128 constraints, problems are : Problem set: 0 solved, 163 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/289 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 163/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 291 constraints, problems are : Problem set: 0 solved, 163 unsolved in 6522 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 12607ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 12612ms
Starting structural reductions in LTL mode, iteration 1 : 125/174 places, 164/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12813 ms. Remains : 125/174 places, 164/214 transitions.
[2024-05-30 01:17:21] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:17:21] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:17:21] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-30 01:17:21] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:17:21] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:17:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality8333503952203988178.gal : 9 ms
[2024-05-30 01:17:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13140483700952617765.ctl : 4 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/CTLCardinality8333503952203988178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13140483700952617765.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.5003e+09,0.303102,8396,2,1194,5,20821,6,0,660,24517,0


Converting to forward existential form...Done !
original formula: AG(AF((EX(AF((p16==0))) * ((p95==0)||(p178==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EX(!(EG(!((p16==0))))) * ((p95==0)||(p178==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t61, t64, t81, t85, t104, t107, t119, t138, t141, t149, Intersection...242
(forward)formula 0,0,1.38306,31524,1,0,247,147305,356,164,3678,149167,388
FORMULA SmartHome-PT-09-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 141 transition count 183
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 141 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 141 transition count 181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 132 transition count 172
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 132 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 132 transition count 171
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 127 transition count 166
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 127 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 124 transition count 163
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 123 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 123 transition count 162
Applied a total of 103 rules in 28 ms. Remains 123 /174 variables (removed 51) and now considering 162/214 (removed 52) transitions.
// Phase 1: matrix 162 rows 123 cols
[2024-05-30 01:17:23] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 01:17:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 01:17:23] [INFO ] Invariant cache hit.
[2024-05-30 01:17:23] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 01:17:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6949 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 287 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 12817ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 12821ms
Starting structural reductions in LTL mode, iteration 1 : 123/174 places, 162/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13062 ms. Remains : 123/174 places, 162/214 transitions.
[2024-05-30 01:17:36] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:17:36] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:17:36] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 01:17:36] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:17:36] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:17:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1418995796730665843.gal : 5 ms
[2024-05-30 01:17:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17892686099812707616.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/CTLCardinality1418995796730665843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17892686099812707616.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.35834e+09,0.200486,8980,2,1329,5,24169,6,0,650,27315,0


Converting to forward existential form...Done !
original formula: AG(AX(E((p49!=1) U EX(TRUE))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E((p49!=1) U EX(TRUE))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t61, t64, t81, t84, t101, t104, t105, t117, t136, t139, t147, Inters...248
(forward)formula 0,0,1.2289,29160,1,0,215,121215,343,144,3617,138557,339
FORMULA SmartHome-PT-09-CTLCardinality-2024-01 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 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 142 transition count 184
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 142 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 142 transition count 182
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 133 transition count 173
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 133 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 133 transition count 172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 129 transition count 168
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 129 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 126 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 126 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 125 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 125 transition count 164
Applied a total of 99 rules in 16 ms. Remains 125 /174 variables (removed 49) and now considering 164/214 (removed 50) transitions.
// Phase 1: matrix 164 rows 125 cols
[2024-05-30 01:17:37] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:17:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-30 01:17:37] [INFO ] Invariant cache hit.
[2024-05-30 01:17:38] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-30 01:17:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/289 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 128 constraints, problems are : Problem set: 0 solved, 163 unsolved in 7133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/289 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 163/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 291 constraints, problems are : Problem set: 0 solved, 163 unsolved in 6499 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 13660ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 13663ms
Starting structural reductions in LTL mode, iteration 1 : 125/174 places, 164/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13913 ms. Remains : 125/174 places, 164/214 transitions.
[2024-05-30 01:17:51] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:17:51] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:17:51] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-30 01:17:51] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:17:51] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:17:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality8871533954243033519.gal : 3 ms
[2024-05-30 01:17:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality168113390710786086.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/CTLCardinality8871533954243033519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality168113390710786086.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.09425e+09,0.264759,11372,2,2012,5,33779,6,0,660,37720,0


Converting to forward existential form...Done !
original formula: EX(AG(((EG(((p76==0)&&(p128==1))) + EX((p87==0))) + AG((p223!=0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((EG(((p76==0)&&(p128==1))) + EX((p87==0))) + !(E(TRUE U !((p223!=0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t13, t30, t33, t62, t66, t83, t86, t104, t107, t119, t138, t141, t145, t149, I...253
(forward)formula 0,0,4.90708,128780,1,0,341,790049,358,203,3858,672684,504
FORMULA SmartHome-PT-09-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 142 transition count 184
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 142 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 142 transition count 182
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 133 transition count 173
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 133 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 133 transition count 172
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 88 place count 128 transition count 167
Iterating global reduction 3 with 5 rules applied. Total rules applied 93 place count 128 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 124 transition count 163
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 123 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 123 transition count 162
Applied a total of 103 rules in 17 ms. Remains 123 /174 variables (removed 51) and now considering 162/214 (removed 52) transitions.
// Phase 1: matrix 162 rows 123 cols
[2024-05-30 01:17:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:17:56] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 01:17:56] [INFO ] Invariant cache hit.
[2024-05-30 01:17:56] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 01:17:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 287 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5432 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 11587ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 11589ms
Starting structural reductions in LTL mode, iteration 1 : 123/174 places, 162/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11818 ms. Remains : 123/174 places, 162/214 transitions.
[2024-05-30 01:18:08] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:18:08] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:18:08] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 01:18:08] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:18:08] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:18:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality16137289983335298473.gal : 4 ms
[2024-05-30 01:18:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality15930398180535142488.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16137289983335298473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15930398180535142488.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3413e+09,0.144984,7668,2,1199,5,17978,6,0,650,20438,0


Converting to forward existential form...Done !
original formula: (AX(AF(AG(((p131==1) + AG(((p44==0)||(p27==1))))))) + AF(AX(FALSE)))
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(!(EG(!(!(E(TRUE U !(((p131==1) + !(E(TRUE U !(((p44==0)||(p27==1))))))))))))))))),!(!(EX(...176
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t10, t12, t29, t32, t61, t64, t81, t84, t101, t104, t116, t120, t136, t139, t147, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,16.5989,404384,1,0,509,1.47217e+06,359,370,4026,3.41777e+06,591
FORMULA SmartHome-PT-09-CTLCardinality-2024-04 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 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 146 transition count 188
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 146 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 146 transition count 186
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 64 place count 138 transition count 178
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 138 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 138 transition count 177
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 133 transition count 172
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 133 transition count 172
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 130 transition count 169
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 130 transition count 169
Applied a total of 89 rules in 20 ms. Remains 130 /174 variables (removed 44) and now considering 169/214 (removed 45) transitions.
// Phase 1: matrix 169 rows 130 cols
[2024-05-30 01:18:25] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:18:25] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 01:18:25] [INFO ] Invariant cache hit.
[2024-05-30 01:18:25] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-30 01:18:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/299 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/299 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 133 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/299 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 168/301 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 301 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 14215ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 14220ms
Starting structural reductions in LTL mode, iteration 1 : 130/174 places, 169/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14456 ms. Remains : 130/174 places, 169/214 transitions.
[2024-05-30 01:18:39] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:18:39] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:18:39] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-30 01:18:39] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:18:39] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:18:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality7052987889166206895.gal : 2 ms
[2024-05-30 01:18:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10364794481785101760.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/CTLCardinality7052987889166206895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10364794481785101760.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AG(((EX((p0==1)) + EF((p16==1))) + ((p225==0)||(p172==1)))) + AX((E(AX((p133==1)) U ((p124==1) * (((p188==1)&&(p29==0)) + EX(((p117==0)|...231
=> equivalent forward existential formula: [((EY((Init * !(!(E(TRUE U !(((EX((p0==1)) + E(TRUE U (p16==1))) + ((p225==0)||(p172==1))))))))) * !(E((p122!=0)...314
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t14, t31, t37, t66, t69, t89, t92, t109, t112, t124, t143, t146, t154, In...252
(forward)formula 0,0,5.02321,132684,1,0,404,852033,383,251,4011,747935,562
FORMULA SmartHome-PT-09-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 141 transition count 183
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 141 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 141 transition count 181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 132 transition count 172
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 132 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 132 transition count 171
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 127 transition count 166
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 127 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 123 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 122 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 122 transition count 161
Applied a total of 105 rules in 11 ms. Remains 122 /174 variables (removed 52) and now considering 161/214 (removed 53) transitions.
// Phase 1: matrix 161 rows 122 cols
[2024-05-30 01:18:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:18:45] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 01:18:45] [INFO ] Invariant cache hit.
[2024-05-30 01:18:45] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 01:18:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/283 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 125 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/283 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 160/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 285 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 12713ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 12715ms
Starting structural reductions in LTL mode, iteration 1 : 122/174 places, 161/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12885 ms. Remains : 122/174 places, 161/214 transitions.
[2024-05-30 01:18:57] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:18:57] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:18:57] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-30 01:18:57] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:18:57] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:18:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality7944155517750845170.gal : 3 ms
[2024-05-30 01:18:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality14941137842019102888.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/CTLCardinality7944155517750845170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14941137842019102888.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.25962e+09,0.213667,7660,2,1049,5,17298,6,0,645,20094,0


Converting to forward existential form...Done !
original formula: EX(EF(AG((p131==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((p131==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t61, t64, t81, t84, t101, t104, t116, t135, t138, t146, Intersection...242
(forward)formula 0,0,0.987724,24432,1,0,204,103511,344,138,3599,93192,332
FORMULA SmartHome-PT-09-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Graph (trivial) has 156 edges and 174 vertex of which 58 / 174 are part of one of the 5 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 203 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 37 place count 118 transition count 110
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 47 rules applied. Total rules applied 84 place count 83 transition count 98
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 93 place count 77 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 74 transition count 95
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 96 place count 74 transition count 90
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 69 transition count 90
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 119 place count 56 transition count 77
Iterating global reduction 4 with 13 rules applied. Total rules applied 132 place count 56 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 136 place count 56 transition count 73
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 138 place count 55 transition count 72
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 166 place count 41 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 167 place count 41 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 169 place count 40 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 178 place count 40 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 179 place count 39 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 179 place count 39 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 181 place count 38 transition count 46
Applied a total of 181 rules in 27 ms. Remains 38 /174 variables (removed 136) and now considering 46/214 (removed 168) transitions.
[2024-05-30 01:18:58] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 38 cols
[2024-05-30 01:18:58] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 01:18:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 01:18:59] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
[2024-05-30 01:18:59] [INFO ] Invariant cache hit.
[2024-05-30 01:18:59] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-30 01:18:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 37/174 places, 46/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 134 ms. Remains : 37/174 places, 46/214 transitions.
[2024-05-30 01:18:59] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:18:59] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:18:59] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-30 01:18:59] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:18:59] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:18:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality18008758355033356343.gal : 0 ms
[2024-05-30 01:18:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality509397908864400135.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/CTLCardinality18008758355033356343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality509397908864400135.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,21890,0.011993,3576,2,168,5,1024,6,0,184,1054,0


Converting to forward existential form...Done !
original formula: AG((AF(((p181==0)||(p13==1))) * ((A((p138==0) U (p108!=1)) + A((p189==1) U ((p66==0)||(p200==1)))) + ((p70==0) + AF((p229==0))))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(((p181==0)||(p13==1))))] = FALSE * [FwdG(((FwdU(Init,TRUE) * !((!((E(!((p108!=1)) U (!(...355
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t8, t9, t11, t13, t14, t19, t21, t40, t42, t43, Intersection with reachable at each ...216
Hit Full ! (commute/partial/dont) 42/4/4
(forward)formula 0,0,0.084554,6796,1,0,146,18183,142,79,1128,19902,167
FORMULA SmartHome-PT-09-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Graph (trivial) has 167 edges and 174 vertex of which 58 / 174 are part of one of the 5 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 202 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 118 transition count 99
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 59 rules applied. Total rules applied 107 place count 72 transition count 86
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 116 place count 65 transition count 84
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 118 place count 64 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 63 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 119 place count 63 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 131 place count 57 transition count 77
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 144 place count 44 transition count 64
Iterating global reduction 5 with 13 rules applied. Total rules applied 157 place count 44 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 160 place count 44 transition count 61
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 162 place count 43 transition count 60
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 190 place count 29 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 191 place count 29 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 193 place count 28 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 202 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 203 place count 27 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 203 place count 27 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 205 place count 26 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 206 place count 26 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 207 place count 26 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 208 place count 25 transition count 32
Applied a total of 208 rules in 39 ms. Remains 25 /174 variables (removed 149) and now considering 32/214 (removed 182) transitions.
[2024-05-30 01:18:59] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 25 cols
[2024-05-30 01:18:59] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 01:18:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 01:18:59] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-30 01:18:59] [INFO ] Invariant cache hit.
[2024-05-30 01:18:59] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-30 01:18:59] [INFO ] Redundant transitions in 41 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-30 01:18:59] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-30 01:18:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 26/48 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 4/52 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 27 constraints, problems are : Problem set: 0 solved, 19 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 26/48 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 4/52 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 46 constraints, problems are : Problem set: 0 solved, 19 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 793ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/174 places, 32/214 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 988 ms. Remains : 25/174 places, 32/214 transitions.
[2024-05-30 01:19:00] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:19:00] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:19:00] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-30 01:19:00] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:19:00] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:19:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13232113081910126439.gal : 1 ms
[2024-05-30 01:19:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality15291522536685960564.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/CTLCardinality13232113081910126439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15291522536685960564.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5760,0.010044,3496,2,57,5,438,6,0,119,407,0


Converting to forward existential form...Done !
original formula: EF(AG((((p185!=1)&&(p197!=0))&&(p3!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p185!=1)&&(p197!=0))&&(p3!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,0,0.027882,3812,1,0,63,2679,81,30,713,2170,69
FORMULA SmartHome-PT-09-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 141 transition count 183
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 141 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 141 transition count 181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 132 transition count 172
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 132 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 132 transition count 171
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 127 transition count 166
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 127 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 123 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 122 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 122 transition count 161
Applied a total of 105 rules in 25 ms. Remains 122 /174 variables (removed 52) and now considering 161/214 (removed 53) transitions.
// Phase 1: matrix 161 rows 122 cols
[2024-05-30 01:19:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:19:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 01:19:00] [INFO ] Invariant cache hit.
[2024-05-30 01:19:00] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 01:19:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/283 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 125 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5776 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/283 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 160/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 285 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 10166ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 10170ms
Starting structural reductions in LTL mode, iteration 1 : 122/174 places, 161/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10445 ms. Remains : 122/174 places, 161/214 transitions.
[2024-05-30 01:19:10] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:19:10] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:19:10] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-30 01:19:10] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:19:10] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:19:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality1000708991891612376.gal : 2 ms
[2024-05-30 01:19:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16138199766707478785.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/CTLCardinality1000708991891612376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16138199766707478785.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.25962e+09,0.212318,7660,2,1049,5,17298,6,0,645,20094,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t61, t64, t81, t84, t101, t104, t116, t135, t138, t146, Intersection...242
(forward)formula 0,0,0.962059,21456,1,0,205,85005,337,140,3495,87621,328
FORMULA SmartHome-PT-09-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 142 transition count 184
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 142 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 142 transition count 182
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 135 transition count 175
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 135 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 135 transition count 174
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 131 transition count 170
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 131 transition count 170
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 128 transition count 167
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 128 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 127 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 127 transition count 166
Applied a total of 95 rules in 13 ms. Remains 127 /174 variables (removed 47) and now considering 166/214 (removed 48) transitions.
// Phase 1: matrix 166 rows 127 cols
[2024-05-30 01:19:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:19:11] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 01:19:11] [INFO ] Invariant cache hit.
[2024-05-30 01:19:11] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-30 01:19:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 130 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 165/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 295 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4430 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 10020ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 10022ms
Starting structural reductions in LTL mode, iteration 1 : 127/174 places, 166/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10238 ms. Remains : 127/174 places, 166/214 transitions.
[2024-05-30 01:19:21] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:21] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:19:21] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-30 01:19:21] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:22] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:19:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality224391728827718660.gal : 3 ms
[2024-05-30 01:19:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4296428733187764119.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/CTLCardinality224391728827718660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4296428733187764119.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63456e+09,0.23641,7688,2,1186,5,18585,6,0,670,20646,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * AF(AG(((p118==0)&&(p125==0)))))
=> equivalent forward existential formula: ([(Init * !(EX(TRUE)))] = FALSE * [FwdG(Init,!(!(E(TRUE U !(((p118==0)&&(p125==0)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t61, t66, t86, t89, t106, t109, t121, t140, t143, t147, t151, Inters...248
(forward)formula 0,0,12.3619,324108,1,0,531,1.22376e+06,360,364,3846,2.67362e+06,577
FORMULA SmartHome-PT-09-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 173 transition count 214
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 145 transition count 186
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 145 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 145 transition count 184
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 138 transition count 177
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 138 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 134 transition count 173
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 134 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 131 transition count 170
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 131 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 130 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 130 transition count 169
Applied a total of 89 rules in 7 ms. Remains 130 /174 variables (removed 44) and now considering 169/214 (removed 45) transitions.
// Phase 1: matrix 169 rows 130 cols
[2024-05-30 01:19:34] [INFO ] Computed 4 invariants in 2 ms
[2024-05-30 01:19:34] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 01:19:34] [INFO ] Invariant cache hit.
[2024-05-30 01:19:34] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-30 01:19:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 2/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/299 variables, 130/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/299 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 134 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6640 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 2/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/299 variables, 130/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 168/302 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/299 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 302 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6714 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 13383ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 13385ms
Starting structural reductions in LTL mode, iteration 1 : 130/174 places, 169/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13567 ms. Remains : 130/174 places, 169/214 transitions.
[2024-05-30 01:19:48] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:19:48] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:48] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-30 01:19:48] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:19:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:19:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality3635505039196078102.gal : 2 ms
[2024-05-30 01:19:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality16204273255611307089.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/CTLCardinality3635505039196078102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16204273255611307089.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.8143e+09,0.281502,9024,2,1386,5,23611,6,0,682,27477,0


Converting to forward existential form...Done !
original formula: E(!(A(EX((p177==1)) U A(((p237==0)||(p148==1)) U (p18==1)))) U !(A(AX(AX((p94==1))) U ((p249==0)||(p94==1)))))
=> equivalent forward existential formula: ([(EY(EY((FwdU(FwdU(Init,!(!((E(!(!((E(!((p18==1)) U (!(((p237==0)||(p148==1))) * !((p18==1)))) + EG(!((p18==1))...795
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t29, t32, t64, t67, t84, t88, t108, t111, t123, t126, t143, t146, Intersection...242
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 165/4/4
(forward)formula 0,1,19.9403,489996,1,0,1171,2.88152e+06,386,739,4241,3.58571e+06,1403
FORMULA SmartHome-PT-09-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 214/214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 173 transition count 214
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 149 transition count 190
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 149 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 149 transition count 189
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 143 transition count 183
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 143 transition count 183
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 140 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 140 transition count 180
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 137 transition count 177
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 137 transition count 177
Applied a total of 74 rules in 6 ms. Remains 137 /174 variables (removed 37) and now considering 177/214 (removed 37) transitions.
// Phase 1: matrix 177 rows 137 cols
[2024-05-30 01:20:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-30 01:20:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 01:20:08] [INFO ] Invariant cache hit.
[2024-05-30 01:20:08] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 01:20:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 2/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/314 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 141 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7178 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 2/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/314 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 176/317 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 317 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6920 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 14121ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 14124ms
Starting structural reductions in LTL mode, iteration 1 : 137/174 places, 177/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14304 ms. Remains : 137/174 places, 177/214 transitions.
[2024-05-30 01:20:22] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:20:22] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:20:22] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-30 01:20:22] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:20:22] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:20:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality312587454501236441.gal : 1 ms
[2024-05-30 01:20:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4691127251127662698.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/CTLCardinality312587454501236441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4691127251127662698.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.42232e+09,0.182225,9068,2,1341,5,23745,6,0,718,26659,0


Converting to forward existential form...Done !
original formula: A((AF(EG((((p40==1)&&(p237==1)) * EF((p149==0))))) + (p149==1)) U AG((((AG((p216==1)) + !(AX((p70==1)))) + (EX((p202==0)) + AF((((p123==0...262
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((((!(E(TRUE U !((p216==1)))) + !(!(EX(!((p70==1)))))) + (EX((p202==0)) + !(EG(!(((...813
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t10, t12, t14, t31, t36, t70, t73, t91, t94, t113, t116, t128, t149, t152, t153, Int...251
(forward)formula 0,1,1.85635,58896,1,0,409,331575,403,256,4234,297662,576
FORMULA SmartHome-PT-09-CTLCardinality-2023-13 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 : 174/174 places, 214/214 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 214
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 148 transition count 190
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 148 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 148 transition count 188
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 141 transition count 181
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 141 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 141 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 70 place count 138 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 138 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 136 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 136 transition count 175
Applied a total of 77 rules in 6 ms. Remains 136 /174 variables (removed 38) and now considering 175/214 (removed 39) transitions.
// Phase 1: matrix 175 rows 136 cols
[2024-05-30 01:20:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:20:24] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 01:20:24] [INFO ] Invariant cache hit.
[2024-05-30 01:20:24] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-30 01:20:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/311 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/311 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 139 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/311 variables, 136/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 174/313 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 313 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 14446ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 14448ms
Starting structural reductions in LTL mode, iteration 1 : 136/174 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14615 ms. Remains : 136/174 places, 175/214 transitions.
[2024-05-30 01:20:39] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:20:39] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:20:39] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-30 01:20:39] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:20:39] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:20:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17869652587068612246.gal : 3 ms
[2024-05-30 01:20:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality16777789613502013423.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/CTLCardinality17869652587068612246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16777789613502013423.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.80653e+09,0.353069,10900,2,1799,5,32295,6,0,715,35781,0


Converting to forward existential form...Done !
original formula: (EF(EG(((p122==0)||(p22==1)))) + (AX(!(A(EF((p89==1)) U EG((p85==0))))) * AG((((p62==1) + !(A(((p128==0)||(p35==1)) U (p142==1)))) + ((p8...200
=> equivalent forward existential formula: ([((EY((Init * !(E(TRUE U EG(((p122==0)||(p22==1))))))) * !(EG(!(EG((p85==0)))))) * !(E(!(EG((p85==0))) U (!(E(T...434
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t10, t12, t29, t33, t62, t66, t83, t86, t88, t107, t114, t127, t130, t149, t152, t156...263
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,22.6174,567988,1,0,1270,3.48452e+06,403,700,4386,4.04473e+06,1507
FORMULA SmartHome-PT-09-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

BK_STOP 1717032061907

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

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