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

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

=== Now, execution of the tool begins

BK_START 1717034596862

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 02:03:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 02:03:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:03:19] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-30 02:03:19] [INFO ] Transformed 427 places.
[2024-05-30 02:03:19] [INFO ] Transformed 451 transitions.
[2024-05-30 02:03:19] [INFO ] Found NUPN structural information;
[2024-05-30 02:03:19] [INFO ] Parsed PT model containing 427 places and 451 transitions and 1038 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Deduced a syphon composed of 134 places in 10 ms
Reduce places removed 134 places and 107 transitions.
Support contains 74 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 282 transition count 344
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 67 place count 226 transition count 288
Iterating global reduction 1 with 56 rules applied. Total rules applied 123 place count 226 transition count 288
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 128 place count 226 transition count 283
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 219 transition count 276
Iterating global reduction 2 with 7 rules applied. Total rules applied 142 place count 219 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 213 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 213 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 213 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 212 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 212 transition count 268
Applied a total of 157 rules in 166 ms. Remains 212 /293 variables (removed 81) and now considering 268/344 (removed 76) transitions.
// Phase 1: matrix 268 rows 212 cols
[2024-05-30 02:03:20] [INFO ] Computed 3 invariants in 29 ms
[2024-05-30 02:03:20] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-30 02:03:20] [INFO ] Invariant cache hit.
[2024-05-30 02:03:21] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-05-30 02:03:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/480 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 215 constraints, problems are : Problem set: 0 solved, 267 unsolved in 17542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/212 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/480 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 267/482 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 482 constraints, problems are : Problem set: 0 solved, 267 unsolved in 14165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints]
After SMT, in 31931ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 31973ms
Starting structural reductions in LTL mode, iteration 1 : 212/293 places, 268/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33014 ms. Remains : 212/293 places, 268/344 transitions.
Support contains 74 out of 212 places after structural reductions.
[2024-05-30 02:03:53] [INFO ] Flatten gal took : 63 ms
[2024-05-30 02:03:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-15-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:03:53] [INFO ] Flatten gal took : 26 ms
[2024-05-30 02:03:53] [INFO ] Input system was already deterministic with 268 transitions.
Support contains 53 out of 212 places (down from 74) after GAL structural reductions.
RANDOM walk for 40000 steps (194 resets) in 2559 ms. (15 steps per ms) remains 2/45 properties
BEST_FIRST walk for 40004 steps (25 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (30 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
[2024-05-30 02:03:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/43 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/153 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 121/274 variables, 56/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/275 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 91/366 variables, 48/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 62/428 variables, 33/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 36/464 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/464 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 14/478 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/478 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/480 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/480 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/480 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/43 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 110/153 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 121/274 variables, 56/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/275 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/275 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 91/366 variables, 48/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 62/428 variables, 33/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 36/464 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/464 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 14/478 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/478 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/480 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/480 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/480 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 842ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 189 ms.
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 268/268 transitions.
Graph (trivial) has 212 edges and 212 vertex of which 111 / 212 are part of one of the 8 SCC in 6 ms
Free SCC test removed 103 places
Drop transitions (Empty/Sink Transition effects.) removed 147 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 150 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 109 transition count 80
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 130 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output 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 1 with 43 rules applied. Total rules applied 82 place count 70 transition count 76
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 68 transition count 75
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 85 place count 68 transition count 70
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 95 place count 63 transition count 70
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 105 place count 53 transition count 60
Iterating global reduction 3 with 10 rules applied. Total rules applied 115 place count 53 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 53 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 117 place count 53 transition count 55
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 50 transition count 55
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 167 place count 28 transition count 32
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 43 edges and 28 vertex of which 19 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 4 with 14 rules applied. Total rules applied 181 place count 19 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 184 place count 19 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 18 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 188 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 188 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 192 place count 13 transition count 12
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 193 place count 12 transition count 11
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 12 transition count 11
Applied a total of 194 rules in 65 ms. Remains 12 /212 variables (removed 200) and now considering 11/268 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 12/212 places, 11/268 transitions.
RANDOM walk for 26697 steps (6 resets) in 243 ms. (109 steps per ms) remains 0/2 properties
[2024-05-30 02:03:55] [INFO ] Flatten gal took : 30 ms
[2024-05-30 02:03:55] [INFO ] Flatten gal took : 33 ms
[2024-05-30 02:03:55] [INFO ] Input system was already deterministic with 268 transitions.
Computed a total of 57 stabilizing places and 56 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Graph (trivial) has 211 edges and 212 vertex of which 110 / 212 are part of one of the 8 SCC in 1 ms
Free SCC test removed 102 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 109 transition count 96
Reduce places removed 39 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 45 rules applied. Total rules applied 85 place count 70 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 67 transition count 90
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 88 place count 67 transition count 85
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 98 place count 62 transition count 85
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 107 place count 53 transition count 76
Iterating global reduction 3 with 9 rules applied. Total rules applied 116 place count 53 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 53 transition count 75
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 159 place count 32 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 32 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 31 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 175 place count 31 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 178 place count 28 transition count 37
Applied a total of 178 rules in 35 ms. Remains 28 /212 variables (removed 184) and now considering 37/268 (removed 231) transitions.
[2024-05-30 02:03:55] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
// Phase 1: matrix 30 rows 28 cols
[2024-05-30 02:03:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 02:03:55] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 02:03:55] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
[2024-05-30 02:03:55] [INFO ] Invariant cache hit.
[2024-05-30 02:03:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 02:03:56] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-30 02:03:56] [INFO ] Redundant transitions in 41 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-30 02:03:56] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
[2024-05-30 02:03:56] [INFO ] Invariant cache hit.
[2024-05-30 02:03:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 26/49 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/51 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/58 variables, and 28 constraints, problems are : Problem set: 0 solved, 18 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 26/49 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/51 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/53 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 2/55 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/55 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 0/55 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/58 variables, and 48 constraints, problems are : Problem set: 0 solved, 18 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 1035ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 1036ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/212 places, 37/268 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1234 ms. Remains : 28/212 places, 37/268 transitions.
[2024-05-30 02:03:57] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:03:57] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:03:57] [INFO ] Input system was already deterministic with 37 transitions.
[2024-05-30 02:03:57] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:03:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:03:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10862111627185388127.gal : 2 ms
[2024-05-30 02:03:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2487282817706661863.ctl : 6 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/CTLFireability10862111627185388127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2487282817706661863.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,131328,0.030975,3400,2,98,5,485,6,0,130,445,0


Converting to forward existential form...Done !
original formula: AG(EF(((E((p14==1) U (p284==1)) + AF((p165==1))) + ((p99==1)||(p128==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((E((p14==1) U (p284==1)) + !(EG(!((p165==1))))) + ((p99==1)||(p128==1))))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t14, t16, t17, t24, t31, Intersection with reachable at each step enabled. (des...197
(forward)formula 0,0,0.194517,7444,1,0,172,23458,100,94,772,33846,190
FORMULA SmartHome-PT-15-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 186 transition count 242
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 186 transition count 242
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 186 transition count 239
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 177 transition count 230
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 177 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 177 transition count 229
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 171 transition count 223
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 171 transition count 223
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 166 transition count 218
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 166 transition count 218
Applied a total of 96 rules in 30 ms. Remains 166 /212 variables (removed 46) and now considering 218/268 (removed 50) transitions.
// Phase 1: matrix 218 rows 166 cols
[2024-05-30 02:03:57] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 02:03:57] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 02:03:57] [INFO ] Invariant cache hit.
[2024-05-30 02:03:57] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-30 02:03:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/384 variables, 166/169 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 169 constraints, problems are : Problem set: 0 solved, 217 unsolved in 11066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/384 variables, 166/169 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 217/386 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 386 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9629 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 20760ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 20769ms
Starting structural reductions in LTL mode, iteration 1 : 166/212 places, 218/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21118 ms. Remains : 166/212 places, 218/268 transitions.
[2024-05-30 02:04:18] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:04:18] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:04:18] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-30 02:04:18] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:04:18] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:04:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3499290479860340808.gal : 6 ms
[2024-05-30 02:04:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4682627943938058995.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/CTLFireability3499290479860340808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4682627943938058995.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.33301e+12,0.308467,11652,2,2586,5,38442,6,0,876,38346,0


Converting to forward existential form...Done !
original formula: (EF((p76==1)) * AG((EF((((p84==0)||(p311==1))||(p191==1))) + EG((E((p114==1) U (p240==1)) + EX((p78==1)))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p76==1))))] = FALSE * [((FwdU(Init,TRUE) * !(EG((E((p114==1) U (p240==1)) + EX((p78==1))))...218
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t95, t98, t115, t118, t135, t138, t151, t154, t175, t189, t192, t195,...268
(forward)formula 0,1,3.62514,96920,1,0,283,551856,458,202,4850,447743,482
FORMULA SmartHome-PT-15-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 183 transition count 239
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 183 transition count 239
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 183 transition count 236
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 172 transition count 225
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 172 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 172 transition count 224
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 165 transition count 217
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 165 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 160 transition count 212
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 160 transition count 212
Applied a total of 108 rules in 25 ms. Remains 160 /212 variables (removed 52) and now considering 212/268 (removed 56) transitions.
// Phase 1: matrix 212 rows 160 cols
[2024-05-30 02:04:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:04:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 02:04:22] [INFO ] Invariant cache hit.
[2024-05-30 02:04:22] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-30 02:04:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/372 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/372 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 163 constraints, problems are : Problem set: 0 solved, 211 unsolved in 10273 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/372 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 211/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 374 constraints, problems are : Problem set: 0 solved, 211 unsolved in 8889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 19220ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 19225ms
Starting structural reductions in LTL mode, iteration 1 : 160/212 places, 212/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19534 ms. Remains : 160/212 places, 212/268 transitions.
[2024-05-30 02:04:41] [INFO ] Flatten gal took : 17 ms
[2024-05-30 02:04:41] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:04:41] [INFO ] Input system was already deterministic with 212 transitions.
[2024-05-30 02:04:41] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:04:41] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:04:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17780666092518288423.gal : 5 ms
[2024-05-30 02:04:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2205929967973117227.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17780666092518288423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2205929967973117227.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.33684e+12,0.346724,13212,2,2681,5,44463,6,0,846,47303,0


Converting to forward existential form...Done !
original formula: EX(EX(E(!(((p259!=1) + AF((p33==1)))) U EF((p217==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(EY(EY(Init)),!(((p259!=1) + !(EG(!((p33==1))))))),TRUE) * (p217==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t60, t94, t97, t114, t117, t134, t137, t149, t152, t169, t183, t186, t189,...268
(forward)formula 0,1,15.2286,387460,1,0,655,2.22057e+06,454,407,4964,2.71232e+06,904
FORMULA SmartHome-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 184 transition count 240
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 184 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 184 transition count 237
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 69 place count 174 transition count 227
Iterating global reduction 1 with 10 rules applied. Total rules applied 79 place count 174 transition count 227
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 87 place count 166 transition count 219
Iterating global reduction 1 with 8 rules applied. Total rules applied 95 place count 166 transition count 219
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 101 place count 160 transition count 213
Iterating global reduction 1 with 6 rules applied. Total rules applied 107 place count 160 transition count 213
Applied a total of 107 rules in 17 ms. Remains 160 /212 variables (removed 52) and now considering 213/268 (removed 55) transitions.
// Phase 1: matrix 213 rows 160 cols
[2024-05-30 02:04:57] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:04:57] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 02:04:57] [INFO ] Invariant cache hit.
[2024-05-30 02:04:57] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-30 02:04:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 163 constraints, problems are : Problem set: 0 solved, 212 unsolved in 10935 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 212/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/373 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 375 constraints, problems are : Problem set: 0 solved, 212 unsolved in 8605 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 19597ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 19601ms
Starting structural reductions in LTL mode, iteration 1 : 160/212 places, 213/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19921 ms. Remains : 160/212 places, 213/268 transitions.
[2024-05-30 02:05:17] [INFO ] Flatten gal took : 16 ms
[2024-05-30 02:05:17] [INFO ] Flatten gal took : 17 ms
[2024-05-30 02:05:17] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-30 02:05:17] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:05:17] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:05:17] [INFO ] Time to serialize gal into /tmp/CTLFireability12536558725230974657.gal : 4 ms
[2024-05-30 02:05:17] [INFO ] Time to serialize properties into /tmp/CTLFireability13977910387104560355.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/CTLFireability12536558725230974657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13977910387104560355.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,3.36336e+12,0.591506,14800,2,3070,5,52249,6,0,847,56348,0


Converting to forward existential form...Done !
original formula: E(!(AX(((p366==1)&&(p252==1)))) U (p335==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(((p366==1)&&(p252==1))))))) * (p335==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t31, t63, t95, t98, t115, t118, t135, t138, t150, t153, t170, t184, t187, t...272
Detected timeout of ITS tools.
[2024-05-30 02:05:47] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:05:47] [INFO ] Applying decomposition
[2024-05-30 02:05:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5246715679063082365.txt' '-o' '/tmp/graph5246715679063082365.bin' '-w' '/tmp/graph5246715679063082365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5246715679063082365.bin' '-l' '-1' '-v' '-w' '/tmp/graph5246715679063082365.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:05:47] [INFO ] Decomposing Gal with order
[2024-05-30 02:05:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:05:47] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-30 02:05:47] [INFO ] Flatten gal took : 68 ms
[2024-05-30 02:05:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-30 02:05:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1094145137387967099.gal : 6 ms
[2024-05-30 02:05:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7778498470115720342.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/CTLFireability1094145137387967099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7778498470115720342.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.36336e+12,0.102159,6792,309,36,6573,513,365,10736,58,1259,0


Converting to forward existential form...Done !
original formula: E(!(AX(((i7.i2.u55.p366==1)&&(i7.i0.u40.p252==1)))) U (i11.u53.p335==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(((i7.i2.u55.p366==1)&&(i7.i0.u40.p252==1))))))) * (i11.u53.p335==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t31, t98, t118, t138, t153, i0.u8.t184, i1.u9.t170, i2.t192, i2.u17.t150, i2.u17.t190, i...373
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 184 transition count 240
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 184 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 184 transition count 237
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 175 transition count 228
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 175 transition count 227
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 169 transition count 221
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 169 transition count 221
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 165 transition count 217
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 165 transition count 217
Applied a total of 98 rules in 12 ms. Remains 165 /212 variables (removed 47) and now considering 217/268 (removed 51) transitions.
// Phase 1: matrix 217 rows 165 cols
[2024-05-30 02:06:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:06:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 02:06:17] [INFO ] Invariant cache hit.
[2024-05-30 02:06:18] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-30 02:06:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/382 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/382 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 168 constraints, problems are : Problem set: 0 solved, 216 unsolved in 11154 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/382 variables, 165/168 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 216/384 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/382 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 384 constraints, problems are : Problem set: 0 solved, 216 unsolved in 9395 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 20600ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 20605ms
Starting structural reductions in LTL mode, iteration 1 : 165/212 places, 217/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20912 ms. Remains : 165/212 places, 217/268 transitions.
[2024-05-30 02:06:38] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:06:38] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:06:38] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-30 02:06:38] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:06:38] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:06:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2255281313642893323.gal : 3 ms
[2024-05-30 02:06:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12235379090957852560.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/CTLFireability2255281313642893323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12235379090957852560.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.55e+12,0.553008,14052,2,3034,5,48172,6,0,871,50228,0


Converting to forward existential form...Done !
original formula: !(E(((EF((p178==1)) + AX((p288==1))) + (p143==1)) U ((p286==1)&&(p420==1))))
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U (p178==1)) + !(EX(!((p288==1))))) + (p143==1))) * ((p286==1)&&(p420==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t34, t63, t95, t99, t119, t122, t139, t142, t154, t157, t174, t188, t191, t194,...268
Detected timeout of ITS tools.
[2024-05-30 02:07:08] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:07:08] [INFO ] Applying decomposition
[2024-05-30 02:07:08] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5603349469429338861.txt' '-o' '/tmp/graph5603349469429338861.bin' '-w' '/tmp/graph5603349469429338861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5603349469429338861.bin' '-l' '-1' '-v' '-w' '/tmp/graph5603349469429338861.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:07:08] [INFO ] Decomposing Gal with order
[2024-05-30 02:07:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:07:08] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-30 02:07:08] [INFO ] Flatten gal took : 30 ms
[2024-05-30 02:07:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 02:07:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4604209469202870817.gal : 7 ms
[2024-05-30 02:07:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17321837552969863540.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/CTLFireability4604209469202870817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17321837552969863540.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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.55e+12,0.144507,6408,335,42,5012,616,451,8767,63,1747,0


Converting to forward existential form...Done !
original formula: !(E(((EF((i4.i1.u26.p178==1)) + AX((i8.i1.u50.p288==1))) + (i3.u20.p143==1)) U ((i8.i0.u49.p286==1)&&(i8.i0.u49.p420==1))))
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U (i4.i1.u26.p178==1)) + !(EX(!((i8.i1.u50.p288==1))))) + (i3.u20.p143==1))) * ((i8.i0.u49....195
Reverse transition relation is NOT exact ! Due to transitions t10, t122, t142, t157, i0.u6.t188, i1.u9.t174, i2.t196, i2.u14.t154, i2.u14.t194, i3.u18.t139...376
(forward)formula 0,0,14.9965,197808,1,0,300633,616,2726,516793,327,2376,281467
FORMULA SmartHome-PT-15-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 184 transition count 240
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 184 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 184 transition count 237
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 173 transition count 226
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 173 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 173 transition count 225
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 166 transition count 218
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 166 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 161 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 161 transition count 213
Applied a total of 106 rules in 13 ms. Remains 161 /212 variables (removed 51) and now considering 213/268 (removed 55) transitions.
// Phase 1: matrix 213 rows 161 cols
[2024-05-30 02:07:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:07:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 02:07:24] [INFO ] Invariant cache hit.
[2024-05-30 02:07:24] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-30 02:07:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/374 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 164 constraints, problems are : Problem set: 0 solved, 212 unsolved in 10882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/374 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 212/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/374 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 376 constraints, problems are : Problem set: 0 solved, 212 unsolved in 9606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 20530ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 20534ms
Starting structural reductions in LTL mode, iteration 1 : 161/212 places, 213/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20781 ms. Remains : 161/212 places, 213/268 transitions.
[2024-05-30 02:07:44] [INFO ] Flatten gal took : 16 ms
[2024-05-30 02:07:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:07:44] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-30 02:07:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:07:44] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:07:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2772058760150578243.gal : 3 ms
[2024-05-30 02:07:44] [INFO ] Time to serialize properties into /tmp/CTLFireability18188354815907382552.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/CTLFireability2772058760150578243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18188354815907382552.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.55595e+12,0.581723,15356,2,3080,5,55006,6,0,851,58628,0


Converting to forward existential form...Done !
original formula: A(!((AX((AG((p159==1)) * !(AG((p304==1))))) + AX(AG((p242!=1))))) U !((AG(EX(((p219==1)||((p286==1)&&(p369==1))))) + EF((p277==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(E(TRUE U !(EX(((p219==1)||((p286==1)&&(p369==1))))))) + E(TRUE U (p277==1)))))))) * !(E(!(...458
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t28, t31, t60, t94, t97, t114, t117, t119, t135, t138, t150, t153, t170, t184, t...278
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.67519,125840,1,0,315,711597,462,232,5240,620984,530
FORMULA SmartHome-PT-15-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Graph (trivial) has 214 edges and 212 vertex of which 103 / 212 are part of one of the 8 SCC in 1 ms
Free SCC test removed 95 places
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 116 transition count 98
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 54 rules applied. Total rules applied 101 place count 70 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 66 transition count 90
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 105 place count 66 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 113 place count 62 transition count 86
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 125 place count 50 transition count 74
Iterating global reduction 3 with 12 rules applied. Total rules applied 137 place count 50 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 140 place count 50 transition count 71
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 182 place count 29 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 29 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 184 place count 28 transition count 48
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 28 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 27 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 200 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 202 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 202 place count 25 transition count 33
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 204 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 23 transition count 32
Applied a total of 205 rules in 18 ms. Remains 23 /212 variables (removed 189) and now considering 32/268 (removed 236) transitions.
[2024-05-30 02:07:49] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-30 02:07:49] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 02:07:49] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 02:07:49] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-05-30 02:07:49] [INFO ] Invariant cache hit.
[2024-05-30 02:07:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-30 02:07:49] [INFO ] Redundant transitions in 24 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 02:07:49] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-05-30 02:07:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 3/43 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/48 variables, and 22 constraints, problems are : Problem set: 0 solved, 13 unsolved in 181 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/43 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/45 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/48 variables, and 36 constraints, problems are : Problem set: 0 solved, 13 unsolved in 293 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 488ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/212 places, 32/268 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 602 ms. Remains : 23/212 places, 32/268 transitions.
[2024-05-30 02:07:50] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:07:50] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:07:50] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-30 02:07:50] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:07:50] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:07:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7448076950171575493.gal : 1 ms
[2024-05-30 02:07:50] [INFO ] Time to serialize properties into /tmp/CTLFireability76467393973763121.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/CTLFireability7448076950171575493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability76467393973763121.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,52992,0.006038,3488,2,62,5,313,6,0,104,289,0


Converting to forward existential form...Done !
original formula: AG(((p84==1) + EG((p55!=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p84==1))) * !(EG((p55!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t19, t25, t26, t29, Intersection with reachable at each step enabled. (destroyed/revers...184
(forward)formula 0,0,0.049951,5392,1,0,113,9923,80,66,598,13216,135
FORMULA SmartHome-PT-15-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 185 transition count 241
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 185 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 185 transition count 240
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 175 transition count 230
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 175 transition count 230
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 175 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 167 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 167 transition count 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 161 transition count 215
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 161 transition count 215
Applied a total of 104 rules in 18 ms. Remains 161 /212 variables (removed 51) and now considering 215/268 (removed 53) transitions.
// Phase 1: matrix 215 rows 161 cols
[2024-05-30 02:07:50] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:07:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 02:07:50] [INFO ] Invariant cache hit.
[2024-05-30 02:07:50] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-30 02:07:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/376 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 164 constraints, problems are : Problem set: 0 solved, 214 unsolved in 11034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/376 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 214/378 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 378 constraints, problems are : Problem set: 0 solved, 214 unsolved in 10264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 21338ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 21342ms
Starting structural reductions in LTL mode, iteration 1 : 161/212 places, 215/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21637 ms. Remains : 161/212 places, 215/268 transitions.
[2024-05-30 02:08:11] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:08:11] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:08:11] [INFO ] Input system was already deterministic with 215 transitions.
[2024-05-30 02:08:11] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:08:11] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:08:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15538938749968317079.gal : 2 ms
[2024-05-30 02:08:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2495710551577320449.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/CTLFireability15538938749968317079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2495710551577320449.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.50602e+12,0.484464,16424,2,3179,5,58145,6,0,853,63354,0


Converting to forward existential form...Done !
original formula: AG((EX(AF(((p126==1)&&(p28==1)))) + ((p285==0) * AX(AG((p207==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EX(!(EG(!(((p126==1)&&(p28==1)))))))) * !((p285==0)))] = FALSE * [(FwdU(EY((FwdU(Init,TR...233
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t32, t60, t92, t95, t112, t115, t132, t135, t138, t149, t152, t169, t1...289
(forward)formula 0,0,20.2741,522908,1,0,711,2.9711e+06,456,408,5027,3.77307e+06,903
FORMULA SmartHome-PT-15-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Graph (trivial) has 215 edges and 212 vertex of which 111 / 212 are part of one of the 8 SCC in 0 ms
Free SCC test removed 103 places
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 108 transition count 93
Reduce places removed 40 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 46 rules applied. Total rules applied 87 place count 68 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 90 place count 65 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 90 place count 65 transition count 82
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 100 place count 60 transition count 82
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 111 place count 49 transition count 71
Iterating global reduction 3 with 11 rules applied. Total rules applied 122 place count 49 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 125 place count 49 transition count 68
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 167 place count 28 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 28 transition count 46
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 27 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 27 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 172 place count 26 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 184 place count 26 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 185 place count 25 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 185 place count 25 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 24 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 188 place count 23 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 189 place count 22 transition count 30
Applied a total of 189 rules in 23 ms. Remains 22 /212 variables (removed 190) and now considering 30/268 (removed 238) transitions.
[2024-05-30 02:08:32] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
// Phase 1: matrix 23 rows 22 cols
[2024-05-30 02:08:32] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 02:08:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 02:08:32] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2024-05-30 02:08:32] [INFO ] Invariant cache hit.
[2024-05-30 02:08:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-30 02:08:32] [INFO ] Redundant transitions in 53 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-30 02:08:32] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2024-05-30 02:08:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/40 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/45 variables, and 21 constraints, problems are : Problem set: 0 solved, 12 unsolved in 252 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/40 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/42 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/45 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 326 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 587ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/212 places, 30/268 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 845 ms. Remains : 22/212 places, 30/268 transitions.
[2024-05-30 02:08:33] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:08:33] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:08:33] [INFO ] Input system was already deterministic with 30 transitions.
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-15-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 02:08:33] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:08:33] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:08:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14580703981059985136.gal : 0 ms
[2024-05-30 02:08:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14990124813855852234.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14580703981059985136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14990124813855852234.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 183 transition count 239
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 183 transition count 239
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 183 transition count 236
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 172 transition count 225
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 172 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 172 transition count 224
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 92 place count 164 transition count 216
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 164 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 159 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 159 transition count 211
Applied a total of 110 rules in 18 ms. Remains 159 /212 variables (removed 53) and now considering 211/268 (removed 57) transitions.
// Phase 1: matrix 211 rows 159 cols
[2024-05-30 02:08:33] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:08:33] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 02:08:33] [INFO ] Invariant cache hit.
[2024-05-30 02:08:33] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-30 02:08:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/370 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 0/370 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 162 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10079 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/370 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 210/372 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/370 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 372 constraints, problems are : Problem set: 0 solved, 210 unsolved in 9858 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
After SMT, in 19983ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 19987ms
Starting structural reductions in LTL mode, iteration 1 : 159/212 places, 211/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20283 ms. Remains : 159/212 places, 211/268 transitions.
[2024-05-30 02:08:53] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:08:53] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:08:53] [INFO ] Input system was already deterministic with 211 transitions.
[2024-05-30 02:08:53] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:08:53] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:08:53] [INFO ] Time to serialize gal into /tmp/CTLFireability3831891690752352358.gal : 2 ms
[2024-05-30 02:08:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17324182540667369337.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/CTLFireability3831891690752352358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17324182540667369337.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.17166e+12,0.551707,12968,2,2725,5,43211,6,0,841,45390,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((p194==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((p194==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t96, t113, t116, t133, t136, t148, t151, t168, t182, t185, t188,...268
(forward)formula 0,1,9.87265,202184,1,0,321,1.27739e+06,448,215,5203,980241,513
FORMULA SmartHome-PT-15-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 183 transition count 239
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 183 transition count 239
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 183 transition count 236
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 173 transition count 226
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 173 transition count 226
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 88 place count 166 transition count 219
Iterating global reduction 1 with 7 rules applied. Total rules applied 95 place count 166 transition count 219
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 101 place count 160 transition count 213
Iterating global reduction 1 with 6 rules applied. Total rules applied 107 place count 160 transition count 213
Applied a total of 107 rules in 14 ms. Remains 160 /212 variables (removed 52) and now considering 213/268 (removed 55) transitions.
// Phase 1: matrix 213 rows 160 cols
[2024-05-30 02:09:03] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:09:03] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 02:09:03] [INFO ] Invariant cache hit.
[2024-05-30 02:09:03] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-30 02:09:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/373 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 163 constraints, problems are : Problem set: 0 solved, 212 unsolved in 10684 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/373 variables, 160/163 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 212/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/373 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 375 constraints, problems are : Problem set: 0 solved, 212 unsolved in 7795 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 18523ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 18528ms
Starting structural reductions in LTL mode, iteration 1 : 160/212 places, 213/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18853 ms. Remains : 160/212 places, 213/268 transitions.
[2024-05-30 02:09:22] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:09:22] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:09:22] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-30 02:09:22] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:09:22] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:09:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7791754212716021659.gal : 2 ms
[2024-05-30 02:09:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14317337864401284705.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/CTLFireability7791754212716021659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14317337864401284705.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.39637e+12,0.322155,13508,2,2649,5,46248,6,0,847,50429,0


Converting to forward existential form...Done !
original formula: EF((EX(E(EX((p60==1)) U !(EF((p93==1))))) * ((p252==1)||(p78==1))))
=> equivalent forward existential formula: [(FwdU(EY((FwdU(Init,TRUE) * ((p252==1)||(p78==1)))),EX((p60==1))) * !(E(TRUE U (p93==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t62, t94, t97, t114, t117, t134, t137, t149, t152, t170, t184, t187, t190,...268
(forward)formula 0,1,5.52018,137904,1,0,306,699463,453,217,4966,871660,501
FORMULA SmartHome-PT-15-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 182 transition count 238
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 182 transition count 238
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 182 transition count 235
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 171 transition count 224
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 171 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 171 transition count 223
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 163 transition count 215
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 163 transition count 215
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 158 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 158 transition count 210
Applied a total of 112 rules in 12 ms. Remains 158 /212 variables (removed 54) and now considering 210/268 (removed 58) transitions.
// Phase 1: matrix 210 rows 158 cols
[2024-05-30 02:09:28] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:09:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 02:09:28] [INFO ] Invariant cache hit.
[2024-05-30 02:09:28] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 02:09:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 161 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 209/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 370 constraints, problems are : Problem set: 0 solved, 209 unsolved in 9469 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 20228ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 20232ms
Starting structural reductions in LTL mode, iteration 1 : 158/212 places, 210/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20433 ms. Remains : 158/212 places, 210/268 transitions.
[2024-05-30 02:09:48] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:09:48] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:09:48] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-30 02:09:48] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:09:48] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:09:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1124278386331291693.gal : 2 ms
[2024-05-30 02:09:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14443586464392539987.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/CTLFireability1124278386331291693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14443586464392539987.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.12715e+12,0.555365,13756,2,2817,5,46472,6,0,836,50402,0


Converting to forward existential form...Done !
original formula: EX(AG(AX(((p150==0)||(p92==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!(((p150==0)||(p92==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t115, t132, t135, t147, t150, t167, t181, t184, t187,...268
(forward)formula 0,0,3.66468,88876,1,0,278,495266,442,194,4892,429438,463
FORMULA SmartHome-PT-15-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 184 transition count 240
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 184 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 184 transition count 237
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 175 transition count 228
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 175 transition count 227
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 168 transition count 220
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 168 transition count 220
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 162 transition count 214
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 162 transition count 214
Applied a total of 104 rules in 13 ms. Remains 162 /212 variables (removed 50) and now considering 214/268 (removed 54) transitions.
// Phase 1: matrix 214 rows 162 cols
[2024-05-30 02:09:52] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:09:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 02:09:52] [INFO ] Invariant cache hit.
[2024-05-30 02:09:52] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-30 02:09:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/376 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 165 constraints, problems are : Problem set: 0 solved, 213 unsolved in 10799 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/376 variables, 162/165 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 213/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 378 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9077 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 19921ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 19926ms
Starting structural reductions in LTL mode, iteration 1 : 162/212 places, 214/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20207 ms. Remains : 162/212 places, 214/268 transitions.
[2024-05-30 02:10:12] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:10:12] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:10:12] [INFO ] Input system was already deterministic with 214 transitions.
[2024-05-30 02:10:12] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:10:12] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:10:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10419309131994988792.gal : 2 ms
[2024-05-30 02:10:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17224732552145423775.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/CTLFireability10419309131994988792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17224732552145423775.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.84893e+12,0.529846,13516,2,2599,5,45373,6,0,856,48723,0


Converting to forward existential form...Done !
original formula: AF(E((EX((p232==1)) + (p206==1)) U A((AG((p297==1)) + ((p159!=1)&&(p77!=1))) U EF((((p191==1)&&(p323==1))&&(p227==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E((EX((p232==1)) + (p206==1)) U !((E(!(E(TRUE U (((p191==1)&&(p323==1))&&(p227==1)))) U (!((!(E(TRU...321
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t29, t32, t61, t93, t96, t113, t116, t118, t134, t137, t149, t152, t171, t185, t...278
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.6673,427688,1,0,764,2.57334e+06,469,529,5287,3.12546e+06,900
FORMULA SmartHome-PT-15-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 182 transition count 238
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 182 transition count 238
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 182 transition count 235
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 171 transition count 224
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 171 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 171 transition count 223
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 163 transition count 215
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 163 transition count 215
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 158 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 158 transition count 210
Applied a total of 112 rules in 14 ms. Remains 158 /212 variables (removed 54) and now considering 210/268 (removed 58) transitions.
// Phase 1: matrix 210 rows 158 cols
[2024-05-30 02:10:29] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:10:29] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 02:10:29] [INFO ] Invariant cache hit.
[2024-05-30 02:10:29] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 02:10:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 161 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/368 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 209/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 370 constraints, problems are : Problem set: 0 solved, 209 unsolved in 8930 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 19582ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 19586ms
Starting structural reductions in LTL mode, iteration 1 : 158/212 places, 210/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19915 ms. Remains : 158/212 places, 210/268 transitions.
[2024-05-30 02:10:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:10:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:10:49] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-30 02:10:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:10:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:10:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6094775687818384627.gal : 2 ms
[2024-05-30 02:10:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16105633572134229036.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/CTLFireability6094775687818384627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16105633572134229036.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.13718e+12,0.472628,13232,2,2704,5,44648,6,0,836,48453,0


Converting to forward existential form...Done !
original formula: (AG((p277!=1)) + EX(EF(EX(AX((p88==1))))))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(E(TRUE U EX(!(EX(!((p88==1))))))))),TRUE) * !((p277!=1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t150, t167, t181, t184, t187,...268
(forward)formula 0,1,7.83804,200224,1,0,321,1.30042e+06,444,214,4758,983645,504
FORMULA SmartHome-PT-15-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 268/268 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 183 transition count 239
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 183 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 183 transition count 237
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 70 place count 173 transition count 227
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 place count 173 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 173 transition count 226
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 166 transition count 219
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 166 transition count 219
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 161 transition count 214
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 161 transition count 214
Applied a total of 105 rules in 7 ms. Remains 161 /212 variables (removed 51) and now considering 214/268 (removed 54) transitions.
// Phase 1: matrix 214 rows 161 cols
[2024-05-30 02:10:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:10:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 02:10:57] [INFO ] Invariant cache hit.
[2024-05-30 02:10:57] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-30 02:10:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/375 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 164 constraints, problems are : Problem set: 0 solved, 213 unsolved in 10993 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/375 variables, 161/164 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 213/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/375 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 377 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9621 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
After SMT, in 20650ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 20652ms
Starting structural reductions in LTL mode, iteration 1 : 161/212 places, 214/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20860 ms. Remains : 161/212 places, 214/268 transitions.
[2024-05-30 02:11:18] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:11:18] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:11:18] [INFO ] Input system was already deterministic with 214 transitions.
[2024-05-30 02:11:18] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:11:18] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:11:18] [INFO ] Time to serialize gal into /tmp/CTLFireability5169564837705711290.gal : 1 ms
[2024-05-30 02:11:18] [INFO ] Time to serialize properties into /tmp/CTLFireability619681864996792067.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/CTLFireability5169564837705711290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability619681864996792067.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.42305e+12,0.357457,13776,2,2799,5,47337,6,0,852,49198,0


Converting to forward existential form...Done !
original formula: EG(E(EF((AG((p241==1)) + (p256==1))) U ((AX(AX((p300==1))) * !(((p186==1)&&(p58==1)))) * A(!(((p2==1)&&(p238==1))) U AF((p284==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (!(E(TRUE U !((p241==1)))) + (p256==1))) U ((!(EX(!(!(EX(!((p300==1))))))) * !(((p186==1)&...298
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t32, t60, t95, t98, t115, t118, t135, t138, t150, t153, t170, t184, t1...277
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,15.6361,428208,1,0,775,2.59471e+06,477,537,5270,2.97963e+06,1064
FORMULA SmartHome-PT-15-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 02:11:33] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:11:33] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:11:33] [INFO ] Applying decomposition
[2024-05-30 02:11:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph405629489858139858.txt' '-o' '/tmp/graph405629489858139858.bin' '-w' '/tmp/graph405629489858139858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph405629489858139858.bin' '-l' '-1' '-v' '-w' '/tmp/graph405629489858139858.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:11:33] [INFO ] Decomposing Gal with order
[2024-05-30 02:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:11:33] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-30 02:11:33] [INFO ] Flatten gal took : 20 ms
[2024-05-30 02:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-30 02:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11500893277289232832.gal : 6 ms
[2024-05-30 02:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5234090073315854489.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/CTLFireability11500893277289232832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5234090073315854489.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.70163e+13,0.288659,9136,550,46,10560,821,529,18807,71,3064,0


Converting to forward existential form...Done !
original formula: E(!(AX(((i12.i1.u74.p366==1)&&(i12.i0.u56.p252==1)))) U (i7.u73.p335==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(((i12.i1.u74.p366==1)&&(i12.i0.u56.p252==1))))))) * (i7.u73.p335==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t40, t195, u1.t237, u1.t238, u1.t239, i0.u7.t234, i1.i0.t215, i1.i0.t216, i1.i0.u16.t196...560
(forward)formula 0,1,41.2973,611836,1,0,1.11059e+06,821,2768,1.7991e+06,313,3377,945164
FORMULA SmartHome-PT-15-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 535983 ms.

BK_STOP 1717035135418

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-15"
export BK_EXAMINATION="CTLFireability"
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-15, examination is CTLFireability"
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-171683811500450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-15.tgz
mv SmartHome-PT-15 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;