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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 03:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 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 63K 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-07-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-07-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717030898734

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 01:01:41] [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:01:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:01:41] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-30 01:01:41] [INFO ] Transformed 251 places.
[2024-05-30 01:01:41] [INFO ] Transformed 290 transitions.
[2024-05-30 01:01:41] [INFO ] Found NUPN structural information;
[2024-05-30 01:01:41] [INFO ] Parsed PT model containing 251 places and 290 transitions and 658 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Deduced a syphon composed of 29 places in 9 ms
Reduce places removed 29 places and 30 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SmartHome-PT-07-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 260/260 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 216 transition count 260
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 44 place count 178 transition count 222
Iterating global reduction 1 with 38 rules applied. Total rules applied 82 place count 178 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 178 transition count 219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 175 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 175 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 172 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 172 transition count 213
Applied a total of 97 rules in 131 ms. Remains 172 /222 variables (removed 50) and now considering 213/260 (removed 47) transitions.
// Phase 1: matrix 213 rows 172 cols
[2024-05-30 01:01:42] [INFO ] Computed 4 invariants in 32 ms
[2024-05-30 01:01:42] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-30 01:01:42] [INFO ] Invariant cache hit.
[2024-05-30 01:01:42] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-30 01:01:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 2/172 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/385 variables, 172/176 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/385 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 176 constraints, problems are : Problem set: 0 solved, 212 unsolved in 12201 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 2/172 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/385 variables, 172/176 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 212/388 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-30 01:02:00] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/385 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 389 constraints, problems are : Problem set: 0 solved, 212 unsolved in 13511 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 1/1 constraints]
After SMT, in 25903ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 25963ms
Starting structural reductions in LTL mode, iteration 1 : 172/222 places, 213/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26986 ms. Remains : 172/222 places, 213/260 transitions.
Support contains 55 out of 172 places after structural reductions.
[2024-05-30 01:02:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 01:02:09] [INFO ] Flatten gal took : 89 ms
[2024-05-30 01:02:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-07-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:02:09] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:02:09] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 45 out of 172 places (down from 55) after GAL structural reductions.
RANDOM walk for 40000 steps (236 resets) in 1701 ms. (23 steps per ms) remains 3/27 properties
BEST_FIRST walk for 40004 steps (40 resets) in 348 ms. (114 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (44 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (39 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2024-05-30 01:02:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/21 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/45 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 24/69 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/79 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 58/137 variables, 39/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 75/212 variables, 24/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 86/298 variables, 42/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/298 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/299 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/299 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/299 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 51/350 variables, 29/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/350 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 24/374 variables, 14/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/374 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 8/382 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/382 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 3/385 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/385 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/385 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 176 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/21 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/45 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/69 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/79 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 58/137 variables, 39/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 75/212 variables, 24/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/212 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 86/298 variables, 42/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/298 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/299 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/299 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/299 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 51/350 variables, 29/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/350 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 24/374 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/374 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 8/382 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/382 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 3/385 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/385 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/385 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 178 constraints, problems are : Problem set: 0 solved, 2 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 226 ms.
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 213/213 transitions.
Graph (trivial) has 171 edges and 172 vertex of which 78 / 172 are part of one of the 6 SCC in 5 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Graph (complete) has 155 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 99 transition count 73
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 45 rules applied. Total rules applied 84 place count 63 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 59 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 88 place count 59 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 53 transition count 58
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 111 place count 42 transition count 47
Iterating global reduction 3 with 11 rules applied. Total rules applied 122 place count 42 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 125 place count 42 transition count 44
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 161 place count 24 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 39 edges and 24 vertex of which 22 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 11 rules applied. Total rules applied 172 place count 22 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 22 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 21 transition count 14
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 9 rules applied. Total rules applied 183 place count 16 transition count 10
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 187 place count 12 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 187 place count 12 transition count 6
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 196 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 196 place count 7 transition count 5
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 198 place count 6 transition count 5
Applied a total of 198 rules in 84 ms. Remains 6 /172 variables (removed 166) and now considering 5/213 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 6/172 places, 5/213 transitions.
RANDOM walk for 8 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/2 properties
[2024-05-30 01:02:11] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:02:11] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:02:11] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 41 out of 172 places (down from 45) after GAL structural reductions.
Computed a total of 47 stabilizing places and 46 stable transitions
Graph (complete) has 266 edges and 172 vertex of which 171 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 149 transition count 190
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 149 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 149 transition count 188
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 140 transition count 179
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 140 transition count 179
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 133 transition count 172
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 133 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 133 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 131 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 131 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 130 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 130 transition count 168
Applied a total of 87 rules in 39 ms. Remains 130 /172 variables (removed 42) and now considering 168/213 (removed 45) transitions.
// Phase 1: matrix 168 rows 130 cols
[2024-05-30 01:02:11] [INFO ] Computed 4 invariants in 7 ms
[2024-05-30 01:02:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 01:02:11] [INFO ] Invariant cache hit.
[2024-05-30 01:02:11] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-30 01:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 2/130 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/298 variables, 130/134 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 134 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6803 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 2/130 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/298 variables, 130/134 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 167/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 301 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6095 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 12954ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 12962ms
Starting structural reductions in LTL mode, iteration 1 : 130/172 places, 168/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13237 ms. Remains : 130/172 places, 168/213 transitions.
[2024-05-30 01:02:24] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:02:24] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:02:24] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-30 01:02:24] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:02:24] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:02:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality5715818083207201480.gal : 6 ms
[2024-05-30 01:02:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality5884243645087249522.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/CTLCardinality5715818083207201480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5884243645087249522.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,3.69646e+09,0.267815,7632,2,1319,5,17477,6,0,682,18445,0


Converting to forward existential form...Done !
original formula: (AG(AF((((p154==1)||(p83==0))||((p199==1)&&(p85==0))))) + EX((((p126==0)&&(p223==1)) * EF(AX((p9==0))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EX((((p126==0)&&(p223==1)) * E(TRUE U !(EX(!((p9==0))))))))),TRUE),!((((p154==1)||(p83==0))...190
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t60, t64, t83, t86, t109, t121, t140, t143, t144, t150, Intersection ...241
Hit Full ! (commute/partial/dont) 161/8/7
(forward)formula 0,0,1.68422,40856,1,0,233,198734,371,157,4384,186149,370
FORMULA SmartHome-PT-07-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Graph (trivial) has 171 edges and 172 vertex of which 69 / 172 are part of one of the 6 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 184 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 107 transition count 87
Reduce places removed 44 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 55 rules applied. Total rules applied 101 place count 63 transition count 76
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 58 transition count 76
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 106 place count 58 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 116 place count 53 transition count 71
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 128 place count 41 transition count 59
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 41 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 143 place count 41 transition count 56
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 173 place count 26 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 174 place count 26 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 25 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 186 place count 25 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 188 place count 23 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 188 place count 23 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 190 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 21 transition count 27
Applied a total of 191 rules in 19 ms. Remains 21 /172 variables (removed 151) and now considering 27/213 (removed 186) transitions.
[2024-05-30 01:02:26] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 21 cols
[2024-05-30 01:02:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 01:02:26] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:02:26] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2024-05-30 01:02:26] [INFO ] Invariant cache hit.
[2024-05-30 01:02:26] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-30 01:02:26] [INFO ] Redundant transitions in 30 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 01:02:26] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
[2024-05-30 01:02:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/43 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 176 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 20/39 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/42 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 213 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 399ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 400ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/172 places, 27/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 528 ms. Remains : 21/172 places, 27/213 transitions.
[2024-05-30 01:02:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:02:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:02:27] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-30 01:02:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:02:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:02:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality567678846636326241.gal : 1 ms
[2024-05-30 01:02:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1741052208302143898.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/CTLCardinality567678846636326241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1741052208302143898.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,1792,0.008878,3452,2,43,5,258,6,0,96,213,0


Converting to forward existential form...Done !
original formula: AG(EF((p32==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p32==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t22, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
(forward)formula 0,0,0.022553,3768,1,0,49,1901,69,26,540,1565,58
FORMULA SmartHome-PT-07-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 213
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 144 transition count 186
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 144 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 144 transition count 183
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 69 place count 133 transition count 172
Iterating global reduction 2 with 11 rules applied. Total rules applied 80 place count 133 transition count 172
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 124 transition count 163
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 124 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 124 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 122 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 122 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 121 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 121 transition count 159
Applied a total of 105 rules in 14 ms. Remains 121 /172 variables (removed 51) and now considering 159/213 (removed 54) transitions.
// Phase 1: matrix 159 rows 121 cols
[2024-05-30 01:02:27] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 01:02:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-30 01:02:27] [INFO ] Invariant cache hit.
[2024-05-30 01:02:27] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-30 01:02:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/280 variables, 121/124 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 124 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4706 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/280 variables, 121/124 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 158/282 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 282 constraints, problems are : Problem set: 0 solved, 158 unsolved in 5519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints]
After SMT, in 10268ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 10270ms
Starting structural reductions in LTL mode, iteration 1 : 121/172 places, 159/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10501 ms. Remains : 121/172 places, 159/213 transitions.
[2024-05-30 01:02:37] [INFO ] Flatten gal took : 21 ms
[2024-05-30 01:02:37] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:02:37] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-30 01:02:37] [INFO ] Flatten gal took : 39 ms
[2024-05-30 01:02:37] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:02:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality565430081437803059.gal : 6 ms
[2024-05-30 01:02:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9957344318396410793.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/CTLCardinality565430081437803059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9957344318396410793.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.20321e+09,0.258251,8436,2,1274,5,21208,6,0,639,23126,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(AX((p38==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(!(EX(!((p38==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t82, t99, t102, t114, t133, t136, t142, Intersection with ...236
(forward)formula 0,1,3.3569,74556,1,0,255,464150,340,166,3640,349197,397
FORMULA SmartHome-PT-07-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 213
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 148 transition count 190
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 148 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 148 transition count 187
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 140 transition count 179
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 140 transition count 179
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 133 transition count 172
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 133 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 81 place count 133 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 132 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 132 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 131 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 131 transition count 169
Applied a total of 85 rules in 17 ms. Remains 131 /172 variables (removed 41) and now considering 169/213 (removed 44) transitions.
// Phase 1: matrix 169 rows 131 cols
[2024-05-30 01:02:41] [INFO ] Computed 3 invariants in 0 ms
[2024-05-30 01:02:41] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 01:02:41] [INFO ] Invariant cache hit.
[2024-05-30 01:02:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-30 01:02:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/300 variables, 131/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 134 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7276 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 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/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/300 variables, 131/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 168/302 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 302 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6827 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 14140ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 14142ms
Starting structural reductions in LTL mode, iteration 1 : 131/172 places, 169/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14326 ms. Remains : 131/172 places, 169/213 transitions.
[2024-05-30 01:02:55] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:02:55] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:02:55] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-30 01:02:55] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:02:55] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:02:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality16927990191285873491.gal : 5 ms
[2024-05-30 01:02:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality2342227105513415993.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/CTLCardinality16927990191285873491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2342227105513415993.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(E((EX((p99==0)) * (((p19==0) + AF(((p208==0)||(p73==1)))) + (EF((p33==1)) * (p93==1)))) U !(((p62==0)||(p117==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E((EX((p99==0)) * (((p19==0) + !(EG(!(((p208==0)||(p73==1)))))) + (E(TRUE U (p33==1)) * (p93==1))...196
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t81, t84, t102, t105, t108, t120, t123, t143, t146, t152, Inter...249
(forward)formula 0,1,4.12953,110124,1,0,374,668816,375,247,4043,697142,515
FORMULA SmartHome-PT-07-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 213
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 148 transition count 190
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 148 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 148 transition count 187
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 140 transition count 179
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 140 transition count 179
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 135 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 135 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 134 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 134 transition count 173
Applied a total of 78 rules in 11 ms. Remains 134 /172 variables (removed 38) and now considering 173/213 (removed 40) transitions.
// Phase 1: matrix 173 rows 134 cols
[2024-05-30 01:02:59] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:02:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 01:02:59] [INFO ] Invariant cache hit.
[2024-05-30 01:02:59] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-30 01:02:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/307 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/307 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 137 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/307 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 172/309 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 309 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
After SMT, in 14124ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 14127ms
Starting structural reductions in LTL mode, iteration 1 : 134/172 places, 173/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14373 ms. Remains : 134/172 places, 173/213 transitions.
[2024-05-30 01:03:14] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:03:14] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:03:14] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-30 01:03:14] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:03:14] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:03:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12426379567043355467.gal : 3 ms
[2024-05-30 01:03:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality17855761168869990483.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/CTLCardinality12426379567043355467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17855761168869990483.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.01757e+09,0.249494,7992,2,1498,5,19702,6,0,705,21731,0


Converting to forward existential form...Done !
original formula: (EG((p16==0)) * EF((((((p64==1) * EX(TRUE)) * (A((p236==1) U (p207==0)) * AX(FALSE))) * ((EX(((p26==0)&&(p31==1))) * AF(((p150==0)&&(p140...214
=> equivalent forward existential formula: [(((((FwdU((Init * EG((p16==0))),TRUE) * ((p91==0)&&(p165==1))) * (((p64==1) * EX(TRUE)) * (!((E(!((p207==0)) U ...325
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t28, t32, t65, t71, t88, t91, t108, t112, t114, t126, t129, t147, t150, t156, Inter...249
(forward)formula 0,0,8.28705,230268,1,0,681,1.36644e+06,382,382,3920,1.66023e+06,843
FORMULA SmartHome-PT-07-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 213
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 145 transition count 187
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 145 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 145 transition count 185
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 66 place count 134 transition count 174
Iterating global reduction 2 with 11 rules applied. Total rules applied 77 place count 134 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 86 place count 125 transition count 165
Iterating global reduction 2 with 9 rules applied. Total rules applied 95 place count 125 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 125 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 123 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 122 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 122 transition count 161
Applied a total of 102 rules in 10 ms. Remains 122 /172 variables (removed 50) and now considering 161/213 (removed 52) transitions.
// Phase 1: matrix 161 rows 122 cols
[2024-05-30 01:03:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:03:22] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 01:03:22] [INFO ] Invariant cache hit.
[2024-05-30 01:03:22] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 01:03:22] [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 4335 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 5900 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 10267ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 10269ms
Starting structural reductions in LTL mode, iteration 1 : 122/172 places, 161/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10445 ms. Remains : 122/172 places, 161/213 transitions.
[2024-05-30 01:03:33] [INFO ] Flatten gal took : 20 ms
[2024-05-30 01:03:33] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:03:33] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-30 01:03:33] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:03:33] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:03:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3910945344586277530.gal : 2 ms
[2024-05-30 01:03:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality5119395403487411253.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/CTLCardinality3910945344586277530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5119395403487411253.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,1.80464e+09,0.291036,8980,2,1305,5,22951,6,0,645,26745,0


Converting to forward existential form...Done !
original formula: EG(EF((AX(FALSE) * EG((p8!=1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(EX(!(FALSE))) * EG((p8!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t82, t99, t102, t114, t133, t136, t137, t143, Intersection...242
(forward)formula 0,1,7.83282,188872,1,0,567,1.17676e+06,351,327,3988,1.18286e+06,731
FORMULA SmartHome-PT-07-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 213
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 149 transition count 191
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 149 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 149 transition count 188
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 139 transition count 178
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 139 transition count 178
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 131 transition count 170
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 131 transition count 170
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 131 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 129 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 129 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 128 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 128 transition count 166
Applied a total of 91 rules in 14 ms. Remains 128 /172 variables (removed 44) and now considering 166/213 (removed 47) transitions.
// Phase 1: matrix 166 rows 128 cols
[2024-05-30 01:03:41] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:03:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 01:03:41] [INFO ] Invariant cache hit.
[2024-05-30 01:03:41] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-30 01:03:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/294 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 131 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 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/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/294 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 165/296 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 296 constraints, problems are : Problem set: 0 solved, 165 unsolved in 6707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 13732ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 13734ms
Starting structural reductions in LTL mode, iteration 1 : 128/172 places, 166/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13949 ms. Remains : 128/172 places, 166/213 transitions.
[2024-05-30 01:03:54] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:03:54] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:03:54] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-30 01:03:54] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:03:54] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:03:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality4750270057343444920.gal : 2 ms
[2024-05-30 01:03:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality12429691660046575284.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/CTLCardinality4750270057343444920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12429691660046575284.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.44703e+09,0.173602,8740,2,1467,5,21779,6,0,674,25712,0


Converting to forward existential form...Done !
original formula: E(A(EX(EF(!(((p44==0)||(p75==1))))) U (p146==1)) U (!((AG(EX(TRUE)) + A((p72==0) U (((p199==1)||(p80==1))&&(p222==0))))) + !(EF((p175==1)...159
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!((E(!((p146==1)) U (!(EX(E(TRUE U !(((p44==0)||(p75==1)))))) * !((p146==1)))) + EG(!((p146==...497
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t10, t27, t30, t60, t63, t80, t84, t101, t104, t106, t109, t120, t124, t140, t143, t1...259
(forward)formula 0,1,15.7359,440236,1,0,1262,2.85209e+06,377,690,4166,2.9872e+06,1464
FORMULA SmartHome-PT-07-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 213
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 145 transition count 187
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 145 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 145 transition count 184
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 66 place count 135 transition count 174
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 135 transition count 174
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 127 transition count 166
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 127 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 127 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 125 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 125 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 124 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 124 transition count 162
Applied a total of 99 rules in 10 ms. Remains 124 /172 variables (removed 48) and now considering 162/213 (removed 51) transitions.
// Phase 1: matrix 162 rows 124 cols
[2024-05-30 01:04:10] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:04:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 01:04:10] [INFO ] Invariant cache hit.
[2024-05-30 01:04:11] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 01:04:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 127 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6986 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 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/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 161/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 288 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 13032ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 13035ms
Starting structural reductions in LTL mode, iteration 1 : 124/172 places, 162/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13295 ms. Remains : 124/172 places, 162/213 transitions.
[2024-05-30 01:04:24] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:04:24] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:04:24] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 01:04:24] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:04:24] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:04:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality5724233048188205455.gal : 2 ms
[2024-05-30 01:04:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality2436465862788390163.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/CTLCardinality5724233048188205455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2436465862788390163.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,1.43863e+09,0.242475,8456,2,1345,5,21838,6,0,654,24717,0


Converting to forward existential form...Done !
original formula: EX(AG(((p97==0)||(p79==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p97==0)||(p79==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t83, t100, t105, t117, t136, t139, t145, Intersection with...237
(forward)formula 0,0,1.40228,34264,1,0,218,167516,346,149,3740,152339,353
FORMULA SmartHome-PT-07-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 213/213 transitions.
Graph (trivial) has 168 edges and 172 vertex of which 67 / 172 are part of one of the 6 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Graph (complete) has 187 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 109 transition count 91
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 97 place count 66 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 62 transition count 82
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 101 place count 62 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 111 place count 57 transition count 77
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 124 place count 44 transition count 64
Iterating global reduction 3 with 13 rules applied. Total rules applied 137 place count 44 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 3 with 5 rules applied. Total rules applied 142 place count 44 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 143 place count 43 transition count 59
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 173 place count 28 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 28 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 27 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 186 place count 27 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 188 place count 25 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 188 place count 25 transition count 31
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 190 place count 24 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 23 transition count 30
Applied a total of 191 rules in 22 ms. Remains 23 /172 variables (removed 149) and now considering 30/213 (removed 183) transitions.
[2024-05-30 01:04:25] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-30 01:04:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 01:04:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 01:04:25] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2024-05-30 01:04:25] [INFO ] Invariant cache hit.
[2024-05-30 01:04:25] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-30 01:04:25] [INFO ] Redundant transitions in 28 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-30 01:04:25] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2024-05-30 01:04:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 23/44 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/47 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/48 variables, and 24 constraints, problems are : Problem set: 0 solved, 15 unsolved in 183 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 23/44 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3/47 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/48 variables, and 39 constraints, problems are : Problem set: 0 solved, 15 unsolved in 189 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 387ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/172 places, 30/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 516 ms. Remains : 23/172 places, 30/213 transitions.
[2024-05-30 01:04:26] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:04:26] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:04:26] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-30 01:04:26] [INFO ] Flatten gal took : 0 ms
[2024-05-30 01:04:26] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:04:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality22852496814133956.gal : 0 ms
[2024-05-30 01:04:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality1623138520185913141.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/CTLCardinality22852496814133956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1623138520185913141.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 -...281
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,3584,0.00596,3472,2,52,5,297,6,0,108,236,0


Converting to forward existential form...Done !
original formula: EF(AG((EG((p65==1)) * (p205==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EG((p65==1)) * (p205==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t14, t25, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,0,0.022166,3788,1,0,63,3026,82,35,632,2823,80
FORMULA SmartHome-PT-07-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 01:04:26] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:04:26] [INFO ] Flatten gal took : 10 ms
Total runtime 165030 ms.

BK_STOP 1717031066267

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

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