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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 03:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 03:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 90K 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-12-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-12-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717033129903

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 01:38:52] [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:38:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:38:52] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-30 01:38:52] [INFO ] Transformed 376 places.
[2024-05-30 01:38:52] [INFO ] Transformed 399 transitions.
[2024-05-30 01:38:52] [INFO ] Found NUPN structural information;
[2024-05-30 01:38:52] [INFO ] Parsed PT model containing 376 places and 399 transitions and 909 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 104 places in 5 ms
Reduce places removed 104 places and 80 transitions.
FORMULA SmartHome-PT-12-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 319/319 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 265 transition count 319
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 63 place count 209 transition count 263
Iterating global reduction 1 with 56 rules applied. Total rules applied 119 place count 209 transition count 263
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 127 place count 209 transition count 255
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 135 place count 201 transition count 247
Iterating global reduction 2 with 8 rules applied. Total rules applied 143 place count 201 transition count 247
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 194 transition count 240
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 194 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 194 transition count 239
Applied a total of 158 rules in 96 ms. Remains 194 /272 variables (removed 78) and now considering 239/319 (removed 80) transitions.
// Phase 1: matrix 239 rows 194 cols
[2024-05-30 01:38:53] [INFO ] Computed 6 invariants in 22 ms
[2024-05-30 01:38:53] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-30 01:38:53] [INFO ] Invariant cache hit.
[2024-05-30 01:38:53] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-30 01:38:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 4/194 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-30 01:38:57] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/433 variables, 194/201 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/433 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 201 constraints, problems are : Problem set: 0 solved, 238 unsolved in 15709 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 4/194 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/433 variables, 194/201 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 238/439 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/433 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 439 constraints, problems are : Problem set: 0 solved, 238 unsolved in 12245 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
After SMT, in 28095ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 28130ms
Starting structural reductions in LTL mode, iteration 1 : 194/272 places, 239/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28919 ms. Remains : 194/272 places, 239/319 transitions.
Support contains 42 out of 194 places after structural reductions.
[2024-05-30 01:39:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-30 01:39:22] [INFO ] Flatten gal took : 86 ms
[2024-05-30 01:39:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-12-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:39:22] [INFO ] Flatten gal took : 36 ms
[2024-05-30 01:39:22] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 33 out of 194 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (224 resets) in 2018 ms. (19 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40004 steps (36 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
[2024-05-30 01:39:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/54 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/121 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/214 variables, 25/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 99/313 variables, 47/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 71/384 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 33/417 variables, 18/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/429 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/433 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/433 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/54 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/121 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 93/214 variables, 25/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 99/313 variables, 47/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 71/384 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 33/417 variables, 18/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/429 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/429 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/433 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/433 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 822ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 239/239 transitions.
Graph (trivial) has 190 edges and 194 vertex of which 88 / 194 are part of one of the 7 SCC in 3 ms
Free SCC test removed 81 places
Drop transitions (Empty/Sink Transition effects.) removed 116 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 117 transitions.
Graph (complete) has 163 edges and 113 vertex of which 95 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 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 53 rules applied. Total rules applied 55 place count 95 transition count 57
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 51 transition count 44
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 45 transition count 44
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 118 place count 45 transition count 39
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 128 place count 40 transition count 39
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 36 transition count 35
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 36 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 35 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 35 transition count 34
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 162 place count 23 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 34 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 6 rules applied. Total rules applied 168 place count 20 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 168 place count 20 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 19 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 18 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 174 place count 16 transition count 12
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 15 transition count 12
Applied a total of 176 rules in 62 ms. Remains 15 /194 variables (removed 179) and now considering 12/239 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 15/194 places, 12/239 transitions.
RANDOM walk for 142 steps (0 resets) in 7 ms. (17 steps per ms) remains 0/1 properties
[2024-05-30 01:39:24] [INFO ] Flatten gal took : 34 ms
[2024-05-30 01:39:24] [INFO ] Flatten gal took : 31 ms
[2024-05-30 01:39:24] [INFO ] Input system was already deterministic with 239 transitions.
Computed a total of 52 stabilizing places and 49 stable transitions
Graph (complete) has 293 edges and 194 vertex of which 191 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.20 ms
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 239
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 17 place count 177 transition count 225
Iterating global reduction 1 with 14 rules applied. Total rules applied 31 place count 177 transition count 225
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 168 transition count 216
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 168 transition count 216
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 161 transition count 209
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 161 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 161 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 159 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 159 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 158 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 158 transition count 205
Applied a total of 70 rules in 65 ms. Remains 158 /194 variables (removed 36) and now considering 205/239 (removed 34) transitions.
// Phase 1: matrix 205 rows 158 cols
[2024-05-30 01:39:24] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 01:39:24] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 01:39:24] [INFO ] Invariant cache hit.
[2024-05-30 01:39:25] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-30 01:39:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/363 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 161 constraints, problems are : Problem set: 0 solved, 204 unsolved in 8658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/363 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 204/365 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 365 constraints, problems are : Problem set: 0 solved, 204 unsolved in 8791 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 17503ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 17508ms
Starting structural reductions in LTL mode, iteration 1 : 158/194 places, 205/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17991 ms. Remains : 158/194 places, 205/239 transitions.
[2024-05-30 01:39:42] [INFO ] Flatten gal took : 24 ms
[2024-05-30 01:39:42] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:39:42] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-30 01:39:42] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:39:42] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:39:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16017415576077552283.gal : 8 ms
[2024-05-30 01:39:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14754250143745131560.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16017415576077552283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14754250143745131560.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.5137e+11,0.421753,10468,2,2192,5,31043,6,0,832,32809,0


Converting to forward existential form...Done !
original formula: A(EX((p46==1)) U A(!(((p82==0)||(p120==1))) U ((EX((p47!=1)) * E((p225==0) U ((p89==0)||(p49==1)))) * (E(((p304==0)||(p40==1)) U (p39==1)...185
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((EX((p47!=1)) * E((p225==0) U ((p89==0)||(p49==1)))) * (E(((p304==0)||(p40==1)) U (p39=...1361
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t60, t92, t96, t115, t122, t139, t142, t155, t158, t177, t180, t183, t...266
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,22.0364,600820,1,0,743,3.26483e+06,447,503,4868,4.94227e+06,866
FORMULA SmartHome-PT-12-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Graph (trivial) has 189 edges and 194 vertex of which 81 / 194 are part of one of the 7 SCC in 1 ms
Free SCC test removed 74 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Graph (complete) has 194 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 116 transition count 93
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 63 rules applied. Total rules applied 114 place count 67 transition count 79
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 60 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 58 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 125 place count 58 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 56 transition count 75
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 137 place count 48 transition count 67
Iterating global reduction 4 with 8 rules applied. Total rules applied 145 place count 48 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 48 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 148 place count 47 transition count 65
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 184 place count 29 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 196 place count 29 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 198 place count 27 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 198 place count 27 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 200 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 201 place count 25 transition count 33
Applied a total of 201 rules in 27 ms. Remains 25 /194 variables (removed 169) and now considering 33/239 (removed 206) transitions.
[2024-05-30 01:40:04] [INFO ] Flow matrix only has 27 transitions (discarded 6 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-05-30 01:40:04] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:40:05] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:40:05] [INFO ] Flow matrix only has 27 transitions (discarded 6 similar events)
[2024-05-30 01:40:05] [INFO ] Invariant cache hit.
[2024-05-30 01:40:05] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-30 01:40:05] [INFO ] Redundant transitions in 29 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-30 01:40:05] [INFO ] Flow matrix only has 27 transitions (discarded 6 similar events)
[2024-05-30 01:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 24/46 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/52 variables, and 24 constraints, problems are : Problem set: 0 solved, 16 unsolved in 292 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/25 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 24/46 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/47 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/48 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/49 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/49 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/52 variables, and 41 constraints, problems are : Problem set: 0 solved, 16 unsolved in 454 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/25 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 754ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 755ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/194 places, 33/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 903 ms. Remains : 25/194 places, 33/239 transitions.
[2024-05-30 01:40:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:40:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:40:05] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-30 01:40:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:40:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:40:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality15354023471068292965.gal : 2 ms
[2024-05-30 01:40:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality962798743774557174.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/CTLCardinality15354023471068292965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality962798743774557174.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,35712,0.011663,3492,2,91,5,435,6,0,116,408,0


Converting to forward existential form...Done !
original formula: EF(AG((EG((p85!=1)) + ((p94==0) * AF((p153==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EG((p85!=1)) + ((p94==0) * !(EG(!((p153==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t15, t21, t23, t26, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,1,0.167545,7504,1,0,190,23785,93,105,695,33381,214
FORMULA SmartHome-PT-12-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 239
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 171 transition count 218
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 171 transition count 218
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 160 transition count 207
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 160 transition count 207
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 75 place count 151 transition count 198
Iterating global reduction 1 with 9 rules applied. Total rules applied 84 place count 151 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 151 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 148 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 148 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 147 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 147 transition count 193
Applied a total of 93 rules in 33 ms. Remains 147 /194 variables (removed 47) and now considering 193/239 (removed 46) transitions.
// Phase 1: matrix 193 rows 147 cols
[2024-05-30 01:40:06] [INFO ] Computed 4 invariants in 3 ms
[2024-05-30 01:40:06] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 01:40:06] [INFO ] Invariant cache hit.
[2024-05-30 01:40:06] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:40:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 2/147 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/340 variables, 147/151 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-30 01:40:10] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 152 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11052 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 2/147 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 193/340 variables, 147/152 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 192/344 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 344 constraints, problems are : Problem set: 0 solved, 192 unsolved in 6646 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 1/1 constraints]
After SMT, in 17751ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 17756ms
Starting structural reductions in LTL mode, iteration 1 : 147/194 places, 193/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18062 ms. Remains : 147/194 places, 193/239 transitions.
[2024-05-30 01:40:24] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:40:24] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:40:24] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:40:24] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:40:24] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:40:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality264295469504250641.gal : 7 ms
[2024-05-30 01:40:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality1437876207027457315.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/CTLCardinality264295469504250641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1437876207027457315.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.88956e+11,0.41751,11268,2,2171,5,34554,6,0,774,35661,0


Converting to forward existential form...Done !
original formula: EF(!(E(AX((p89==0)) U AF((p135==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX(!((p89==0)))) U !(EG(!((p135==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t114, t131, t134, t146, t165, t168, t171, t173, t177, Inte...250
(forward)formula 0,1,7.99729,211820,1,0,601,1.25315e+06,414,353,4296,1.41755e+06,780
FORMULA SmartHome-PT-12-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 171 transition count 219
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 171 transition count 219
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 160 transition count 208
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 160 transition count 208
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 151 transition count 199
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 151 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 151 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 148 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 148 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 147 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 147 transition count 194
Applied a total of 92 rules in 10 ms. Remains 147 /194 variables (removed 47) and now considering 194/239 (removed 45) transitions.
// Phase 1: matrix 194 rows 147 cols
[2024-05-30 01:40:32] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:40:32] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 01:40:32] [INFO ] Invariant cache hit.
[2024-05-30 01:40:32] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-30 01:40:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 193/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 6230 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 15282ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 15288ms
Starting structural reductions in LTL mode, iteration 1 : 147/194 places, 194/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15545 ms. Remains : 147/194 places, 194/239 transitions.
[2024-05-30 01:40:47] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:40:47] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:40:47] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-30 01:40:47] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:40:47] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:40:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3083702053907412864.gal : 3 ms
[2024-05-30 01:40:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality3204531252468442417.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/CTLCardinality3083702053907412864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3204531252468442417.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.01552e+11,0.392973,11264,2,2153,5,34660,6,0,777,37277,0


Converting to forward existential form...Done !
original formula: EF(AX(AG((p105==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((p105==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t132, t135, t147, t166, t169, t172, t174, t178,...256
(forward)formula 0,1,2.57015,60916,1,0,248,319529,410,176,4433,285529,418
FORMULA SmartHome-PT-12-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 239
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 173 transition count 221
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 173 transition count 221
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 165 transition count 213
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 165 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 160 transition count 208
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 160 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 160 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 159 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 159 transition count 206
Applied a total of 68 rules in 11 ms. Remains 159 /194 variables (removed 35) and now considering 206/239 (removed 33) transitions.
// Phase 1: matrix 206 rows 159 cols
[2024-05-30 01:40:50] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 01:40:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 01:40:50] [INFO ] Invariant cache hit.
[2024-05-30 01:40:50] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-30 01:40:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/365 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 162 constraints, problems are : Problem set: 0 solved, 205 unsolved in 8282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/365 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 205/367 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 367 constraints, problems are : Problem set: 0 solved, 205 unsolved in 8965 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 17274ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 17278ms
Starting structural reductions in LTL mode, iteration 1 : 159/194 places, 206/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17497 ms. Remains : 159/194 places, 206/239 transitions.
[2024-05-30 01:41:07] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:41:08] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:41:08] [INFO ] Input system was already deterministic with 206 transitions.
[2024-05-30 01:41:08] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:41:08] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:41:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13328651416056710727.gal : 2 ms
[2024-05-30 01:41:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6164399194918287364.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/CTLCardinality13328651416056710727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6164399194918287364.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.83823e+11,0.371025,12120,2,2438,5,39851,6,0,837,41939,0


Converting to forward existential form...Done !
original formula: EF((AX((((p208==1)||(p70==0))||(((p264==0)&&(p84==1))&&((p139==0)&&(p51==1))))) * AX(FALSE)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!((((p208==1)||(p70==0))||(((p264==0)&&(p84==1))&&((p139==0)&&(p51==1)))))))) * !(EX(!...175
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t30, t33, t62, t98, t101, t119, t122, t139, t142, t143, t145, t158, t178, t181, t184...269
(forward)formula 0,1,2.3433,59900,1,0,261,283437,429,184,4487,294398,423
FORMULA SmartHome-PT-12-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 239
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 170 transition count 218
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 170 transition count 218
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 159 transition count 207
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 159 transition count 207
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 150 transition count 198
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 150 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 150 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 147 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 147 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 146 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 146 transition count 193
Applied a total of 94 rules in 10 ms. Remains 146 /194 variables (removed 48) and now considering 193/239 (removed 46) transitions.
// Phase 1: matrix 193 rows 146 cols
[2024-05-30 01:41:10] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:41:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 01:41:10] [INFO ] Invariant cache hit.
[2024-05-30 01:41:10] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:41:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 9061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 341 constraints, problems are : Problem set: 0 solved, 192 unsolved in 8357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 17446ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 17449ms
Starting structural reductions in LTL mode, iteration 1 : 146/194 places, 193/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17662 ms. Remains : 146/194 places, 193/239 transitions.
[2024-05-30 01:41:28] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:41:28] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:41:28] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:41:28] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:41:28] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:41:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality10843712659375277393.gal : 3 ms
[2024-05-30 01:41:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality13999275900267650162.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/CTLCardinality10843712659375277393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13999275900267650162.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88956e+11,0.325303,11264,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
(forward)formula 0,0,1.65701,46316,1,0,237,205318,401,167,4147,207337,392
FORMULA SmartHome-PT-12-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 239
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 170 transition count 218
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 170 transition count 218
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 159 transition count 207
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 159 transition count 207
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 150 transition count 198
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 150 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 150 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 147 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 147 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 146 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 146 transition count 193
Applied a total of 94 rules in 9 ms. Remains 146 /194 variables (removed 48) and now considering 193/239 (removed 46) transitions.
[2024-05-30 01:41:29] [INFO ] Invariant cache hit.
[2024-05-30 01:41:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 01:41:29] [INFO ] Invariant cache hit.
[2024-05-30 01:41:30] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:41:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 9212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 341 constraints, problems are : Problem set: 0 solved, 192 unsolved in 8384 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 17616ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 17618ms
Starting structural reductions in LTL mode, iteration 1 : 146/194 places, 193/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17808 ms. Remains : 146/194 places, 193/239 transitions.
[2024-05-30 01:41:47] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:41:47] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:41:47] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:41:47] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:41:47] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:41:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality9735827750012240622.gal : 2 ms
[2024-05-30 01:41:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10057567619597535782.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/CTLCardinality9735827750012240622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10057567619597535782.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.88956e+11,0.396716,11264,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: EG(AG(AX((p329==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EX(!((p329==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
(forward)formula 0,0,2.00759,50816,1,0,252,242108,414,174,4522,224858,414
FORMULA SmartHome-PT-12-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 239
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 170 transition count 218
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 170 transition count 218
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 159 transition count 207
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 159 transition count 207
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 150 transition count 198
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 150 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 150 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 147 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 147 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 146 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 146 transition count 193
Applied a total of 94 rules in 8 ms. Remains 146 /194 variables (removed 48) and now considering 193/239 (removed 46) transitions.
[2024-05-30 01:41:49] [INFO ] Invariant cache hit.
[2024-05-30 01:41:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 01:41:49] [INFO ] Invariant cache hit.
[2024-05-30 01:41:49] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:41:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 8947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 341 constraints, problems are : Problem set: 0 solved, 192 unsolved in 8234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 17201ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 17204ms
Starting structural reductions in LTL mode, iteration 1 : 146/194 places, 193/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17372 ms. Remains : 146/194 places, 193/239 transitions.
[2024-05-30 01:42:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:42:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:42:07] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:42:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:42:07] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:42:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5044506249568400614.gal : 2 ms
[2024-05-30 01:42:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality4176585221488547757.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/CTLCardinality5044506249568400614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4176585221488547757.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.88956e+11,0.365986,11260,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.382699,11260,1,0,6,35115,7,1,939,37329,1
FORMULA SmartHome-PT-12-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 239
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 173 transition count 221
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 173 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 164 transition count 212
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 164 transition count 212
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 65 place count 156 transition count 204
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 156 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 153 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 153 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 152 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 152 transition count 200
Applied a total of 81 rules in 12 ms. Remains 152 /194 variables (removed 42) and now considering 200/239 (removed 39) transitions.
// Phase 1: matrix 200 rows 152 cols
[2024-05-30 01:42:07] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 01:42:07] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 01:42:07] [INFO ] Invariant cache hit.
[2024-05-30 01:42:07] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-30 01:42:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/352 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 155 constraints, problems are : Problem set: 0 solved, 199 unsolved in 10060 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/352 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 199/354 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/352 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 354 constraints, problems are : Problem set: 0 solved, 199 unsolved in 8321 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 18417ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 18422ms
Starting structural reductions in LTL mode, iteration 1 : 152/194 places, 200/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18727 ms. Remains : 152/194 places, 200/239 transitions.
[2024-05-30 01:42:26] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:42:26] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:42:26] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-30 01:42:26] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:42:26] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:42:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality12810956976030755491.gal : 1 ms
[2024-05-30 01:42:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality12954229774023882555.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/CTLCardinality12810956976030755491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12954229774023882555.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.46398e+11,0.264812,12088,2,2341,5,38087,6,0,803,41324,0


Converting to forward existential form...Done !
original formula: ((AG(EX(((p83==1)||(p216==0)))) * AX(FALSE)) + (AF((p197==0)) * AG(EF((p275==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !((!(E(TRUE U !(EX(((p83==1)||(p216==0)))))) * !(EX(!(FALSE)))))),!((p197==0)))] = FALSE * [(FwdU...271
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t29, t32, t65, t97, t100, t117, t120, t137, t140, t153, t172, t175, t178, t180, t184...257
(forward)formula 0,0,5.5965,143800,1,0,305,866332,423,208,4831,714302,492
FORMULA SmartHome-PT-12-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 173 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 173 transition count 220
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 163 transition count 210
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 163 transition count 210
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 155 transition count 202
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 155 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 155 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 152 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 152 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 151 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 151 transition count 197
Applied a total of 85 rules in 8 ms. Remains 151 /194 variables (removed 43) and now considering 197/239 (removed 42) transitions.
// Phase 1: matrix 197 rows 151 cols
[2024-05-30 01:42:31] [INFO ] Computed 4 invariants in 2 ms
[2024-05-30 01:42:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 01:42:32] [INFO ] Invariant cache hit.
[2024-05-30 01:42:32] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 01:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 2/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/348 variables, 151/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 155 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8296 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 2/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/348 variables, 151/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 196/351 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 351 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8629 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 16948ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 16950ms
Starting structural reductions in LTL mode, iteration 1 : 151/194 places, 197/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17137 ms. Remains : 151/194 places, 197/239 transitions.
[2024-05-30 01:42:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:42:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:42:49] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-30 01:42:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:42:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:42:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality1633533908683100645.gal : 2 ms
[2024-05-30 01:42:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality2385265695192403699.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/CTLCardinality1633533908683100645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2385265695192403699.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.06009e+11,0.234815,11020,2,2310,5,32869,6,0,793,35294,0


Converting to forward existential form...Done !
original formula: AG(AX(A(EF(AG((p254==1))) U (((p368==0)||(p193==1))||((p148==0)||(p258!=0))))))
=> equivalent forward existential formula: ([((FwdU(EY(FwdU(Init,TRUE)),!((((p368==0)||(p193==1))||((p148==0)||(p258!=0))))) * !((((p368==0)||(p193==1))||(...321
Hit Full ! (commute/partial/dont) 190/21/7
(forward)formula 0,0,0.923705,29380,1,0,12,163389,20,3,3666,55281,13
FORMULA SmartHome-PT-12-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 191 transition count 239
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 170 transition count 218
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 170 transition count 218
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 160 transition count 208
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 160 transition count 208
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 152 transition count 200
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 152 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 152 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 149 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 149 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 148 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 148 transition count 195
Applied a total of 90 rules in 7 ms. Remains 148 /194 variables (removed 46) and now considering 195/239 (removed 44) transitions.
// Phase 1: matrix 195 rows 148 cols
[2024-05-30 01:42:50] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:42:50] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 01:42:50] [INFO ] Invariant cache hit.
[2024-05-30 01:42:50] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-30 01:42:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9292 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 194/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 345 constraints, problems are : Problem set: 0 solved, 194 unsolved in 8009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 17326ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 17328ms
Starting structural reductions in LTL mode, iteration 1 : 148/194 places, 195/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17516 ms. Remains : 148/194 places, 195/239 transitions.
[2024-05-30 01:43:07] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:43:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:43:07] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-30 01:43:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:43:07] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:43:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality16233645574263937459.gal : 1 ms
[2024-05-30 01:43:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality18257861246637572057.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/CTLCardinality16233645574263937459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18257861246637572057.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.04143e+11,0.375192,11796,2,2302,5,38153,6,0,782,41207,0


Converting to forward existential form...Done !
original formula: EX(EF((p94==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p94==1))] != FALSE
(forward)formula 0,1,0.589312,12588,1,0,9,39460,9,1,1510,42407,4
FORMULA SmartHome-PT-12-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 01:43:08] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:43:08] [INFO ] Flatten gal took : 5 ms
Total runtime 255920 ms.

BK_STOP 1717033388362

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

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