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

--------------------
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-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-13-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-13-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-13-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-13-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-13-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717033648748

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:47:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:47:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:47:31] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-30 01:47:31] [INFO ] Transformed 385 places.
[2024-05-30 01:47:31] [INFO ] Transformed 407 transitions.
[2024-05-30 01:47:31] [INFO ] Found NUPN structural information;
[2024-05-30 01:47:31] [INFO ] Parsed PT model containing 385 places and 407 transitions and 935 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 113 places in 9 ms
Reduce places removed 113 places and 88 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-13-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 319/319 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 262 transition count 319
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 76 place count 196 transition count 253
Iterating global reduction 1 with 66 rules applied. Total rules applied 142 place count 196 transition count 253
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 149 place count 196 transition count 246
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 161 place count 184 transition count 234
Iterating global reduction 2 with 12 rules applied. Total rules applied 173 place count 184 transition count 234
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 180 place count 177 transition count 227
Iterating global reduction 2 with 7 rules applied. Total rules applied 187 place count 177 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 189 place count 175 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 175 transition count 225
Applied a total of 191 rules in 155 ms. Remains 175 /272 variables (removed 97) and now considering 225/319 (removed 94) transitions.
// Phase 1: matrix 225 rows 175 cols
[2024-05-30 01:47:32] [INFO ] Computed 3 invariants in 32 ms
[2024-05-30 01:47:32] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-30 01:47:32] [INFO ] Invariant cache hit.
[2024-05-30 01:47:32] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-30 01:47:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/400 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 178 constraints, problems are : Problem set: 0 solved, 224 unsolved in 11280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/400 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 224/402 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 402 constraints, problems are : Problem set: 0 solved, 224 unsolved in 11355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 22799ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 22836ms
Starting structural reductions in LTL mode, iteration 1 : 175/272 places, 225/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23853 ms. Remains : 175/272 places, 225/319 transitions.
Support contains 53 out of 175 places after structural reductions.
[2024-05-30 01:47:56] [INFO ] Flatten gal took : 54 ms
[2024-05-30 01:47:56] [INFO ] Flatten gal took : 21 ms
[2024-05-30 01:47:56] [INFO ] Input system was already deterministic with 225 transitions.
Support contains 46 out of 175 places (down from 53) after GAL structural reductions.
FORMULA SmartHome-PT-13-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (226 resets) in 2128 ms. (18 steps per ms) remains 3/37 properties
BEST_FIRST walk for 40004 steps (37 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (38 resets) in 121 ms. (327 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (28 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
[2024-05-30 01:47:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/54 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 97/151 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 109/260 variables, 50/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/261 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 14 (OVERLAPS) 67/328 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/376 variables, 25/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/376 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/394 variables, 12/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/394 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/400 variables, 4/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/400 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/400 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 178 constraints, problems are : Problem set: 1 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/22 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/57 variables, 10/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 47/104 variables, 19/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/107 variables, 2/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/189 variables, 29/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 93/282 variables, 42/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/283 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 1/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 57/340 variables, 33/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/340 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 39/379 variables, 21/166 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/379 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 15/394 variables, 9/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/394 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/400 variables, 4/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/400 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/400 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 179 constraints, problems are : Problem set: 1 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 225/225 transitions.
Graph (trivial) has 177 edges and 175 vertex of which 84 / 175 are part of one of the 6 SCC in 3 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 112 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 115 transitions.
Graph (complete) has 151 edges and 97 vertex of which 93 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 93 transition count 66
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 58 transition count 59
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 55 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 89 place count 55 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 99 place count 50 transition count 54
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 104 place count 45 transition count 49
Iterating global reduction 3 with 5 rules applied. Total rules applied 109 place count 45 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 45 transition count 48
Performed 22 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 154 place count 23 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 38 edges and 23 vertex of which 15 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 4 with 8 rules applied. Total rules applied 162 place count 15 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 164 place count 15 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 14 transition count 11
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 171 place count 10 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 173 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 173 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 177 place count 6 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 178 place count 5 transition count 6
Applied a total of 178 rules in 42 ms. Remains 5 /175 variables (removed 170) and now considering 6/225 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 5/175 places, 6/225 transitions.
RANDOM walk for 42 steps (6 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-30 01:47:57] [INFO ] Flatten gal took : 14 ms
[2024-05-30 01:47:57] [INFO ] Flatten gal took : 16 ms
[2024-05-30 01:47:57] [INFO ] Input system was already deterministic with 225 transitions.
Computed a total of 43 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 209
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 159 transition count 206
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 154 transition count 201
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 154 transition count 201
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 150 transition count 197
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 150 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 149 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 149 transition count 196
Applied a total of 55 rules in 17 ms. Remains 149 /175 variables (removed 26) and now considering 196/225 (removed 29) transitions.
// Phase 1: matrix 196 rows 149 cols
[2024-05-30 01:47:57] [INFO ] Computed 3 invariants in 6 ms
[2024-05-30 01:47:57] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 01:47:57] [INFO ] Invariant cache hit.
[2024-05-30 01:47:58] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 01:47:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/345 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 152 constraints, problems are : Problem set: 0 solved, 195 unsolved in 8674 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/345 variables, 149/152 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 195/347 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 347 constraints, problems are : Problem set: 0 solved, 195 unsolved in 8072 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 16796ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 16804ms
Starting structural reductions in LTL mode, iteration 1 : 149/175 places, 196/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17014 ms. Remains : 149/175 places, 196/225 transitions.
[2024-05-30 01:48:14] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:48:14] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:48:14] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-30 01:48:14] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:48:14] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:48:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6679645704669491106.gal : 9 ms
[2024-05-30 01:48:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1983073185512818447.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/CTLFireability6679645704669491106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1983073185512818447.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.10028e+11,0.40388,11468,2,2261,5,35917,6,0,787,38566,0


Converting to forward existential form...Done !
original formula: !(E(A(!(AG((p246==1))) U AX((p99==1))) U !(AX(EF((((p286==1)&&(p254==1))&&(p291==1)))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,!((E(!(!(EX(!((p99==1))))) U (!(!(!(E(TRUE U !((p246==1)))))) * !(!(EX(!((p99==1))))))) + EG(!(!(...238
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t137, t149, t168, t171, t174, t176,...262
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.93699,77016,1,0,293,419986,429,200,4844,386115,469
FORMULA SmartHome-PT-13-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 208
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 158 transition count 205
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 152 transition count 199
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 152 transition count 199
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 147 transition count 194
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 147 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 146 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 146 transition count 193
Applied a total of 61 rules in 17 ms. Remains 146 /175 variables (removed 29) and now considering 193/225 (removed 32) transitions.
// Phase 1: matrix 193 rows 146 cols
[2024-05-30 01:48:17] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:48:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 01:48:18] [INFO ] Invariant cache hit.
[2024-05-30 01:48:18] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:48:18] [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 8724 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 8436 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 17211ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 17215ms
Starting structural reductions in LTL mode, iteration 1 : 146/175 places, 193/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17444 ms. Remains : 146/175 places, 193/225 transitions.
[2024-05-30 01:48:35] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:48:35] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:48:35] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:48:35] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:48:35] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:48:35] [INFO ] Time to serialize gal into /tmp/CTLFireability12148946614645612386.gal : 6 ms
[2024-05-30 01:48:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6427044564611083798.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/CTLFireability12148946614645612386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6427044564611083798.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.416733,11264,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U !(EF(((AG((p236==1)) * ((((p2==1)&&(p254==1))&&(p236==1))||((p2==1)&&(p286==1)))) * ((p66!=1)||(!((p66==1)&&(p291==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,EX(TRUE)) * !(E(TRUE U ((!(E(TRUE U !((p236==1)))) * ((((p2==1)&&(p254==1))&&(p236==1))||((p2==1)&&(...219
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,28.2618,722544,1,0,584,2.60905e+06,414,430,4522,6.06063e+06,797
FORMULA SmartHome-PT-13-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 164 transition count 214
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 164 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 164 transition count 213
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 160 transition count 209
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 160 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 158 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 158 transition count 207
Applied a total of 35 rules in 12 ms. Remains 158 /175 variables (removed 17) and now considering 207/225 (removed 18) transitions.
// Phase 1: matrix 207 rows 158 cols
[2024-05-30 01:49:03] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:49:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 01:49:04] [INFO ] Invariant cache hit.
[2024-05-30 01:49:04] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-30 01:49:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/365 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 161 constraints, problems are : Problem set: 0 solved, 206 unsolved in 9794 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/365 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 206/367 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 367 constraints, problems are : Problem set: 0 solved, 206 unsolved in 8988 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 18844ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 18849ms
Starting structural reductions in LTL mode, iteration 1 : 158/175 places, 207/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19108 ms. Remains : 158/175 places, 207/225 transitions.
[2024-05-30 01:49:23] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:49:23] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:49:23] [INFO ] Input system was already deterministic with 207 transitions.
[2024-05-30 01:49:23] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:49:23] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:49:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4230783304081229158.gal : 2 ms
[2024-05-30 01:49:23] [INFO ] Time to serialize properties into /tmp/CTLFireability11191024136610062446.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/CTLFireability4230783304081229158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11191024136610062446.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.59816e+11,0.443436,15300,2,3346,5,52895,6,0,834,58618,0


Converting to forward existential form...Done !
original formula: ((EG(((EX((p257==1)) * AG(((p186==1)||(p112==1)))) * AG((p86==1)))) + AX(FALSE)) * (EX((((A((p243==1) U (p173==1)) + A((p170==1) U (p28==...287
=> equivalent forward existential formula: ([(EY((Init * !(EG(((EX((p257==1)) * !(E(TRUE U !(((p186==1)||(p112==1)))))) * !(E(TRUE U !((p86==1))))))))) * !...484
Reverse transition relation is NOT exact ! Due to transitions t8, t13, t30, t36, t65, t69, t101, t104, t121, t124, t141, t144, t145, t158, t177, t180, t181...275
(forward)formula 0,0,27.4585,745228,1,0,1012,4.52798e+06,472,595,4898,5.35275e+06,1299
FORMULA SmartHome-PT-13-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Graph (trivial) has 171 edges and 175 vertex of which 64 / 175 are part of one of the 6 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 116 transition count 101
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 58 rules applied. Total rules applied 105 place count 70 transition count 89
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 113 place count 64 transition count 87
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 63 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 62 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 116 place count 62 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 124 place count 58 transition count 82
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 131 place count 51 transition count 75
Iterating global reduction 5 with 7 rules applied. Total rules applied 138 place count 51 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 139 place count 51 transition count 74
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 177 place count 32 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 181 place count 32 transition count 50
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 183 place count 31 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 187 place count 29 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 193 place count 29 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 194 place count 28 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 194 place count 28 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 196 place count 27 transition count 40
Applied a total of 196 rules in 31 ms. Remains 27 /175 variables (removed 148) and now considering 40/225 (removed 185) transitions.
[2024-05-30 01:49:50] [INFO ] Flow matrix only has 31 transitions (discarded 9 similar events)
// Phase 1: matrix 31 rows 27 cols
[2024-05-30 01:49:50] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 01:49:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 01:49:50] [INFO ] Flow matrix only has 31 transitions (discarded 9 similar events)
[2024-05-30 01:49:50] [INFO ] Invariant cache hit.
[2024-05-30 01:49:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-30 01:49:50] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-30 01:49:50] [INFO ] Redundant transitions in 32 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-30 01:49:50] [INFO ] Flow matrix only has 31 transitions (discarded 9 similar events)
[2024-05-30 01:49:50] [INFO ] Invariant cache hit.
[2024-05-30 01:49:50] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/57 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 1/58 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/58 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 37 constraints, problems are : Problem set: 0 solved, 39 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/57 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 39/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/58 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/58 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 76 constraints, problems are : Problem set: 0 solved, 39 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 1857ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1857ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/175 places, 40/225 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2008 ms. Remains : 27/175 places, 40/225 transitions.
[2024-05-30 01:49:52] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:49:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:49:52] [INFO ] Input system was already deterministic with 40 transitions.
RANDOM walk for 53 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-13-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:49:52] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:49:52] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:49:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2864862914515334076.gal : 1 ms
[2024-05-30 01:49:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8238876487693766549.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/ReachabilityCardinality2864862914515334076.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8238876487693766549.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 : 175/175 places, 225/225 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 209
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 159 transition count 206
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 153 transition count 200
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 153 transition count 200
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 149 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 149 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 148 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 148 transition count 195
Applied a total of 57 rules in 25 ms. Remains 148 /175 variables (removed 27) and now considering 195/225 (removed 30) transitions.
// Phase 1: matrix 195 rows 148 cols
[2024-05-30 01:49:52] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:49:52] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 01:49:52] [INFO ] Invariant cache hit.
[2024-05-30 01:49:53] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-30 01:49:53] [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 8850 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 8137 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 17042ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 17046ms
Starting structural reductions in LTL mode, iteration 1 : 148/175 places, 195/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17371 ms. Remains : 148/175 places, 195/225 transitions.
[2024-05-30 01:50:10] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:50:10] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:50:10] [INFO ] Input system was already deterministic with 195 transitions.
[2024-05-30 01:50:10] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:50:10] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:50:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8929537178497790186.gal : 2 ms
[2024-05-30 01:50:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16427038968632396231.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/CTLFireability8929537178497790186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16427038968632396231.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.284089,11800,2,2445,5,37438,6,0,782,40119,0


Converting to forward existential form...Done !
original formula: AX(EF((p275==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p275==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t29, t32, t61, t93, t96, t113, t116, t133, t136, t148, t167, t170, t173, t175, t179,...256
(forward)formula 0,1,2.31851,61400,1,0,239,300495,411,170,4460,269960,404
FORMULA SmartHome-PT-13-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 209
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 159 transition count 206
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 153 transition count 200
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 153 transition count 200
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 148 transition count 195
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 148 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 147 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 147 transition count 194
Applied a total of 59 rules in 16 ms. Remains 147 /175 variables (removed 28) and now considering 194/225 (removed 31) transitions.
// Phase 1: matrix 194 rows 147 cols
[2024-05-30 01:50:12] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:50:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 01:50:12] [INFO ] Invariant cache hit.
[2024-05-30 01:50:12] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-30 01:50:12] [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 9221 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 8133 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 17382ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 17384ms
Starting structural reductions in LTL mode, iteration 1 : 147/175 places, 194/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17573 ms. Remains : 147/175 places, 194/225 transitions.
[2024-05-30 01:50:30] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:50:30] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:50:30] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-30 01:50:30] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:50:30] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:50:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3886108491433166258.gal : 2 ms
[2024-05-30 01:50:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5218307822679514126.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/CTLFireability3886108491433166258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5218307822679514126.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AX((E(!(EG((p159==1))) U (EG((p223==1)) * ((p222==1)||((p2==1)&&(p159==1))))) + EF((p242==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((E(!(EG((p159==1))) U (EG((p223==1)) * ((p222==1)||((p2==1)&&(p159==1))))) + E(TRUE U (p242=...174
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t60, t92, t95, t112, t115, t132, t135, t147, t166, t169, t172, t174, t178,...256
(forward)formula 0,1,4.04693,113592,1,0,447,654824,425,293,4554,663388,624
FORMULA SmartHome-PT-13-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Graph (trivial) has 178 edges and 175 vertex of which 95 / 175 are part of one of the 7 SCC in 1 ms
Free SCC test removed 88 places
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 86 transition count 81
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 62 place count 59 transition count 74
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 66 place count 56 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 55 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 67 place count 55 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 75 place count 51 transition count 69
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 82 place count 44 transition count 62
Iterating global reduction 4 with 7 rules applied. Total rules applied 89 place count 44 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 44 transition count 61
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 5 with 36 rules applied. Total rules applied 126 place count 26 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 26 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 6 with 2 rules applied. Total rules applied 129 place count 25 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 140 place count 25 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 141 place count 24 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 141 place count 24 transition count 29
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 143 place count 23 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 144 place count 22 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 145 place count 21 transition count 28
Applied a total of 145 rules in 18 ms. Remains 21 /175 variables (removed 154) and now considering 28/225 (removed 197) transitions.
[2024-05-30 01:50:34] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 21 cols
[2024-05-30 01:50:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 01:50:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-30 01:50:34] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2024-05-30 01:50:34] [INFO ] Invariant cache hit.
[2024-05-30 01:50:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-30 01:50:34] [INFO ] Redundant transitions in 25 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-30 01:50:34] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2024-05-30 01:50:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 272 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 429ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/175 places, 28/225 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 540 ms. Remains : 21/175 places, 28/225 transitions.
[2024-05-30 01:50:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:50:34] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:50:34] [INFO ] Input system was already deterministic with 28 transitions.
RANDOM walk for 41 steps (1 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-13-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:50:34] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:50:34] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:50:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11345637693719332178.gal : 1 ms
[2024-05-30 01:50:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12864195289594025570.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11345637693719332178.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12864195289594025570.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12864195289594025570.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.010522,3604,2,25,5,84,6,0,94,40,0
Total reachable state count : 8

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Graph (trivial) has 179 edges and 175 vertex of which 95 / 175 are part of one of the 7 SCC in 1 ms
Free SCC test removed 88 places
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 86 transition count 78
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 68 place count 56 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 53 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 71 place count 53 transition count 68
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 77 place count 50 transition count 68
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 83 place count 44 transition count 62
Iterating global reduction 3 with 6 rules applied. Total rules applied 89 place count 44 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 44 transition count 61
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 128 place count 25 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 24 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 142 place count 24 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 143 place count 23 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 145 place count 21 transition count 27
Applied a total of 145 rules in 19 ms. Remains 21 /175 variables (removed 154) and now considering 27/225 (removed 198) transitions.
[2024-05-30 01:50:34] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2024-05-30 01:50:34] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 01:50:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 01:50:34] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 01:50:34] [INFO ] Invariant cache hit.
[2024-05-30 01:50:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-30 01:50:35] [INFO ] Redundant transitions in 33 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 01:50:35] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 01:50:35] [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) 1/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/36 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/42 variables, and 21 constraints, problems are : Problem set: 0 solved, 11 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 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) 1/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/36 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/39 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/42 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 566ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 566ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/175 places, 27/225 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 719 ms. Remains : 21/175 places, 27/225 transitions.
[2024-05-30 01:50:35] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:50:35] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:50:35] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-30 01:50:35] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:50:35] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:50:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10096351201229937301.gal : 1 ms
[2024-05-30 01:50:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3581956890379170530.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/CTLFireability10096351201229937301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3581956890379170530.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17664,0.009241,3452,2,56,5,296,6,0,92,264,0


Converting to forward existential form...Done !
original formula: EF(AG((p302==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p302==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t18, t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,0,0.025254,3768,1,0,52,2529,69,23,532,2081,57
FORMULA SmartHome-PT-13-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 208
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 158 transition count 205
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 152 transition count 199
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 152 transition count 199
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 147 transition count 194
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 147 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 146 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 146 transition count 193
Applied a total of 61 rules in 20 ms. Remains 146 /175 variables (removed 29) and now considering 193/225 (removed 32) transitions.
// Phase 1: matrix 193 rows 146 cols
[2024-05-30 01:50:35] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:50:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 01:50:35] [INFO ] Invariant cache hit.
[2024-05-30 01:50:35] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:50:35] [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 9204 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 8460 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 17701ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 17705ms
Starting structural reductions in LTL mode, iteration 1 : 146/175 places, 193/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17990 ms. Remains : 146/175 places, 193/225 transitions.
[2024-05-30 01:50:53] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:50:53] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:50:53] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:50:53] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:50:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:50:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12013011095227072219.gal : 2 ms
[2024-05-30 01:50:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9934103112767230303.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/CTLFireability12013011095227072219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9934103112767230303.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.344809,11264,2,2117,5,35115,6,0,772,37329,0


Converting to forward existential form...Done !
original formula: AX(AG(EX((p111==0))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX((p111==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
(forward)formula 0,0,2.296,54424,1,0,239,252593,403,167,4538,257050,396
FORMULA SmartHome-PT-13-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 209
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 159 transition count 206
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 153 transition count 200
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 153 transition count 200
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 148 transition count 195
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 148 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 147 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 147 transition count 194
Applied a total of 59 rules in 9 ms. Remains 147 /175 variables (removed 28) and now considering 194/225 (removed 31) transitions.
// Phase 1: matrix 194 rows 147 cols
[2024-05-30 01:50:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 01:50:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 01:50:56] [INFO ] Invariant cache hit.
[2024-05-30 01:50:56] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-30 01:50:56] [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 8979 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 8036 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 17054ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 17058ms
Starting structural reductions in LTL mode, iteration 1 : 147/175 places, 194/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17301 ms. Remains : 147/175 places, 194/225 transitions.
[2024-05-30 01:51:13] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:51:13] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:13] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-30 01:51:13] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:13] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4980541059588043991.gal : 2 ms
[2024-05-30 01:51:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5862304635238121294.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/CTLFireability4980541059588043991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5862304635238121294.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EX(AG(AF(AX((p236==1))))) U !(AG(((!((p254==1)&&(p334==1)))||(p251==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX(!(E(TRUE U !(!(EG(!(!(EX(!((p236==1)))))))))))),TRUE) * !(((!((p254==1)&&(p334==1)))||(p251=...171
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t32, t60, t92, t95, t112, t115, t132, t135, t147, t166, t169, t172, t174, ...261
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.6238,87872,1,0,285,457520,425,195,5021,423308,454
FORMULA SmartHome-PT-13-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 208
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 158 transition count 205
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 152 transition count 199
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 152 transition count 199
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 147 transition count 194
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 147 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 146 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 146 transition count 193
Applied a total of 61 rules in 8 ms. Remains 146 /175 variables (removed 29) and now considering 193/225 (removed 32) transitions.
// Phase 1: matrix 193 rows 146 cols
[2024-05-30 01:51:17] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:51:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 01:51:17] [INFO ] Invariant cache hit.
[2024-05-30 01:51:17] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:51:17] [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 9302 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 8156 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 17495ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 17500ms
Starting structural reductions in LTL mode, iteration 1 : 146/175 places, 193/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17758 ms. Remains : 146/175 places, 193/225 transitions.
[2024-05-30 01:51:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:34] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:51:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8293361805984580218.gal : 2 ms
[2024-05-30 01:51:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8633504847263074592.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/CTLFireability8293361805984580218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8633504847263074592.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((AG(EX(TRUE)) * (p38==0)))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(EX(TRUE)))] = FALSE * [(EY(Init) * !((p38==0)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t165, t168, t171, t173, t177,...256
(forward)formula 0,0,2.07576,51872,1,0,241,228096,404,169,4532,244386,396
FORMULA SmartHome-PT-13-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 208
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 158 transition count 205
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 152 transition count 199
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 152 transition count 199
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 147 transition count 194
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 147 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 146 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 146 transition count 193
Applied a total of 61 rules in 8 ms. Remains 146 /175 variables (removed 29) and now considering 193/225 (removed 32) transitions.
[2024-05-30 01:51:36] [INFO ] Invariant cache hit.
[2024-05-30 01:51:37] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 01:51:37] [INFO ] Invariant cache hit.
[2024-05-30 01:51:37] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-05-30 01:51:37] [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 8137 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 8086 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 16252ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 16255ms
Starting structural reductions in LTL mode, iteration 1 : 146/175 places, 193/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16451 ms. Remains : 146/175 places, 193/225 transitions.
[2024-05-30 01:51:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:53] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-30 01:51:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:51:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7213700374014412832.gal : 2 ms
[2024-05-30 01:51:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5027130302676689351.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/CTLFireability7213700374014412832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5027130302676689351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG(AX(EF(EX(((p97==1)&&(p374==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(E(TRUE U EX(((p97==1)&&(p374==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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.11007,159072,1,0,504,1.00726e+06,419,327,4763,954306,670
FORMULA SmartHome-PT-13-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 225/225 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 161 transition count 211
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 161 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 161 transition count 209
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 156 transition count 204
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 156 transition count 204
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 152 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 152 transition count 200
Applied a total of 48 rules in 4 ms. Remains 152 /175 variables (removed 23) and now considering 200/225 (removed 25) transitions.
// Phase 1: matrix 200 rows 152 cols
[2024-05-30 01:51:59] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 01:51:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 01:51:59] [INFO ] Invariant cache hit.
[2024-05-30 01:51:59] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-30 01:51:59] [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 8477 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 8843 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 17345ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 17347ms
Starting structural reductions in LTL mode, iteration 1 : 152/175 places, 200/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17533 ms. Remains : 152/175 places, 200/225 transitions.
[2024-05-30 01:52:17] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:52:17] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:52:17] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-30 01:52:17] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:52:17] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:52:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8240640446585238256.gal : 2 ms
[2024-05-30 01:52:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3460133370098585233.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/CTLFireability8240640446585238256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3460133370098585233.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.35817e+11,0.348143,10772,2,2103,5,32651,6,0,803,34513,0


Converting to forward existential form...Done !
original formula: (AX((((((p221==0) + AX((p208==0))) * EF((p184==1))) * (AX(!(E((p153==1) U (p225==1)))) * AX(((p277==1)||(p92==1))))) * ((p254!=1)||(p334!...182
=> equivalent forward existential formula: ((([(EY((EY((Init * !(E(TRUE U EG((p382==1)))))) * !((p221==0)))) * !((p208==0)))] = FALSE * [(EY((Init * !(E(TR...470
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t61, t98, t101, t118, t121, t138, t141, t153, t172, t175, t178, t180, t184...257
(forward)formula 0,1,2.39632,68392,1,0,295,368635,443,199,4720,305528,481
FORMULA SmartHome-PT-13-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 01:52:19] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:52:19] [INFO ] Flatten gal took : 5 ms
Total runtime 288414 ms.

BK_STOP 1717033939713

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-13, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683811500434"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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