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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K 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-06-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717030420511

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 00:53:42] [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 00:53:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:53:43] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-30 00:53:43] [INFO ] Transformed 219 places.
[2024-05-30 00:53:43] [INFO ] Transformed 254 transitions.
[2024-05-30 00:53:43] [INFO ] Found NUPN structural information;
[2024-05-30 00:53:43] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 495 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-06-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 175 transition count 209
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 175 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 175 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 169 transition count 201
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 169 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 166 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 166 transition count 198
Applied a total of 74 rules in 111 ms. Remains 166 /202 variables (removed 36) and now considering 198/236 (removed 38) transitions.
// Phase 1: matrix 198 rows 166 cols
[2024-05-30 00:53:43] [INFO ] Computed 9 invariants in 35 ms
[2024-05-30 00:53:44] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-30 00:53:44] [INFO ] Invariant cache hit.
[2024-05-30 00:53:44] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 00:53:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 00:53:47] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 41 ms to minimize.
[2024-05-30 00:53:47] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 4 ms to minimize.
[2024-05-30 00:53:48] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 4 ms to minimize.
[2024-05-30 00:53:48] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 4 ms to minimize.
[2024-05-30 00:53:48] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-05-30 00:53:48] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 3 ms to minimize.
[2024-05-30 00:53:48] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-30 00:53:48] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-05-30 00:53:49] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-30 00:53:49] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
[2024-05-30 00:53:49] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-30 00:53:49] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 3 ms to minimize.
[2024-05-30 00:53:49] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-30 00:53:50] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-30 00:53:50] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 00:53:50] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-30 00:53:51] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/364 variables, 166/192 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 192 constraints, problems are : Problem set: 0 solved, 197 unsolved in 15212 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 00:54:01] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-30 00:54:02] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 00:54:03] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-30 00:54:03] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 198/364 variables, 166/196 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 197/393 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 00:54:07] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 4 ms to minimize.
[2024-05-30 00:54:07] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
[2024-05-30 00:54:08] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-30 00:54:08] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 0/364 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 397 constraints, problems are : Problem set: 0 solved, 197 unsolved in 16986 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 25/25 constraints]
After SMT, in 32391ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 32424ms
Starting structural reductions in LTL mode, iteration 1 : 166/202 places, 198/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33457 ms. Remains : 166/202 places, 198/236 transitions.
Support contains 79 out of 166 places after structural reductions.
[2024-05-30 00:54:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 00:54:17] [INFO ] Flatten gal took : 60 ms
[2024-05-30 00:54:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-06-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:54:17] [INFO ] Flatten gal took : 34 ms
[2024-05-30 00:54:17] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 60 out of 166 places (down from 79) after GAL structural reductions.
FORMULA SmartHome-PT-06-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (290 resets) in 2222 ms. (17 steps per ms) remains 4/46 properties
BEST_FIRST walk for 40004 steps (46 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (47 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (48 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (53 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
[2024-05-30 00:54:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 117/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 43/166 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 198/364 variables, 166/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 175 constraints, problems are : Problem set: 0 solved, 4 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 117/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 00:54:18] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 3 ms to minimize.
[2024-05-30 00:54:18] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 3 ms to minimize.
[2024-05-30 00:54:18] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-05-30 00:54:19] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 43/166 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 198/364 variables, 166/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 00:54:19] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/364 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 184 constraints, problems are : Problem set: 0 solved, 4 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 1101ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 767 ms.
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 198/198 transitions.
Graph (trivial) has 155 edges and 166 vertex of which 70 / 166 are part of one of the 5 SCC in 12 ms
Free SCC test removed 65 places
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 101 transition count 84
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 64 place count 73 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 70 transition count 77
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 67 place count 70 transition count 71
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 79 place count 64 transition count 71
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 90 place count 53 transition count 60
Iterating global reduction 3 with 11 rules applied. Total rules applied 101 place count 53 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 104 place count 53 transition count 57
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 140 place count 35 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 95 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 9 rules applied. Total rules applied 149 place count 34 transition count 30
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 154 place count 34 transition count 25
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 159 place count 29 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 28 transition count 24
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 164 place count 26 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 166 place count 24 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 166 place count 24 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 168 place count 23 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 170 place count 22 transition count 20
Applied a total of 170 rules in 105 ms. Remains 22 /166 variables (removed 144) and now considering 20/198 (removed 178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 22/166 places, 20/198 transitions.
RANDOM walk for 2554 steps (0 resets) in 18 ms. (134 steps per ms) remains 0/4 properties
[2024-05-30 00:54:20] [INFO ] Flatten gal took : 21 ms
[2024-05-30 00:54:20] [INFO ] Flatten gal took : 20 ms
[2024-05-30 00:54:20] [INFO ] Input system was already deterministic with 198 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Graph (trivial) has 158 edges and 166 vertex of which 49 / 166 are part of one of the 5 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 121 transition count 99
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 52 rules applied. Total rules applied 95 place count 79 transition count 89
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 102 place count 74 transition count 87
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 105 place count 73 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 71 transition count 85
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 107 place count 71 transition count 79
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 119 place count 65 transition count 79
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 135 place count 49 transition count 63
Iterating global reduction 5 with 16 rules applied. Total rules applied 151 place count 49 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 154 place count 49 transition count 60
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 155 place count 48 transition count 59
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 48 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 184 place count 34 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 185 place count 34 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 187 place count 33 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 197 place count 33 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 199 place count 31 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 200 place count 31 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 202 place count 29 transition count 31
Applied a total of 202 rules in 111 ms. Remains 29 /166 variables (removed 137) and now considering 31/198 (removed 167) transitions.
[2024-05-30 00:54:20] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 29 cols
[2024-05-30 00:54:20] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:54:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 00:54:20] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-30 00:54:20] [INFO ] Invariant cache hit.
[2024-05-30 00:54:20] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-30 00:54:20] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-30 00:54:20] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-30 00:54:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 26/55 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/55 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/56 variables, and 36 constraints, problems are : Problem set: 0 solved, 19 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 26/55 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/56 variables, and 55 constraints, problems are : Problem set: 0 solved, 19 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 873ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 875ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/166 places, 31/198 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1163 ms. Remains : 29/166 places, 31/198 transitions.
[2024-05-30 00:54:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:54:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:54:21] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-30 00:54:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:54:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:54:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4239194468671982067.gal : 8 ms
[2024-05-30 00:54:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9585688521155845972.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4239194468671982067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9585688521155845972.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,1280,0.02861,3400,2,120,5,792,6,0,145,609,0


Converting to forward existential form...Done !
original formula: EF((AF((p145==0)) * (p124==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p124==1)) * !(EG(!((p145==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.045864,4276,1,0,11,2961,20,6,673,1704,7
FORMULA SmartHome-PT-06-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Graph (trivial) has 162 edges and 166 vertex of which 71 / 166 are part of one of the 5 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 99 transition count 86
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 64 place count 71 transition count 79
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 68 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 67 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 69 place count 67 transition count 72
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 81 place count 61 transition count 72
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 96 place count 46 transition count 57
Iterating global reduction 4 with 15 rules applied. Total rules applied 111 place count 46 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 114 place count 46 transition count 54
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 5 with 24 rules applied. Total rules applied 138 place count 34 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 139 place count 34 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 141 place count 33 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 150 place count 33 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 152 place count 31 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 154 place count 29 transition count 29
Applied a total of 154 rules in 27 ms. Remains 29 /166 variables (removed 137) and now considering 29/198 (removed 169) transitions.
[2024-05-30 00:54:22] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 29 cols
[2024-05-30 00:54:22] [INFO ] Computed 7 invariants in 0 ms
[2024-05-30 00:54:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 00:54:22] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-30 00:54:22] [INFO ] Invariant cache hit.
[2024-05-30 00:54:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 00:54:22] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-30 00:54:22] [INFO ] Redundant transitions in 1 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-30 00:54:22] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-30 00:54:22] [INFO ] Invariant cache hit.
[2024-05-30 00:54:22] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 3/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 24/53 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/54 variables, and 48 constraints, problems are : Problem set: 0 solved, 25 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 3/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 24/53 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/54 variables, and 73 constraints, problems are : Problem set: 0 solved, 25 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 685ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/166 places, 29/198 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 838 ms. Remains : 29/166 places, 29/198 transitions.
[2024-05-30 00:54:22] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:54:22] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:54:22] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 00:54:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:54:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:54:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16972773205810461556.gal : 1 ms
[2024-05-30 00:54:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality60341064630183587.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/CTLCardinality16972773205810461556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality60341064630183587.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,580,0.007698,3508,2,124,5,680,6,0,142,524,0


Converting to forward existential form...Done !
original formula: EF(AG(EF(((p214==0)||(p108==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U ((p214==0)||(p108==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t25, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.027395,4088,1,0,60,3710,72,32,828,2740,73
FORMULA SmartHome-PT-06-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Graph (trivial) has 161 edges and 166 vertex of which 71 / 166 are part of one of the 5 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 99 transition count 86
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 63 place count 71 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 68 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 66 place count 68 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 78 place count 62 transition count 74
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 93 place count 47 transition count 59
Iterating global reduction 3 with 15 rules applied. Total rules applied 108 place count 47 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 111 place count 47 transition count 56
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 139 place count 33 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 33 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 148 place count 33 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 32 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 30 transition count 31
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 14 edges and 29 vertex of which 2 / 29 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 153 place count 28 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 155 place count 28 transition count 29
Applied a total of 155 rules in 26 ms. Remains 28 /166 variables (removed 138) and now considering 29/198 (removed 169) transitions.
[2024-05-30 00:54:22] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 28 cols
[2024-05-30 00:54:22] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:54:22] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 00:54:22] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-30 00:54:22] [INFO ] Invariant cache hit.
[2024-05-30 00:54:23] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-30 00:54:23] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-30 00:54:23] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-30 00:54:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 24/52 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 17 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 24/52 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 52 constraints, problems are : Problem set: 0 solved, 17 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 686ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 686ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/166 places, 29/198 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 819 ms. Remains : 28/166 places, 29/198 transitions.
[2024-05-30 00:54:23] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:54:23] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 00:54:23] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:54:23] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:54:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality367513062222778623.gal : 2 ms
[2024-05-30 00:54:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality6499262790651174577.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/CTLCardinality367513062222778623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6499262790651174577.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,1024,0.012118,3508,2,93,5,619,6,0,139,486,0


Converting to forward existential form...Done !
original formula: EF(AG((p116==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p116==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.022168,3824,1,0,7,1769,15,1,628,735,5
FORMULA SmartHome-PT-06-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 135 transition count 167
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 135 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 135 transition count 164
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 127 transition count 156
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 127 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 122 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 122 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 122 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 121 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 121 transition count 149
Applied a total of 94 rules in 27 ms. Remains 121 /166 variables (removed 45) and now considering 149/198 (removed 49) transitions.
// Phase 1: matrix 149 rows 121 cols
[2024-05-30 00:54:23] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 00:54:23] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-30 00:54:23] [INFO ] Invariant cache hit.
[2024-05-30 00:54:24] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-30 00:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 00:54:25] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 3 ms to minimize.
[2024-05-30 00:54:25] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 3 ms to minimize.
[2024-05-30 00:54:26] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/270 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 00:54:28] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 00:54:29] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 00:54:31] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 136 constraints, problems are : Problem set: 0 solved, 148 unsolved in 10889 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/270 variables, 121/136 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 148/284 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 00:54:37] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 285 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7641 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 7/7 constraints]
After SMT, in 18576ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 18580ms
Starting structural reductions in LTL mode, iteration 1 : 121/166 places, 149/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18912 ms. Remains : 121/166 places, 149/198 transitions.
[2024-05-30 00:54:42] [INFO ] Flatten gal took : 16 ms
[2024-05-30 00:54:42] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:54:42] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-30 00:54:42] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:54:42] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:54:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality4069574121520087842.gal : 5 ms
[2024-05-30 00:54:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5069188539036069767.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/CTLCardinality4069574121520087842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5069188539036069767.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.07233e+08,0.366564,11060,2,2264,5,36120,6,0,635,31909,0


Converting to forward existential form...Done !
original formula: AG((AX(EF((p127==0))) + EG(EX((p66==0)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EG(EX((p66==0)))))) * !(E(TRUE U (p127==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t36, t71, t91, t125, Intersection with reachable at each step enabled. (de...200
(forward)formula 0,1,1.7447,41408,1,0,187,165846,319,125,3576,140838,308
FORMULA SmartHome-PT-06-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 134 transition count 166
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 134 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 134 transition count 163
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 125 transition count 154
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 125 transition count 154
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 91 place count 119 transition count 148
Iterating global reduction 1 with 6 rules applied. Total rules applied 97 place count 119 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 119 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 117 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 117 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 116 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 116 transition count 144
Applied a total of 104 rules in 20 ms. Remains 116 /166 variables (removed 50) and now considering 144/198 (removed 54) transitions.
// Phase 1: matrix 144 rows 116 cols
[2024-05-30 00:54:44] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 00:54:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 00:54:44] [INFO ] Invariant cache hit.
[2024-05-30 00:54:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-30 00:54:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:54:46] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2024-05-30 00:54:46] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-30 00:54:46] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/260 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 128 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6821 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/260 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 143/271 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:54:54] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-30 00:54:54] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:54:55] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 274 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8757 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 6/6 constraints]
After SMT, in 15603ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 15605ms
Starting structural reductions in LTL mode, iteration 1 : 116/166 places, 144/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15876 ms. Remains : 116/166 places, 144/198 transitions.
[2024-05-30 00:55:00] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:55:00] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:55:00] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-30 00:55:00] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:55:00] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:55:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality5886044969437048883.gal : 4 ms
[2024-05-30 00:55:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17070506889524990022.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/CTLCardinality5886044969437048883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17070506889524990022.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,9.50769e+07,0.20208,10240,2,1911,5,30523,6,0,610,28142,0


Converting to forward existential form...Done !
original formula: EF(((p136==1) * EX(TRUE)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (p136==1))) * TRUE)] != FALSE
(forward)formula 0,1,0.223056,10240,1,0,7,30523,8,2,912,28142,2
FORMULA SmartHome-PT-06-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 140 transition count 172
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 140 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 140 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 61 place count 134 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 134 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 130 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 130 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 130 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 129 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 129 transition count 157
Applied a total of 78 rules in 12 ms. Remains 129 /166 variables (removed 37) and now considering 157/198 (removed 41) transitions.
// Phase 1: matrix 157 rows 129 cols
[2024-05-30 00:55:00] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 00:55:00] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-30 00:55:00] [INFO ] Invariant cache hit.
[2024-05-30 00:55:00] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-30 00:55:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 00:55:02] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-30 00:55:02] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 3 ms to minimize.
[2024-05-30 00:55:02] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-05-30 00:55:02] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 3 ms to minimize.
[2024-05-30 00:55:03] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-30 00:55:03] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 3 ms to minimize.
[2024-05-30 00:55:03] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-30 00:55:03] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 3 ms to minimize.
[2024-05-30 00:55:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 00:55:04] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 157/286 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 148 constraints, problems are : Problem set: 0 solved, 156 unsolved in 9169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 00:55:11] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 157/286 variables, 129/149 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 156/305 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/286 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 305 constraints, problems are : Problem set: 0 solved, 156 unsolved in 7988 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 11/11 constraints]
After SMT, in 17199ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 17202ms
Starting structural reductions in LTL mode, iteration 1 : 129/166 places, 157/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17479 ms. Remains : 129/166 places, 157/198 transitions.
[2024-05-30 00:55:18] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:55:18] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:55:18] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-30 00:55:18] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:55:18] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:55:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4509674263141748686.gal : 4 ms
[2024-05-30 00:55:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3664343007423903660.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4509674263141748686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3664343007423903660.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.87119e+08,0.57915,17176,2,3316,5,62551,6,0,675,59483,0


Converting to forward existential form...Done !
original formula: (A((EX(A(A(((p148==0)||(p95==1)) U (p120==1)) U (p207==0))) + AX((AF((p193==0)) + AG((p167==1))))) U (EG(((p142==0)||(p153==1))) * EX(EF(...287
=> equivalent forward existential formula: [(EY(FwdU((Init * !((E(!((EG(((p142==0)||(p153==1))) * EX(E(TRUE U ((p211==0)||(p72==1)))))) U (!((EX(!((E(!((p2...699
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t13, t15, t39, t42, t76, t95, t98, t100, t133, t137, Intersection with reac...232
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,26.9584,698564,1,0,1589,4.99056e+06,389,852,4194,3.69191e+06,1820
FORMULA SmartHome-PT-06-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 140 transition count 172
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 140 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 140 transition count 170
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 132 transition count 162
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 132 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 126 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 126 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 126 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 124 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 124 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 123 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 123 transition count 152
Applied a total of 89 rules in 18 ms. Remains 123 /166 variables (removed 43) and now considering 152/198 (removed 46) transitions.
// Phase 1: matrix 152 rows 123 cols
[2024-05-30 00:55:45] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:55:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-30 00:55:45] [INFO ] Invariant cache hit.
[2024-05-30 00:55:45] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-05-30 00:55:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-30 00:55:47] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 3 ms to minimize.
[2024-05-30 00:55:47] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-30 00:55:47] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 4 ms to minimize.
[2024-05-30 00:55:47] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-30 00:55:47] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 3 ms to minimize.
[2024-05-30 00:55:47] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 3 ms to minimize.
[2024-05-30 00:55:47] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-30 00:55:48] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 152/275 variables, 123/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 140 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7767 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-30 00:55:54] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 3 ms to minimize.
[2024-05-30 00:55:54] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 3 ms to minimize.
[2024-05-30 00:55:55] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 152/275 variables, 123/143 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 151/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 294 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7821 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 11/11 constraints]
After SMT, in 15607ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 15609ms
Starting structural reductions in LTL mode, iteration 1 : 123/166 places, 152/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15839 ms. Remains : 123/166 places, 152/198 transitions.
[2024-05-30 00:56:01] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:56:01] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:56:01] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-30 00:56:01] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:56:01] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:56:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality13449920408633716450.gal : 3 ms
[2024-05-30 00:56:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality11352423163045240815.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/CTLCardinality13449920408633716450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11352423163045240815.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.63547e+08,0.395482,11080,2,2482,5,34836,6,0,646,32483,0


Converting to forward existential form...Done !
original formula: E((p4==1) U !(E(((p64==0) * AF((p158!=0))) U (AX(AF((p189==0))) * E(AX(((p45==0)||(p103==1))) U (p47!=0))))))
=> equivalent forward existential formula: [(FwdU(Init,(p4==1)) * !(E(((p64==0) * !(EG(!((p158!=0))))) U (!(EX(!(!(EG(!((p189==0))))))) * E(!(EX(!(((p45==0...197
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t13, t15, t33, t36, t68, t70, t89, t111, t126, t127, Intersection with reac...232
Hit Full ! (commute/partial/dont) 150/0/2
(forward)formula 0,0,15.1182,394376,1,0,944,2.60425e+06,350,571,3667,2.46514e+06,1022
FORMULA SmartHome-PT-06-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 176
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 144 transition count 173
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 138 transition count 167
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 138 transition count 167
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 134 transition count 163
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 134 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 134 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 133 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 133 transition count 161
Applied a total of 70 rules in 13 ms. Remains 133 /166 variables (removed 33) and now considering 161/198 (removed 37) transitions.
// Phase 1: matrix 161 rows 133 cols
[2024-05-30 00:56:16] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 00:56:16] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 00:56:16] [INFO ] Invariant cache hit.
[2024-05-30 00:56:16] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 00:56:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 00:56:18] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 3 ms to minimize.
[2024-05-30 00:56:18] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 3 ms to minimize.
[2024-05-30 00:56:19] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 3 ms to minimize.
[2024-05-30 00:56:19] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 3 ms to minimize.
[2024-05-30 00:56:19] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-05-30 00:56:19] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-30 00:56:19] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-30 00:56:19] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/294 variables, 133/150 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 150 constraints, problems are : Problem set: 0 solved, 160 unsolved in 9044 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 00:56:27] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 161/294 variables, 133/151 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 160/311 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 311 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7933 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 9/9 constraints]
After SMT, in 17019ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 17022ms
Starting structural reductions in LTL mode, iteration 1 : 133/166 places, 161/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17273 ms. Remains : 133/166 places, 161/198 transitions.
[2024-05-30 00:56:33] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:56:33] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:56:33] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-30 00:56:33] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:56:33] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:56:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality12493199175184227353.gal : 6 ms
[2024-05-30 00:56:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality8928555398545883466.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/CTLCardinality12493199175184227353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8928555398545883466.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.09188e+08,0.339224,10072,2,2312,5,30323,6,0,695,28103,0


Converting to forward existential form...Done !
original formula: A((AG((p127==0)) * EX((EF(((p139==0)||(p161==1))) + (p13==1)))) U (E(((p175==0)||(p109==1)) U (((((p16==0)||(p84==1)) * AG(((p78==0)||(p1...265
=> equivalent forward existential formula: [((Init * !(EG(!((E(((p175==0)||(p109==1)) U (((((p16==0)||(p84==1)) * !(E(TRUE U !(((p78==0)||(p125==1)))))) + ...792
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t39, t77, t99, t100, t137, Intersection with reachable at each step enable...206
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,17.3383,472060,1,0,924,3.14307e+06,376,577,4319,2.8462e+06,1072
FORMULA SmartHome-PT-06-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 136 transition count 168
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 136 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 136 transition count 167
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 127 transition count 158
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 127 transition count 158
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 85 place count 121 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 91 place count 121 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 121 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 119 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 119 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 118 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 118 transition count 148
Applied a total of 98 rules in 8 ms. Remains 118 /166 variables (removed 48) and now considering 148/198 (removed 50) transitions.
// Phase 1: matrix 148 rows 118 cols
[2024-05-30 00:56:51] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 00:56:51] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 00:56:51] [INFO ] Invariant cache hit.
[2024-05-30 00:56:51] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-30 00:56:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-30 00:56:52] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-30 00:56:53] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/266 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-30 00:56:55] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 130 constraints, problems are : Problem set: 0 solved, 147 unsolved in 8077 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-30 00:57:00] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/266 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 147/278 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 278 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6845 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 4/4 constraints]
After SMT, in 14950ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 14952ms
Starting structural reductions in LTL mode, iteration 1 : 118/166 places, 148/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15155 ms. Remains : 118/166 places, 148/198 transitions.
[2024-05-30 00:57:06] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:06] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:06] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-30 00:57:06] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:06] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality11036373490037681345.gal : 3 ms
[2024-05-30 00:57:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality13572922880414085913.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/CTLCardinality11036373490037681345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13572922880414085913.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.90147e+08,0.295177,9216,2,1579,5,25807,6,0,622,24168,0


Converting to forward existential form...Done !
original formula: EF((AX(EX((((p6==0)&&(p9==1))&&(p201==0)))) + EX(AG(((p211==0)&&(p210==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(EX((((p6==0)&&(p9==1))&&(p201==0)))))))] != FALSE + [(EY(FwdU(Init,TRUE)) * !(E(TRUE...197
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t34, t66, t86, t120, t121, t122, Intersection with reachable at each step ...213
(forward)formula 0,1,1.23712,29548,1,0,194,132430,312,127,3452,108673,307
FORMULA SmartHome-PT-06-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 135 transition count 167
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 135 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 135 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 126 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 126 transition count 155
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 88 place count 121 transition count 150
Iterating global reduction 1 with 5 rules applied. Total rules applied 93 place count 121 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 121 transition count 149
Applied a total of 94 rules in 7 ms. Remains 121 /166 variables (removed 45) and now considering 149/198 (removed 49) transitions.
// Phase 1: matrix 149 rows 121 cols
[2024-05-30 00:57:07] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:57:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 00:57:07] [INFO ] Invariant cache hit.
[2024-05-30 00:57:08] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-30 00:57:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 00:57:09] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 3 ms to minimize.
[2024-05-30 00:57:09] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-30 00:57:09] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2024-05-30 00:57:09] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 3 ms to minimize.
[2024-05-30 00:57:09] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/270 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 135 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7283 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/270 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 148/283 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-30 00:57:17] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 284 constraints, problems are : Problem set: 0 solved, 148 unsolved in 8010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 6/6 constraints]
After SMT, in 15311ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 15313ms
Starting structural reductions in LTL mode, iteration 1 : 121/166 places, 149/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15496 ms. Remains : 121/166 places, 149/198 transitions.
[2024-05-30 00:57:23] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:57:23] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:23] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-30 00:57:23] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:23] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:57:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality11500288314911448437.gal : 3 ms
[2024-05-30 00:57:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11681933421996771430.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/CTLCardinality11500288314911448437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11681933421996771430.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.43602e+08,0.429584,11856,2,3082,5,40237,6,0,635,34870,0


Converting to forward existential form...Done !
original formula: (EF((p130==1)) + EX(((AX((p198==1)) * (p186==0)) + ((p35==1) * EF(((p190==0)&&(p201==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p130==1))] != FALSE + ([((EY(Init) * (p186==0)) * !(EX(!((p198==1)))))] != FALSE + [(FwdU(...220
(forward)formula 0,1,0.432122,12120,1,0,7,40237,8,1,638,34870,1
FORMULA SmartHome-PT-06-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 198/198 transitions.
Graph (trivial) has 149 edges and 166 vertex of which 67 / 166 are part of one of the 5 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 103 transition count 95
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 57 place count 78 transition count 89
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 63 place count 75 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 66 place count 72 transition count 86
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 66 place count 72 transition count 80
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 78 place count 66 transition count 80
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 93 place count 51 transition count 65
Iterating global reduction 4 with 15 rules applied. Total rules applied 108 place count 51 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 111 place count 51 transition count 62
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 137 place count 38 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 38 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 141 place count 38 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 37 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 143 place count 36 transition count 44
Applied a total of 143 rules in 24 ms. Remains 36 /166 variables (removed 130) and now considering 44/198 (removed 154) transitions.
[2024-05-30 00:57:23] [INFO ] Flow matrix only has 36 transitions (discarded 8 similar events)
// Phase 1: matrix 36 rows 36 cols
[2024-05-30 00:57:23] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 00:57:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 00:57:23] [INFO ] Flow matrix only has 36 transitions (discarded 8 similar events)
[2024-05-30 00:57:23] [INFO ] Invariant cache hit.
[2024-05-30 00:57:23] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-30 00:57:24] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 00:57:24] [INFO ] Flow matrix only has 36 transitions (discarded 8 similar events)
[2024-05-30 00:57:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 35/71 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/71 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/72 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 35/71 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/71 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/72 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1351ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1353ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/166 places, 44/198 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1523 ms. Remains : 36/166 places, 44/198 transitions.
[2024-05-30 00:57:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:57:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:57:25] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-30 00:57:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:57:25] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:57:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17244580023199694741.gal : 1 ms
[2024-05-30 00:57:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3654946595674033665.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/CTLCardinality17244580023199694741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3654946595674033665.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,5880,0.021352,3600,2,208,5,1490,6,0,185,1065,0


Converting to forward existential form...Done !
original formula: AF(((!(A((p119==1) U (p188==0))) * EF(((p33==0)||(p125==1)))) * ((p217==0)||(p113==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!((p188==0)) U (!((p119==1)) * !((p188==0)))) + EG(!((p188==0)))))) * E(TRUE U ((p33==0)||...204
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 37/0/7
Hit Full ! (commute/partial/dont) 37/0/7
(forward)formula 0,0,0.083151,4972,1,0,31,8367,34,26,939,6507,35
FORMULA SmartHome-PT-06-CTLCardinality-2023-12 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 : 166/166 places, 198/198 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 137 transition count 169
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 137 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 137 transition count 166
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 129 transition count 158
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 129 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 124 transition count 153
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 124 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 124 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 123 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 123 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 122 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 122 transition count 150
Applied a total of 92 rules in 10 ms. Remains 122 /166 variables (removed 44) and now considering 150/198 (removed 48) transitions.
// Phase 1: matrix 150 rows 122 cols
[2024-05-30 00:57:25] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 00:57:25] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 00:57:25] [INFO ] Invariant cache hit.
[2024-05-30 00:57:25] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-30 00:57:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-30 00:57:27] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-30 00:57:27] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 3 ms to minimize.
[2024-05-30 00:57:27] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/272 variables, 122/134 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 134 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7463 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/272 variables, 122/134 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 149/283 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-30 00:57:35] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 284 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7909 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 4/4 constraints]
After SMT, in 15400ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 15406ms
Starting structural reductions in LTL mode, iteration 1 : 122/166 places, 150/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15693 ms. Remains : 122/166 places, 150/198 transitions.
[2024-05-30 00:57:41] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:57:41] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:57:41] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-30 00:57:41] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:57:41] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:57:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality931076919489403041.gal : 3 ms
[2024-05-30 00:57:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality11575629280543745796.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/CTLCardinality931076919489403041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11575629280543745796.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.07129e+08,0.359226,10804,2,2322,5,32960,6,0,640,28946,0


Converting to forward existential form...Done !
original formula: A((p214==0) U AX(AG(A(AG((p184==1)) U AX(((p78==0)||(p109==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(E(TRUE U !(!((E(!(!(EX(!(((p78==0)||(p109==1)))))) U (!(!(E(TRUE U !((p184==1))))) * !...647
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t18, t38, t71, t92, t126, Intersection with reachable at each step enabled. (de...200
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.51874,198652,1,0,525,1.31838e+06,337,451,3969,1.03685e+06,742
FORMULA SmartHome-PT-06-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 00:57:48] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:57:48] [INFO ] Flatten gal took : 5 ms
Total runtime 246018 ms.

BK_STOP 1717030668911

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-06"
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-06, 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-171683811400377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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