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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K 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 16K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 03:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 03:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 03:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 03:40 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 92K 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-13-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-13-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717033572681

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 01:46:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:46:15] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-05-30 01:46:15] [INFO ] Transformed 385 places.
[2024-05-30 01:46:15] [INFO ] Transformed 407 transitions.
[2024-05-30 01:46:15] [INFO ] Found NUPN structural information;
[2024-05-30 01:46:15] [INFO ] Parsed PT model containing 385 places and 407 transitions and 935 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Deduced a syphon composed of 113 places in 11 ms
Reduce places removed 113 places and 88 transitions.
FORMULA SmartHome-PT-13-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 319/319 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 264 transition count 319
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 62 place count 210 transition count 265
Iterating global reduction 1 with 54 rules applied. Total rules applied 116 place count 210 transition count 265
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 123 place count 210 transition count 258
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 136 place count 197 transition count 245
Iterating global reduction 2 with 13 rules applied. Total rules applied 149 place count 197 transition count 245
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 159 place count 187 transition count 235
Iterating global reduction 2 with 10 rules applied. Total rules applied 169 place count 187 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 187 transition count 234
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 185 transition count 232
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 185 transition count 232
Applied a total of 174 rules in 179 ms. Remains 185 /272 variables (removed 87) and now considering 232/319 (removed 87) transitions.
// Phase 1: matrix 232 rows 185 cols
[2024-05-30 01:46:15] [INFO ] Computed 5 invariants in 19 ms
[2024-05-30 01:46:16] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-30 01:46:16] [INFO ] Invariant cache hit.
[2024-05-30 01:46:16] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-30 01:46:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 3/185 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/417 variables, 185/190 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/417 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 190 constraints, problems are : Problem set: 0 solved, 231 unsolved in 13188 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 3/185 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/417 variables, 185/190 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 231/421 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/417 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 421 constraints, problems are : Problem set: 0 solved, 231 unsolved in 11994 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
After SMT, in 25375ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 25414ms
Starting structural reductions in LTL mode, iteration 1 : 185/272 places, 232/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26492 ms. Remains : 185/272 places, 232/319 transitions.
Support contains 45 out of 185 places after structural reductions.
[2024-05-30 01:46:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-30 01:46:42] [INFO ] Flatten gal took : 94 ms
FORMULA SmartHome-PT-13-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:46:42] [INFO ] Flatten gal took : 40 ms
[2024-05-30 01:46:42] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 32 out of 185 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (227 resets) in 1620 ms. (24 steps per ms) remains 1/20 properties
BEST_FIRST walk for 30469 steps (6 resets) in 273 ms. (111 steps per ms) remains 0/1 properties
[2024-05-30 01:46:43] [INFO ] Flatten gal took : 27 ms
[2024-05-30 01:46:43] [INFO ] Flatten gal took : 24 ms
[2024-05-30 01:46:43] [INFO ] Input system was already deterministic with 232 transitions.
Computed a total of 43 stabilizing places and 41 stable transitions
Graph (complete) has 288 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 232
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 159 transition count 208
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 159 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 159 transition count 207
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 154 transition count 202
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 154 transition count 202
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 149 transition count 197
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 149 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 149 transition count 196
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 146 transition count 193
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 146 transition count 193
Applied a total of 78 rules in 26 ms. Remains 146 /185 variables (removed 39) and now considering 193/232 (removed 39) transitions.
// Phase 1: matrix 193 rows 146 cols
[2024-05-30 01:46:43] [INFO ] Computed 3 invariants in 10 ms
[2024-05-30 01:46:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 01:46:43] [INFO ] Invariant cache hit.
[2024-05-30 01:46:43] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 149 constraints, problems are : Problem set: 0 solved, 192 unsolved in 8702 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/339 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 192/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 341 constraints, problems are : Problem set: 0 solved, 192 unsolved in 8377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 17133ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 17138ms
Starting structural reductions in LTL mode, iteration 1 : 146/185 places, 193/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17411 ms. Remains : 146/185 places, 193/232 transitions.
[2024-05-30 01:47:01] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:47:01] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:47:01] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:47:01] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:47:01] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:47:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality5863186452916796869.gal : 7 ms
[2024-05-30 01:47:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality17500482497808543243.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/CTLCardinality5863186452916796869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17500482497808543243.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(EF(AG((p0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U !(E(TRUE U !((p0==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
(forward)formula 0,1,2.06093,52620,1,0,239,257654,408,168,4394,236859,398
FORMULA SmartHome-PT-13-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 232
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 160 transition count 209
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 160 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 160 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 156 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 156 transition count 204
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 152 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 152 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 152 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 150 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 150 transition count 197
Applied a total of 70 rules in 20 ms. Remains 150 /185 variables (removed 35) and now considering 197/232 (removed 35) transitions.
// Phase 1: matrix 197 rows 150 cols
[2024-05-30 01:47:03] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 01:47:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 01:47:03] [INFO ] Invariant cache hit.
[2024-05-30 01:47:03] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 01:47:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/347 variables, 150/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 153 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8866 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/347 variables, 150/153 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 196/349 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 349 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8338 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 17244ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 17247ms
Starting structural reductions in LTL mode, iteration 1 : 150/185 places, 197/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17524 ms. Remains : 150/185 places, 197/232 transitions.
[2024-05-30 01:47:20] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:47:20] [INFO ] Flatten gal took : 19 ms
[2024-05-30 01:47:20] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-30 01:47:21] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:47:21] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:47:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality18000149055605289349.gal : 6 ms
[2024-05-30 01:47:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1403896488429624256.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/CTLCardinality18000149055605289349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1403896488429624256.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EF(EX((p67==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX((p67==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t152, t169, t172, t175, t177,...262
(forward)formula 0,0,2.5777,61972,1,0,249,328428,415,173,4495,283793,408
FORMULA SmartHome-PT-13-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Graph (trivial) has 176 edges and 185 vertex of which 81 / 185 are part of one of the 7 SCC in 5 ms
Free SCC test removed 74 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Graph (complete) has 187 edges and 111 vertex of which 109 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 108 transition count 98
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 80 place count 72 transition count 92
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 69 transition count 89
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 3 with 5 rules applied. Total rules applied 91 place count 66 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 65 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 92 place count 65 transition count 83
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 100 place count 61 transition count 83
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 105 place count 56 transition count 78
Iterating global reduction 5 with 5 rules applied. Total rules applied 110 place count 56 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 111 place count 56 transition count 77
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 147 place count 38 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 148 place count 38 transition count 58
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 149 place count 37 transition count 57
Iterating global reduction 7 with 1 rules applied. Total rules applied 150 place count 37 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 152 place count 36 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 162 place count 36 transition count 46
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 163 place count 36 transition count 46
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 164 place count 36 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 166 place count 34 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 168 place count 32 transition count 43
Applied a total of 168 rules in 61 ms. Remains 32 /185 variables (removed 153) and now considering 43/232 (removed 189) transitions.
[2024-05-30 01:47:23] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
// Phase 1: matrix 37 rows 32 cols
[2024-05-30 01:47:23] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:47:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 01:47:23] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
[2024-05-30 01:47:23] [INFO ] Invariant cache hit.
[2024-05-30 01:47:23] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-30 01:47:23] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-30 01:47:23] [INFO ] Redundant transitions in 37 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-30 01:47:23] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
[2024-05-30 01:47:23] [INFO ] Invariant cache hit.
[2024-05-30 01:47:23] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 36/67 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/68 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 44 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1258 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 36/67 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 42/84 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 1/68 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/69 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/69 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 86 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1217 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 32/32 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 2491ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2492ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/185 places, 43/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2714 ms. Remains : 32/185 places, 43/232 transitions.
[2024-05-30 01:47:26] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:47:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:47:26] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-30 01:47:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:47:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:47:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality649902951897361219.gal : 2 ms
[2024-05-30 01:47:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality10909354161144098361.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/CTLCardinality649902951897361219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10909354161144098361.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,317961,0.014451,3544,2,145,5,753,6,0,158,681,0


Converting to forward existential form...Done !
original formula: A(!(((p34==0)||(p86==1))) U E(EF(((p273!=1)||(p215!=1))) U A(EF(((p210==0)||(p127==1))) U EF((p197==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(E(TRUE U ((p273!=1)||(p215!=1))) U !((E(!(E(TRUE U (p197==1))) U (!(E(TRUE U ((p210==0)||(p12...610
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t11, t13, t16, t21, t23, t28, t37, t38, t39, t40, Intersection with reachable at eac...218
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.181779,8084,1,0,168,23253,111,111,988,32972,192
FORMULA SmartHome-PT-13-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 164 transition count 211
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 164 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 164 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 160 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 160 transition count 206
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 156 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 156 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 153 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 153 transition count 199
Applied a total of 65 rules in 24 ms. Remains 153 /185 variables (removed 32) and now considering 199/232 (removed 33) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-05-30 01:47:26] [INFO ] Computed 5 invariants in 2 ms
[2024-05-30 01:47:26] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-30 01:47:26] [INFO ] Invariant cache hit.
[2024-05-30 01:47:26] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-30 01:47:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 3/153 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/352 variables, 153/158 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 158 constraints, problems are : Problem set: 0 solved, 198 unsolved in 9824 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 3/153 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/352 variables, 153/158 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 198/356 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/352 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 356 constraints, problems are : Problem set: 0 solved, 198 unsolved in 9035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 18922ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 18926ms
Starting structural reductions in LTL mode, iteration 1 : 153/185 places, 199/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19256 ms. Remains : 153/185 places, 199/232 transitions.
[2024-05-30 01:47:45] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:47:45] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:47:45] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-30 01:47:45] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:47:45] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:47:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8092892732292234448.gal : 13 ms
[2024-05-30 01:47:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality2455270526799098050.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/CTLCardinality8092892732292234448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2455270526799098050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(((EF(((p65==0)||(p280==1))) + E(((p42==0)&&(p236==0)) U A((p239==0) U ((p169==0)||(p101==1))))) + AX(AX(((p179==0)||(p370==1))))))
=> equivalent forward existential formula: [(EY(EY((FwdU(Init,TRUE) * !((E(TRUE U ((p65==0)||(p280==1))) + E(((p42==0)&&(p236==0)) U !((E(!(((p169==0)||(p1...287
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t95, t98, t115, t119, t136, t139, t151, t155, t174, t177, t183, ...254
(forward)formula 0,1,3.76014,99132,1,0,355,536737,437,228,4712,507719,543
FORMULA SmartHome-PT-13-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 232
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 160 transition count 209
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 160 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 160 transition count 208
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 155 transition count 203
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 155 transition count 203
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 198
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 150 transition count 197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 147 transition count 194
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 147 transition count 194
Applied a total of 76 rules in 13 ms. Remains 147 /185 variables (removed 38) and now considering 194/232 (removed 38) transitions.
// Phase 1: matrix 194 rows 147 cols
[2024-05-30 01:47:49] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:47:49] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 01:47:49] [INFO ] Invariant cache hit.
[2024-05-30 01:47:49] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-30 01:47:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9470 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/341 variables, 147/150 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 193/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 8007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 17527ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 17532ms
Starting structural reductions in LTL mode, iteration 1 : 147/185 places, 194/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17776 ms. Remains : 147/185 places, 194/232 transitions.
[2024-05-30 01:48:07] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:48:07] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:48:07] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-30 01:48:07] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:48:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:48:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality17365295305071770005.gal : 2 ms
[2024-05-30 01:48:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality10839956132466674697.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/CTLCardinality17365295305071770005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10839956132466674697.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AG((p46==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p46==0)))] = FALSE
(forward)formula 0,0,0.503192,12060,1,0,10,37639,10,2,1494,41947,4
FORMULA SmartHome-PT-13-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Graph (trivial) has 186 edges and 185 vertex of which 100 / 185 are part of one of the 7 SCC in 1 ms
Free SCC test removed 93 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Graph (complete) has 164 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 89 transition count 82
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 66 place count 60 transition count 76
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 57 transition count 76
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 69 place count 57 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 54 transition count 73
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 83 place count 46 transition count 65
Iterating global reduction 3 with 8 rules applied. Total rules applied 91 place count 46 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 46 transition count 64
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 132 place count 26 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 26 transition count 43
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 25 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 25 transition count 42
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 137 place count 24 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 149 place count 24 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 151 place count 22 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 151 place count 22 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 153 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 154 place count 20 transition count 27
Applied a total of 154 rules in 25 ms. Remains 20 /185 variables (removed 165) and now considering 27/232 (removed 205) transitions.
[2024-05-30 01:48:08] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 20 cols
[2024-05-30 01:48:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:48:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 01:48:08] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 01:48:08] [INFO ] Invariant cache hit.
[2024-05-30 01:48:08] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-30 01:48:08] [INFO ] Redundant transitions in 34 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 01:48:08] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 01:48:08] [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) 1/36 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/41 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 200 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 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, 10/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (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/41 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 290 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 496ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/185 places, 27/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 672 ms. Remains : 20/185 places, 27/232 transitions.
[2024-05-30 01:48:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:48:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:48:08] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 40 steps (3 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-13-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:48:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:48:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:48:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5147391028575857071.gal : 1 ms
[2024-05-30 01:48:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17652652724562522599.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/ReachabilityCardinality5147391028575857071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17652652724562522599.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 232
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 160 transition count 209
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 160 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 160 transition count 208
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 155 transition count 203
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 155 transition count 203
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 198
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 150 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 148 transition count 195
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 148 transition count 195
Applied a total of 74 rules in 19 ms. Remains 148 /185 variables (removed 37) and now considering 195/232 (removed 37) transitions.
// Phase 1: matrix 195 rows 148 cols
[2024-05-30 01:48:08] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:48:08] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 01:48:08] [INFO ] Invariant cache hit.
[2024-05-30 01:48:09] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-30 01:48:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 194 unsolved in 8364 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 194/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 345 constraints, problems are : Problem set: 0 solved, 194 unsolved in 8088 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 16507ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 16512ms
Starting structural reductions in LTL mode, iteration 1 : 148/185 places, 195/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16806 ms. Remains : 148/185 places, 195/232 transitions.
[2024-05-30 01:48:25] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:48:25] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:48:25] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-30 01:48:25] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:48:25] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:48:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16954214000834465589.gal : 2 ms
[2024-05-30 01:48:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality1752110096550130242.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/CTLCardinality16954214000834465589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1752110096550130242.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AX(AX(AG((p55==0)))))
=> equivalent forward existential formula: [(FwdU(EY(EY(EY(Init))),TRUE) * !((p55==0)))] = FALSE
(forward)formula 0,0,0.527568,11804,1,0,12,36403,10,2,1514,40233,6
FORMULA SmartHome-PT-13-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 232
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 160 transition count 209
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 160 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 160 transition count 208
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 155 transition count 203
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 155 transition count 203
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 150 transition count 198
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 150 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 150 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 148 transition count 195
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 148 transition count 195
Applied a total of 74 rules in 15 ms. Remains 148 /185 variables (removed 37) and now considering 195/232 (removed 37) transitions.
// Phase 1: matrix 195 rows 148 cols
[2024-05-30 01:48:26] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:48:26] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 01:48:26] [INFO ] Invariant cache hit.
[2024-05-30 01:48:26] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-30 01:48:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 151 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9551 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/343 variables, 148/151 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 194/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 345 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 17461ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 17465ms
Starting structural reductions in LTL mode, iteration 1 : 148/185 places, 195/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17767 ms. Remains : 148/185 places, 195/232 transitions.
[2024-05-30 01:48:43] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:48:44] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:48:44] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-30 01:48:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:48:44] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:48:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality17253043884399757672.gal : 2 ms
[2024-05-30 01:48:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3972970967895802746.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/CTLCardinality17253043884399757672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3972970967895802746.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(EX(((p88==0)&&(p275==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((p88==0)&&(p275==1)))] != FALSE
(forward)formula 0,1,0.311301,12068,1,0,8,37438,8,1,1253,40119,2
FORMULA SmartHome-PT-13-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 232
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 163 transition count 212
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 163 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 163 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 159 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 159 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 155 transition count 203
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 155 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 152 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 152 transition count 200
Applied a total of 65 rules in 7 ms. Remains 152 /185 variables (removed 33) and now considering 200/232 (removed 32) transitions.
// Phase 1: matrix 200 rows 152 cols
[2024-05-30 01:48:44] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:48:44] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 01:48:44] [INFO ] Invariant cache hit.
[2024-05-30 01:48:44] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-30 01:48:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/352 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 155 constraints, problems are : Problem set: 0 solved, 199 unsolved in 9950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/352 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 199/354 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/352 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 354 constraints, problems are : Problem set: 0 solved, 199 unsolved in 8687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 18660ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 18662ms
Starting structural reductions in LTL mode, iteration 1 : 152/185 places, 200/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18849 ms. Remains : 152/185 places, 200/232 transitions.
[2024-05-30 01:49:03] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:49:03] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:49:03] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-30 01:49:03] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:49:03] [INFO ] Flatten gal took : 21 ms
[2024-05-30 01:49:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality5258524330211713314.gal : 2 ms
[2024-05-30 01:49:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality10200721660120167351.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/CTLCardinality5258524330211713314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10200721660120167351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EX(AF(AG(AF((p191==0))))) * AG(EX((((p112==0) + EF((p234==0))) + ((p168==0)||((p118==0)&&(p306==0)))))))
=> equivalent forward existential formula: ([(Init * !(EX(!(EG(!(!(E(TRUE U !(!(EG(!((p191==0)))))))))))))] = FALSE * [(FwdU(Init,TRUE) * !(EX((((p112==0) ...229
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t28, t32, t61, t97, t100, t117, t121, t138, t141, t153, t172, t175, t178, t180, ...261
(forward)formula 0,0,2.43978,66784,1,0,251,330718,423,176,4583,302972,414
FORMULA SmartHome-PT-13-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 232/232 transitions.
Graph (trivial) has 181 edges and 185 vertex of which 90 / 185 are part of one of the 7 SCC in 1 ms
Free SCC test removed 83 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Graph (complete) has 177 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 99 transition count 91
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 74 place count 66 transition count 85
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 63 transition count 83
Reduce places removed 2 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 4 rules applied. Total rules applied 83 place count 61 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 60 transition count 81
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 84 place count 60 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 90 place count 57 transition count 78
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 98 place count 49 transition count 70
Iterating global reduction 5 with 8 rules applied. Total rules applied 106 place count 49 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 49 transition count 69
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 147 place count 29 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 148 place count 29 transition count 48
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 149 place count 28 transition count 47
Iterating global reduction 7 with 1 rules applied. Total rules applied 150 place count 28 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 152 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 164 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 166 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 166 place count 25 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 168 place count 24 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 169 place count 23 transition count 32
Applied a total of 169 rules in 17 ms. Remains 23 /185 variables (removed 162) and now considering 32/232 (removed 200) transitions.
[2024-05-30 01:49:05] [INFO ] Flow matrix only has 26 transitions (discarded 6 similar events)
// Phase 1: matrix 26 rows 23 cols
[2024-05-30 01:49:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 01:49:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 01:49:05] [INFO ] Flow matrix only has 26 transitions (discarded 6 similar events)
[2024-05-30 01:49:05] [INFO ] Invariant cache hit.
[2024-05-30 01:49:05] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-30 01:49:05] [INFO ] Redundant transitions in 26 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 01:49:05] [INFO ] Flow matrix only has 26 transitions (discarded 6 similar events)
[2024-05-30 01:49:05] [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) 23/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/46 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/49 variables, and 23 constraints, problems are : Problem set: 0 solved, 14 unsolved in 204 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 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) 23/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/46 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/49 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 194 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 403ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/185 places, 32/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 528 ms. Remains : 23/185 places, 32/232 transitions.
[2024-05-30 01:49:06] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:49:06] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:49:06] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-30 01:49:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:49:06] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:49:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12540893150828832990.gal : 1 ms
[2024-05-30 01:49:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14877284498898915501.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/CTLCardinality12540893150828832990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14877284498898915501.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,39744,0.006439,3484,2,67,5,350,6,0,108,328,0


Converting to forward existential form...Done !
original formula: EF((EF((p89==0)) * AG(((p260==0)||(p212==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(TRUE U (p89==0))) * !(E(TRUE U !(((p260==0)||(p212==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t16, t22, t27, t28, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,1,0.021797,4328,1,0,64,3912,80,32,613,3454,75
FORMULA SmartHome-PT-13-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 01:49:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:49:06] [INFO ] Flatten gal took : 7 ms
Total runtime 171436 ms.

BK_STOP 1717033746407

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-13"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-13, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683811500433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-13.tgz
mv SmartHome-PT-13 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;