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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 03:47 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 71K 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-11-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-11-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-11-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-11-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-11-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-11-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717032856917

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:34: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 01:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:34:20] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-05-30 01:34:20] [INFO ] Transformed 290 places.
[2024-05-30 01:34:20] [INFO ] Transformed 315 transitions.
[2024-05-30 01:34:20] [INFO ] Found NUPN structural information;
[2024-05-30 01:34:20] [INFO ] Parsed PT model containing 290 places and 315 transitions and 722 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 66 places in 9 ms
Reduce places removed 66 places and 55 transitions.
FORMULA SmartHome-PT-11-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 260/260 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 215 transition count 260
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 61 place count 163 transition count 208
Iterating global reduction 1 with 52 rules applied. Total rules applied 113 place count 163 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 119 place count 163 transition count 202
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 126 place count 156 transition count 195
Iterating global reduction 2 with 7 rules applied. Total rules applied 133 place count 156 transition count 195
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 150 transition count 189
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 150 transition count 189
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 148 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 148 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 147 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 147 transition count 186
Applied a total of 151 rules in 162 ms. Remains 147 /224 variables (removed 77) and now considering 186/260 (removed 74) transitions.
// Phase 1: matrix 186 rows 147 cols
[2024-05-30 01:34:20] [INFO ] Computed 3 invariants in 32 ms
[2024-05-30 01:34:20] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-30 01:34:20] [INFO ] Invariant cache hit.
[2024-05-30 01:34:21] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-30 01:34:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/333 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/333 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 150 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7920 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/333 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 185/335 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 335 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 14718ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14768ms
Starting structural reductions in LTL mode, iteration 1 : 147/224 places, 186/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15755 ms. Remains : 147/224 places, 186/260 transitions.
Support contains 38 out of 147 places after structural reductions.
[2024-05-30 01:34:36] [INFO ] Flatten gal took : 81 ms
[2024-05-30 01:34:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-11-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:34:36] [INFO ] Flatten gal took : 34 ms
[2024-05-30 01:34:36] [INFO ] Input system was already deterministic with 186 transitions.
Support contains 35 out of 147 places (down from 38) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 24855 steps (173 resets) in 1346 ms. (18 steps per ms) remains 0/29 properties
[2024-05-30 01:34:37] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:34:37] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:34:37] [INFO ] Input system was already deterministic with 186 transitions.
Computed a total of 37 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 186/186 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 137 transition count 176
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 137 transition count 176
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 131 transition count 170
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 131 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 169
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 129 transition count 167
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 129 transition count 167
Applied a total of 37 rules in 13 ms. Remains 129 /147 variables (removed 18) and now considering 167/186 (removed 19) transitions.
// Phase 1: matrix 167 rows 129 cols
[2024-05-30 01:34:37] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:34:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 01:34:37] [INFO ] Invariant cache hit.
[2024-05-30 01:34:37] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-30 01:34:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/296 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 132 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/296 variables, 129/132 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 166/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/296 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 298 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5653 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 13052ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 13059ms
Starting structural reductions in LTL mode, iteration 1 : 129/147 places, 167/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13323 ms. Remains : 129/147 places, 167/186 transitions.
[2024-05-30 01:34:50] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:34:50] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:34:50] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-30 01:34:50] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:34:50] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:34:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16372988092455492495.gal : 5 ms
[2024-05-30 01:34:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8633270413490637257.ctl : 3 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/CTLFireability16372988092455492495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8633270413490637257.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13376e+10,0.143836,7360,2,1366,5,16247,6,0,679,17404,0


Converting to forward existential form...Done !
original formula: EF((E((p100==1) U ((E((p112==1) U (p102==1)) * (p43==1)) * (p81!=1))) * AG((AX((p40==0)) * (p105==0)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E((p100==1) U ((E((p112==1) U (p102==1)) * (p43==1)) * (p81!=1)))) * !(E(TRUE U !((!(EX(!((...192
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t62, t79, t83, t103, t106, t118, t121, t141, t144, t147, t149, t153, ...255
(forward)formula 0,0,1.68581,45632,1,0,249,254104,368,170,3875,221204,392
FORMULA SmartHome-PT-11-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 186/186 transitions.
Graph (trivial) has 131 edges and 147 vertex of which 36 / 147 are part of one of the 5 SCC in 3 ms
Free SCC test removed 31 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 115 transition count 101
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 55 rules applied. Total rules applied 99 place count 72 transition count 89
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 107 place count 66 transition count 87
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 111 place count 65 transition count 84
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 116 place count 62 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 61 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 117 place count 61 transition count 78
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 125 place count 57 transition count 78
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 130 place count 52 transition count 73
Iterating global reduction 6 with 5 rules applied. Total rules applied 135 place count 52 transition count 73
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 171 place count 34 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 174 place count 34 transition count 50
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 176 place count 33 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 178 place count 32 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 183 place count 32 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 184 place count 31 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 184 place count 31 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 186 place count 30 transition count 42
Applied a total of 186 rules in 53 ms. Remains 30 /147 variables (removed 117) and now considering 42/186 (removed 144) transitions.
[2024-05-30 01:34:52] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
// Phase 1: matrix 35 rows 30 cols
[2024-05-30 01:34:52] [INFO ] Computed 2 invariants in 4 ms
[2024-05-30 01:34:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:34:52] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
[2024-05-30 01:34:52] [INFO ] Invariant cache hit.
[2024-05-30 01:34:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-30 01:34:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-30 01:34:52] [INFO ] Redundant transitions in 33 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-30 01:34:52] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
[2024-05-30 01:34:52] [INFO ] Invariant cache hit.
[2024-05-30 01:34:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 34/64 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/65 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 40 constraints, problems are : Problem set: 0 solved, 41 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 34/64 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 41/80 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 81 constraints, problems are : Problem set: 0 solved, 41 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 1833ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1835ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/147 places, 42/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2015 ms. Remains : 30/147 places, 42/186 transitions.
[2024-05-30 01:34:54] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:34:54] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:34:54] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-30 01:34:54] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:34:54] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:34:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4387054343732228784.gal : 2 ms
[2024-05-30 01:34:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6993074957974107266.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/CTLFireability4387054343732228784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6993074957974107266.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,107521,0.008285,3560,2,73,5,491,6,0,152,457,0


Converting to forward existential form...Done !
original formula: E((p75==1) U EF(EG((A((p109==1) U (p229==1)) * E(((p2==1)&&(p195==1)) U (p140==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,(p75==1)),TRUE),(!((E(!((p229==1)) U (!((p109==1)) * !((p229==1)))) + EG(!((p229==1))))) * ...202
Hit Full ! (commute/partial/dont) 40/0/2
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t7, t11, t16, t18, t22, t24, t27, Intersection with reachable at each step enabl...206
(forward)formula 0,1,0.08634,6252,1,0,194,15981,123,113,965,20487,232
FORMULA SmartHome-PT-11-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 186/186 transitions.
Graph (trivial) has 139 edges and 147 vertex of which 63 / 147 are part of one of the 5 SCC in 0 ms
Free SCC test removed 58 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 88 transition count 80
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 43 rules applied. Total rules applied 75 place count 57 transition count 68
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 51 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 50 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 83 place count 50 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 89 place count 47 transition count 64
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 93 place count 43 transition count 60
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 43 transition count 60
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 129 place count 27 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 27 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 133 place count 26 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 142 place count 26 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 143 place count 25 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 143 place count 25 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 145 place count 24 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 146 place count 24 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 147 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 148 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 149 place count 22 transition count 29
Applied a total of 149 rules in 24 ms. Remains 22 /147 variables (removed 125) and now considering 29/186 (removed 157) transitions.
[2024-05-30 01:34:54] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 22 cols
[2024-05-30 01:34:54] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:34:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:34:54] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-30 01:34:54] [INFO ] Invariant cache hit.
[2024-05-30 01:34:54] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-30 01:34:54] [INFO ] Redundant transitions in 31 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-30 01:34:54] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2024-05-30 01:34:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 24/45 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 285 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 24/45 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/46 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 315 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 605ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/147 places, 29/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 754 ms. Remains : 22/147 places, 29/186 transitions.
[2024-05-30 01:34:55] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:34:55] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:34:55] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 01:34:55] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:34:55] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:34:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4712065198447644193.gal : 1 ms
[2024-05-30 01:34:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12564767523453492010.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/CTLFireability4712065198447644193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12564767523453492010.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,16560,0.008439,3460,2,59,5,316,6,0,104,295,0


Converting to forward existential form...Done !
original formula: (EF(((p227==1)&&(p46==1))) * AF(AG(EF((p207==0)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((p227==1)&&(p46==1)))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !(E(TRUE U (p207==0)))))))] = F...160
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t14, t16, t19, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,1,0.035916,4040,1,0,62,3865,81,31,611,3748,73
FORMULA SmartHome-PT-11-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 186/186 transitions.
Graph (trivial) has 141 edges and 147 vertex of which 65 / 147 are part of one of the 6 SCC in 1 ms
Free SCC test removed 59 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 87 transition count 77
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 43 rules applied. Total rules applied 76 place count 55 transition count 66
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 82 place count 50 transition count 65
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 49 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 48 transition count 63
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 86 place count 48 transition count 61
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 90 place count 46 transition count 61
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 94 place count 42 transition count 57
Iterating global reduction 5 with 4 rules applied. Total rules applied 98 place count 42 transition count 57
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 130 place count 26 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 140 place count 26 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 142 place count 24 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 142 place count 24 transition count 30
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 144 place count 23 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 22 transition count 29
Applied a total of 145 rules in 28 ms. Remains 22 /147 variables (removed 125) and now considering 29/186 (removed 157) transitions.
[2024-05-30 01:34:55] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2024-05-30 01:34:55] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 01:34:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 01:34:55] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2024-05-30 01:34:55] [INFO ] Invariant cache hit.
[2024-05-30 01:34:55] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-30 01:34:55] [INFO ] Redundant transitions in 32 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 01:34:55] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2024-05-30 01:34:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/46 variables, and 22 constraints, problems are : Problem set: 0 solved, 14 unsolved in 203 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/44 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/45 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 283 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 498ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/147 places, 29/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 657 ms. Remains : 22/147 places, 29/186 transitions.
[2024-05-30 01:34:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:34:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:34:56] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 01:34:56] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:34:56] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:34:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3346875846046711730.gal : 1 ms
[2024-05-30 01:34:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14700640927514422264.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/CTLFireability3346875846046711730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14700640927514422264.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,17664,0.007662,3464,2,80,5,445,6,0,103,356,0


Converting to forward existential form...Done !
original formula: AG(A((p186!=1) U (p107!=1)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!((p107!=1))) * (!((p186!=1)) * !((p107!=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!((p107!...170
Hit Full ! (commute/partial/dont) 27/0/2
(forward)formula 0,0,0.015987,3780,1,0,8,1870,20,2,509,1497,8
FORMULA SmartHome-PT-11-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 134 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 134 transition count 173
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 127 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 127 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 127 transition count 165
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 124 transition count 162
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 124 transition count 162
Applied a total of 47 rules in 14 ms. Remains 124 /147 variables (removed 23) and now considering 162/186 (removed 24) transitions.
// Phase 1: matrix 162 rows 124 cols
[2024-05-30 01:34:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:34:56] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 01:34:56] [INFO ] Invariant cache hit.
[2024-05-30 01:34:56] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 01:34:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 127 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5766 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/286 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 161/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 288 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 11272ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 11275ms
Starting structural reductions in LTL mode, iteration 1 : 124/147 places, 162/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11445 ms. Remains : 124/147 places, 162/186 transitions.
[2024-05-30 01:35:07] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:35:07] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:35:07] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 01:35:07] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:35:07] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:35:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4265131532514771615.gal : 7 ms
[2024-05-30 01:35:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17383503394341676169.ctl : 3 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/CTLFireability4265131532514771615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17383503394341676169.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,8.28913e+09,0.173415,8724,2,1526,5,22454,6,0,654,24965,0


Converting to forward existential form...Done !
original formula: EF((EX(A((p169==1) U (p178==1))) * (((p117==0)||(p232==0)) + (EX(((p117==0)||(p232==0))) * EX((p58==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EX(!((E(!((p178==1)) U (!((p169==1)) * !((p178==1)))) + EG(!((p178==1))))))) * ((p117==0)|...335
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t60, t63, t80, t83, t100, t103, t115, t119, t136, t139, t142, t144, t148, ...255
(forward)formula 0,1,6.56002,171476,1,0,552,1.02907e+06,352,316,3647,1.13777e+06,700
FORMULA SmartHome-PT-11-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 186/186 transitions.
Graph (trivial) has 144 edges and 147 vertex of which 68 / 147 are part of one of the 6 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 84 transition count 75
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 73 place count 54 transition count 63
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 80 place count 48 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 47 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 81 place count 47 transition count 59
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 44 transition count 59
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 91 place count 40 transition count 55
Iterating global reduction 4 with 4 rules applied. Total rules applied 95 place count 40 transition count 55
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 127 place count 24 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 24 transition count 38
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 130 place count 23 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 140 place count 23 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 142 place count 21 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 142 place count 21 transition count 26
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 144 place count 20 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 19 transition count 25
Applied a total of 145 rules in 22 ms. Remains 19 /147 variables (removed 128) and now considering 25/186 (removed 161) transitions.
[2024-05-30 01:35:14] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 19 cols
[2024-05-30 01:35:14] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 01:35:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 01:35:14] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2024-05-30 01:35:14] [INFO ] Invariant cache hit.
[2024-05-30 01:35:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-30 01:35:14] [INFO ] Redundant transitions in 32 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 01:35:14] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2024-05-30 01:35:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/39 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 233 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 403ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/147 places, 25/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 551 ms. Remains : 19/147 places, 25/186 transitions.
[2024-05-30 01:35:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:35:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:35:14] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-30 01:35:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:35:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:35:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7173666757456785277.gal : 1 ms
[2024-05-30 01:35:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13655939444274502873.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/CTLFireability7173666757456785277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13655939444274502873.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,6624,0.008091,3436,2,53,5,283,6,0,86,273,0


Converting to forward existential form...Done !
original formula: AG(EF((p221==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p221==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t16, t19, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,1,0.023442,3752,1,0,50,2500,65,22,496,2218,54
FORMULA SmartHome-PT-11-CTLFireability-2024-10 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 : 147/147 places, 186/186 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 136 transition count 175
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 136 transition count 175
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 131 transition count 170
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 131 transition count 170
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 128 transition count 167
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 128 transition count 167
Applied a total of 38 rules in 17 ms. Remains 128 /147 variables (removed 19) and now considering 167/186 (removed 19) transitions.
// Phase 1: matrix 167 rows 128 cols
[2024-05-30 01:35:14] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:35:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 01:35:14] [INFO ] Invariant cache hit.
[2024-05-30 01:35:15] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-30 01:35:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/295 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 131 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/295 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 166/297 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 297 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5914 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 12629ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12634ms
Starting structural reductions in LTL mode, iteration 1 : 128/147 places, 167/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12914 ms. Remains : 128/147 places, 167/186 transitions.
[2024-05-30 01:35:27] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:35:27] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:35:27] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-30 01:35:27] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:35:27] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:35:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2184838078996786863.gal : 3 ms
[2024-05-30 01:35:27] [INFO ] Time to serialize properties into /tmp/CTLFireability18371990532269282972.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/CTLFireability2184838078996786863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18371990532269282972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EX(((EG(AX((p184==0))) + (p162==0)) + ((p28==0) + ((p181==0) * EX((p34==0)))))) * EG(AX((p158==0))))
=> equivalent forward existential formula: [FwdG((Init * EX(((EG(!(EX(!((p184==0))))) + (p162==0)) + ((p28==0) + ((p181==0) * EX((p34==0))))))),!(EX(!((p15...174
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t64, t67, t84, t87, t104, t107, t119, t122, t141, t144, t147, t149, t153, ...255
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.3033,715824,1,0,905,3.2001e+06,369,625,3947,5.70775e+06,902
FORMULA SmartHome-PT-11-CTLFireability-2023-12 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 : 147/147 places, 186/186 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 135 transition count 174
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 135 transition count 174
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 129 transition count 168
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 129 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 126 transition count 165
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 126 transition count 165
Applied a total of 42 rules in 13 ms. Remains 126 /147 variables (removed 21) and now considering 165/186 (removed 21) transitions.
// Phase 1: matrix 165 rows 126 cols
[2024-05-30 01:35:57] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:35:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 01:35:57] [INFO ] Invariant cache hit.
[2024-05-30 01:35:57] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-30 01:35:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/291 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 129 constraints, problems are : Problem set: 0 solved, 164 unsolved in 7080 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/291 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 164/293 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 293 constraints, problems are : Problem set: 0 solved, 164 unsolved in 6574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 13700ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 13704ms
Starting structural reductions in LTL mode, iteration 1 : 126/147 places, 165/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13966 ms. Remains : 126/147 places, 165/186 transitions.
[2024-05-30 01:36:11] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:36:11] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:36:11] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-30 01:36:11] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:36:11] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:36:11] [INFO ] Time to serialize gal into /tmp/CTLFireability599505233374048484.gal : 2 ms
[2024-05-30 01:36:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16379687791985368570.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/CTLFireability599505233374048484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16379687791985368570.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,9.79534e+09,0.203925,7420,2,1284,5,16189,6,0,665,17289,0


Converting to forward existential form...Done !
original formula: EX(AF((EG(((p48==0)&&(p161==0))) * AF(!(E((p0==1) U (p95==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((EG(((p48==0)&&(p161==0))) * !(EG(!(!(E((p0==1) U (p95==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t62, t65, t82, t85, t105, t108, t120, t139, t142, t145, t147, t151, Inter...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.33042,160660,1,0,632,937256,366,368,3892,1.14373e+06,786
FORMULA SmartHome-PT-11-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 186/186 transitions.
Graph (trivial) has 146 edges and 147 vertex of which 75 / 147 are part of one of the 6 SCC in 1 ms
Free SCC test removed 69 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 77 transition count 68
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 39 rules applied. Total rules applied 68 place count 49 transition count 57
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 73 place count 44 transition count 57
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 44 transition count 55
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 42 transition count 55
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 38 transition count 51
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 38 transition count 51
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 113 place count 24 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 123 place count 24 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 22 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 125 place count 22 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 20 transition count 25
Applied a total of 129 rules in 26 ms. Remains 20 /147 variables (removed 127) and now considering 25/186 (removed 161) transitions.
[2024-05-30 01:36:17] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 20 cols
[2024-05-30 01:36:17] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:36:17] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 01:36:17] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2024-05-30 01:36:17] [INFO ] Invariant cache hit.
[2024-05-30 01:36:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-30 01:36:17] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-30 01:36:17] [INFO ] Redundant transitions in 34 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-30 01:36:17] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2024-05-30 01:36:17] [INFO ] Invariant cache hit.
[2024-05-30 01:36:17] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 33 constraints, problems are : Problem set: 0 solved, 24 unsolved in 534 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 24/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 57 constraints, problems are : Problem set: 0 solved, 24 unsolved in 523 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 1083ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1085ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/147 places, 25/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1240 ms. Remains : 20/147 places, 25/186 transitions.
[2024-05-30 01:36:18] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:36:19] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:36:19] [INFO ] Input system was already deterministic with 25 transitions.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-11-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:36:19] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:36:19] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:36:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3126309252924804054.gal : 12 ms
[2024-05-30 01:36:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4578768428185155197.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/ReachabilityCardinality3126309252924804054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4578768428185155197.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 01:36:19] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:36:19] [INFO ] Flatten gal took : 15 ms
Total runtime 119517 ms.

BK_STOP 1717032979199

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

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