About the Execution of LTSMin+red for SmartHome-PT-18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
422.476 | 178347.00 | 224130.00 | 899.70 | FTTFTFTTFTFTFFFT | normal |
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.r532-smll-171683811600475.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 ltsminxred
Input is SmartHome-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683811600475
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 03:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 03:51 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 159K 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-18-LTLCardinality-00
FORMULA_NAME SmartHome-PT-18-LTLCardinality-01
FORMULA_NAME SmartHome-PT-18-LTLCardinality-02
FORMULA_NAME SmartHome-PT-18-LTLCardinality-03
FORMULA_NAME SmartHome-PT-18-LTLCardinality-04
FORMULA_NAME SmartHome-PT-18-LTLCardinality-05
FORMULA_NAME SmartHome-PT-18-LTLCardinality-06
FORMULA_NAME SmartHome-PT-18-LTLCardinality-07
FORMULA_NAME SmartHome-PT-18-LTLCardinality-08
FORMULA_NAME SmartHome-PT-18-LTLCardinality-09
FORMULA_NAME SmartHome-PT-18-LTLCardinality-10
FORMULA_NAME SmartHome-PT-18-LTLCardinality-11
FORMULA_NAME SmartHome-PT-18-LTLCardinality-12
FORMULA_NAME SmartHome-PT-18-LTLCardinality-13
FORMULA_NAME SmartHome-PT-18-LTLCardinality-14
FORMULA_NAME SmartHome-PT-18-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717259838059
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:37:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:37:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:37:20] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2024-06-01 16:37:20] [INFO ] Transformed 653 places.
[2024-06-01 16:37:20] [INFO ] Transformed 706 transitions.
[2024-06-01 16:37:20] [INFO ] Found NUPN structural information;
[2024-06-01 16:37:20] [INFO ] Parsed PT model containing 653 places and 706 transitions and 1618 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 206 places in 16 ms
Reduce places removed 206 places and 176 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-18-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 530/530 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 430 transition count 530
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 138 place count 309 transition count 409
Iterating global reduction 1 with 121 rules applied. Total rules applied 259 place count 309 transition count 409
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 269 place count 309 transition count 399
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 294 place count 284 transition count 374
Iterating global reduction 2 with 25 rules applied. Total rules applied 319 place count 284 transition count 374
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 343 place count 260 transition count 350
Iterating global reduction 2 with 24 rules applied. Total rules applied 367 place count 260 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 368 place count 260 transition count 349
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 379 place count 249 transition count 338
Iterating global reduction 3 with 11 rules applied. Total rules applied 390 place count 249 transition count 338
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 392 place count 247 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 394 place count 247 transition count 336
Applied a total of 394 rules in 252 ms. Remains 247 /447 variables (removed 200) and now considering 336/530 (removed 194) transitions.
// Phase 1: matrix 336 rows 247 cols
[2024-06-01 16:37:21] [INFO ] Computed 3 invariants in 34 ms
[2024-06-01 16:37:22] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-06-01 16:37:22] [INFO ] Invariant cache hit.
[2024-06-01 16:37:22] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-01 16:37:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/247 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/583 variables, 247/250 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 0/583 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 250 constraints, problems are : Problem set: 0 solved, 335 unsolved in 24165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/247 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 336/583 variables, 247/250 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 335/585 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 0/583 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 585 constraints, problems are : Problem set: 0 solved, 335 unsolved in 19440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
After SMT, in 43773ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43801ms
Starting structural reductions in LTL mode, iteration 1 : 247/447 places, 336/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44885 ms. Remains : 247/447 places, 336/530 transitions.
Support contains 9 out of 247 places after structural reductions.
[2024-06-01 16:38:06] [INFO ] Flatten gal took : 70 ms
[2024-06-01 16:38:06] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:38:06] [INFO ] Input system was already deterministic with 336 transitions.
RANDOM walk for 40000 steps (136 resets) in 838 ms. (47 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
[2024-06-01 16:38:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/39 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/101 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/104 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 138/242 variables, 48/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 107/349 variables, 48/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 92/441 variables, 44/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/441 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 86/527 variables, 42/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/527 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 28/555 variables, 21/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 7/562 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/562 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/567 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/567 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/571 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/571 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/577 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/577 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 6/583 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/583 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/583 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 250 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/39 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/101 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/104 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 138/242 variables, 48/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 107/349 variables, 48/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 92/441 variables, 44/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/441 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 86/527 variables, 42/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/527 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/555 variables, 21/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/555 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/562 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/562 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/567 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/567 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 4/571 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/571 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/577 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/577 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/583 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/583 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/583 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 583/583 variables, and 251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 336/336 transitions.
Graph (trivial) has 267 edges and 247 vertex of which 163 / 247 are part of one of the 14 SCC in 6 ms
Free SCC test removed 149 places
Drop transitions (Empty/Sink Transition effects.) removed 223 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 231 transitions.
Graph (complete) has 152 edges and 98 vertex of which 88 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 88 transition count 64
Reduce places removed 33 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 1 with 35 rules applied. Total rules applied 74 place count 55 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 54 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 75 place count 54 transition count 61
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 53 transition count 61
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 49 transition count 57
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 49 transition count 57
Performed 28 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 141 place count 21 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 26 edges and 21 vertex of which 12 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 20 rules applied. Total rules applied 161 place count 12 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 11 transition count 7
Reduce places removed 3 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 4 with 5 rules applied. Total rules applied 167 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 169 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 169 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 173 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 174 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 174 place count 3 transition count 2
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 176 place count 2 transition count 2
Applied a total of 176 rules in 63 ms. Remains 2 /247 variables (removed 245) and now considering 2/336 (removed 334) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 2/247 places, 2/336 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Computed a total of 40 stabilizing places and 39 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(F(p2)&&p1))))'
Support contains 4 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 336/336 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 244 transition count 333
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 244 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 244 transition count 332
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 242 transition count 330
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 242 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 241 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 241 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 240 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 240 transition count 328
Applied a total of 15 rules in 31 ms. Remains 240 /247 variables (removed 7) and now considering 328/336 (removed 8) transitions.
// Phase 1: matrix 328 rows 240 cols
[2024-06-01 16:38:07] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 16:38:07] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 16:38:07] [INFO ] Invariant cache hit.
[2024-06-01 16:38:08] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2024-06-01 16:38:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 328/568 variables, 240/243 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 0/568 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 243 constraints, problems are : Problem set: 0 solved, 327 unsolved in 22592 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 328/568 variables, 240/243 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 327/570 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 0/568 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 570 constraints, problems are : Problem set: 0 solved, 327 unsolved in 20282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
After SMT, in 42947ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 42953ms
Starting structural reductions in LTL mode, iteration 1 : 240/247 places, 328/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43262 ms. Remains : 240/247 places, 328/336 transitions.
Stuttering acceptance computed with spot in 621 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 871 steps with 3 reset in 15 ms.
FORMULA SmartHome-PT-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-00 finished in 43987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 336/336 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 242 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 242 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 242 transition count 329
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 240 transition count 327
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 240 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 239 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 239 transition count 326
Applied a total of 18 rules in 32 ms. Remains 239 /247 variables (removed 8) and now considering 326/336 (removed 10) transitions.
// Phase 1: matrix 326 rows 239 cols
[2024-06-01 16:38:51] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 16:38:51] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 16:38:51] [INFO ] Invariant cache hit.
[2024-06-01 16:38:52] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2024-06-01 16:38:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/565 variables, 239/242 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/565 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 242 constraints, problems are : Problem set: 0 solved, 325 unsolved in 22093 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 326/565 variables, 239/242 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 325/567 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 0/565 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 567 constraints, problems are : Problem set: 0 solved, 325 unsolved in 20141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints]
After SMT, in 42325ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 42332ms
Starting structural reductions in LTL mode, iteration 1 : 239/247 places, 326/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42767 ms. Remains : 239/247 places, 326/336 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 418 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Computed a total of 36 stabilizing places and 35 stable transitions
Computed a total of 36 stabilizing places and 35 stable transitions
Detected a total of 36/239 stabilizing places and 35/326 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-18-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-18-LTLCardinality-07 finished in 43547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 336/336 transitions.
Graph (trivial) has 265 edges and 247 vertex of which 163 / 247 are part of one of the 14 SCC in 1 ms
Free SCC test removed 149 places
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 97 transition count 104
Reduce places removed 28 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 1 with 30 rules applied. Total rules applied 59 place count 69 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 68 transition count 102
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 60 place count 68 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 64 transition count 98
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 60 transition count 90
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 60 transition count 90
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 134 place count 31 transition count 60
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 29 transition count 52
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 29 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 153 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 28 transition count 37
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 26 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 26 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 23 transition count 31
Applied a total of 161 rules in 24 ms. Remains 23 /247 variables (removed 224) and now considering 31/336 (removed 305) transitions.
[2024-06-01 16:39:35] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
// Phase 1: matrix 24 rows 23 cols
[2024-06-01 16:39:35] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 16:39:35] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 16:39:35] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2024-06-01 16:39:35] [INFO ] Invariant cache hit.
[2024-06-01 16:39:35] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 16:39:35] [INFO ] Redundant transitions in 32 ms returned []
Running 12 sub problems to find dead transitions.
[2024-06-01 16:39:35] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2024-06-01 16:39:35] [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) 20/38 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 6/44 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/47 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 225 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 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) 20/38 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 6/44 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/46 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/46 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 36 constraints, problems are : Problem set: 0 solved, 12 unsolved in 307 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 539ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/247 places, 31/336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 687 ms. Remains : 23/247 places, 31/336 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-12
Stuttering criterion allowed to conclude after 36 steps with 1 reset in 1 ms.
FORMULA SmartHome-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-12 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 336/336 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 241 transition count 330
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 241 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 241 transition count 328
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 238 transition count 325
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 238 transition count 325
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 236 transition count 323
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 236 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 235 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 235 transition count 322
Applied a total of 26 rules in 19 ms. Remains 235 /247 variables (removed 12) and now considering 322/336 (removed 14) transitions.
// Phase 1: matrix 322 rows 235 cols
[2024-06-01 16:39:36] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 16:39:36] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 16:39:36] [INFO ] Invariant cache hit.
[2024-06-01 16:39:36] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-01 16:39:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 238 constraints, problems are : Problem set: 0 solved, 321 unsolved in 21486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/557 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 559 constraints, problems are : Problem set: 0 solved, 321 unsolved in 18280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 39818ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 39823ms
Starting structural reductions in LTL mode, iteration 1 : 235/247 places, 322/336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40105 ms. Remains : 235/247 places, 322/336 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-18-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLCardinality-14 finished in 40233 ms.
All properties solved by simple procedures.
Total runtime 176393 ms.
ITS solved all properties within timeout
BK_STOP 1717260016406
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SmartHome-PT-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683811600475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-18.tgz
mv SmartHome-PT-18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;